SOLVING LINEAR RECURSIONS OVER ALL FIELDS
|
|
- Owen Atkins
- 6 years ago
- Views:
Transcription
1 SOLVING LINEAR RECURSIONS OVER ALL FIELDS KEITH CONRAD 1. Itroductio A sequece {a } = a 0, a 1, a,... i a field K satisfies a liear recursio if there are c 1,..., c d K such that 1.1 a = c 1 a 1 + c a + + c d a d for all d. For example, the Fiboacci sequece {F } = 0, 1, 1,, 3, 5, 8,... is defied by the liear recursio F = F 1 +F with iitial values F 0 = 0 ad F 1 = 1. Ofte F 0 is igored, but the values F 1 = F = 1 ad the recursio force F 0 = 0. We will assume c d 0 ad the say the recursio has order d; this is aalogous to the degree of a polyomial. For istace, the recursio a = a 1 + a has order. The sequeces i K satisfyig a commo recursio 1.1 are a K-vector space uder termwise additio. The iitial terms a 0, a 1,..., a d 1 determie the rest ad if c d 0 the we ca set the iitial d terms arbitrarily 1, so solutios to 1.1 form a d-dimesioal vector space i K. We see a explicit basis for the solutios of 1.1 described by ice formulas. Example 1.1. Solutios to a = a 1 + a i R are a -dimesioal space. A power sequece with 0 satisfies it whe = 1 +, which is equivalet to = +1. That maes a root of x x 1, so = 1± 5. The sequeces 1+ 5 ad 1 5 are ot scalar multiples, so they are a basis: i R if a = a 1 + a for all the a = α β 1 5 for uique α ad β i R. The Fiboacci sequece {F } is the special case where a 0 = 0 ad a 1 = 1. Solvig α + β = 0 ad α β 1 5 = 1 we get α = 1/ 5 ad β = 1/ 5 whe a = F. The solutio with a 0 = 1 ad a 1 = 0 uses α = ad β = If we replace R by ay field K i which x x 1 has roots, eve a field of characteristic p, the computatios above still wor if we replace 1± 5 by the roots i K uless K has characteristic 5: there x x 1 = x + 4x + 4 = x + so 3 is the oly root ad the oly power sequece satisfyig a = a 1 + a is {3 } = 1, 3, 4,, 1, 3, 4,.... Example 1.. Let K have characteristic 5. What ice formula fits a = a 1 + a ad is liearly idepedet of {3 } = 1, 3, 4,...? The sequece a = 3 1 wors sice a 1 + a = = = = 3 1 = a. This starts out as 0, 1, 1,, 3, 0, 3, 3,..., so it is F mod 5 ad is ot a multiple of {3 }. 1 What if cd = 0? If a = a 1 the the first term determies the rest, so the solutio space is 1- dimesioal. Writig the recursio as a = a 1 + 0a does t mae the solutio space -dimesioal uless we isist the recursio is for rather tha for 1. We will ot address this optio. 1
2 KEITH CONRAD How is {3 1 } foud? If { } ad {µ } satisfy the same liear recursio, so does ay liear combiatio. If µ a liear combiatio is µ / µ, ad as µ this becomes { 1 }, which up to scalig is { }. This suggests that sice 3 is a double root of x x 1 i characteristic 5, {3 1 } should be a solutio ad we saw it really is. The formula F 3 1 mod 5 goes bac at least to Catala [3, p. 86] i Our goal is to prove the followig theorem about a basis for solutios to a liear recursio over a geeral field K. Theorem 1.3. Let a = c 1 a 1 + c a + + c d a d be a liear recursio of order d with c i K. Assume 1 c 1 x c x c d x d factors i K[x] over its reciprocal roots the such that 1/ is a root as 1 1 x e1 1 r x er, where the i are distict ad e i 1. A basis for the solutios of the liear recursio i K is give by the e i sequeces { i }, { i }, { i },..., { e i 1 i } for i = 1,..., r. Example 1.4. The simplest case of Theorem 1.3 is whe each reciprocal root has multiplicity 1: if 1 c 1 x c x c d x d = 1 1 x 1 d x has d distict reciprocal roots i the the solutios of 1.1 are uique liear combiatios of the i : a = α α d d. Example 1.5. The recursio a = 8a 1 4a +3a 3 16a 4 has order 4 if K does ot have characteristic. Sice 1 8x + 4x 3x x 4 = 1 x 4, the solutios have basis { }, { }, { }, ad { 3 }, so every solutio is b 0 + b 1 + b + b3 3 for uique b i K. The classical versio of Theorem 1.3 i C, or more geerally characteristic 0, is due to Lagrage ad says a basis of the solutios is the sequeces { i } for < e i ad i = 1,..., r. This wors i characteristic p if all e i p but breas dow if ay e i > p, so it s essetial to use { i } to have a result valid i all fields. While mod p has period p i, mod p has a loger period if p. For istace, i characteristic the sequece mod has period 4 with repeatig values 0, 0, 1, 1 whe rus through the oegative itegers. We will prove Theorem 1.3 i two ways: by geeratig fuctios ad by a aalogy with differetial equatios. Aa Medvedovsy brought this problem i characteristic p to my attetio ad the secod proof is a variatio o hers. After writig this up I foud a result equivalet to Theorem 1.3 i a paper of Fillmore ad Marx [4, Thm. 1, ] ad the case of fiite K i McEliece s Ph.D. thesis [5, p. 19]. The earliest paper I foud metioig the basis { i } i characteristic p is by Egstrom [, p. 15] i 1931 whe max e i = p, but { i } still wors i that case. I 1933, Mile-Thomso [7, p. 388] i characteristic 0 gave the basis { i } ad remared that the alterative { 1 i } is sometimes coveiet.. First Proof: Geeratig Fuctios It is easy to show the sequece { } fits 1.1 if is a reciprocal root of 1 c 1 x c d x d : = c c + + c d d for all 0 d = c 1 d 1 + c d + + c d d c 1 d 1 c d = 0, 1 c 1 c d d = 0. There is a aalogous result i differetial equatios: the solutio space to y t + ay t + byt = 0 has basis {e t, e µt } if ad µ are differet roots of x + ax + b. If x + ax + b has a double root the a basis of the solutio space is {e t, te t }. So e t ad te t. We ll retur to this aalogy i Sectio 3.
3 SOLVING LINEAR RECURSIONS OVER ALL FIELDS 3 It s more difficult to show for a 1 satisfies 1.1 if is a reciprocal root of 1 c 1 x c d x d with multiplicity greater tha. To do this, we will rely o the followig theorem characterizig liearly recursive sequeces i terms of their geeratig fuctios. Theorem.1. If the liear recursio 1.1 has c d 0 the a sequece {a } i K satisfies 1.1 if ad oly if the geeratig fuctio 0 a x is a ratioal fuctio of the form Nx/1 c 1 x c x c d x d where Nx = 0 or deg Nx < d. Proof. Set F x = 0 a x. Usig 1.1, F x = a 0 + a 1 x + + a d 1 x d 1 + d a x = a 0 + a 1 x + + a d 1 x d 1 + c 1 a 1 + c a + + c d a d x d d = a 0 + a 1 x + + a d 1 x d 1 + c i a i x = a 0 + a 1 x + + a d 1 x d 1 + = a 0 + a 1 x + + a d 1 x d 1 + = a 0 + a 1 x + + a d 1 x d 1 + d d c i x i a i x i d d c i x i d i a x d d i 1 c i x F i x a x. The term i the sum at i = d is just c d x d F x; the ier sum from = 0 to = 1 i this case is 0. Brigig d c ix i F x over to the left side, we ca solve for F x as a ratioal fuctio: Nx F x = 1 c 1 x c x c d x d where Nx, if ot idetically 0, is a polyomial of degree at most d 1. Coversely, assume for {a } i K that 0 a x = Nx/1 c 1 x c d x d where Nx = 0 or deg Nx < d. The =0 Nx = a x 1 c 1 x c x c d x d. 0 Equatig the coefficiet of x o both sides for d, 0 = a c 1 a 1 c a c d a d, which is the liear recursio 1.1. Corollary.. I the liear recursio 1.1 suppose c d 0. For K, if 1 x is a factor of 1 c 1 x c d x d with multiplicity e 1 the for 0 e 1 the sequece { } satisfies 1.1.
4 4 KEITH CONRAD Proof. Theorem.1 tells us that our tas is equivalet to showig the geeratig fuctio 0 x ca be writte i the form Nx/1 c 1 x c d x d where Nx = 0 or deg Nx < d. We ll do this with a Nx of degree d 1. I Z[[x]], differetiatig the geometric series formula 0 x = 1/1 x a total of times ad the dividig both sides by! gives us the formal power series idetity.1 0 x = 1 1 x +1. Sice Z has a uique homomorphism to ay commutative rig,.1 is true i K[[x]]. 3 Multiply both sides by x :. x x = 1 x +1. We chaged the sum o the left to ru over 0 istead of, which is oay sice = 0 for 0 1. Replacig x with x i.,.3 0 x = x 1 x +1. Sice e 1, 1 x +1 is a factor of 1 x e, which is a factor of 1 c 1 x c d x d. Set 1 c 1 x c d x d = 1 x e gx. If we multiply the top ad bottom of the right side of.3 by 1 x e +1 gx, which has degree d + 1 because c d 0, we get 0 x = where deg Nx = + d + 1 = d 1 < d. Nx 1 c 1 x c x c d x d We proved i Corollary. that the sequeces { i } for 1 i r ad 0 e i 1 satisfy 1.1 whe c d 0. The umber of these sequeces is 4 r e i = d, which is the dimesio of the solutio space, so to fiish the proof of Theorem 1.3 we will show these d sequeces are liearly idepedet: if b i K satisfy.4 r e i 1 =0 b i i = 0 for all 0 the we wat to show each b i is 0. The sequece { r geeratig fuctio b i i x = b i i x i i 0 0 ei 1 =0 b i i } for 0 has.3 = i b i i x 1 i x +1, 3 We ca t prove.1 i K[[x]] directly for all fields K usig repeated differetiatio, sice i fields of characteristic p the pth ad higher-order derivatives are idetically 0. It could be proved directly i K[[x]] if K has characteristic p by usig Hasse derivatives. 4 Here we require that the liear recursio has order d, or equivaletly that cd 0.
5 SOLVING LINEAR RECURSIONS OVER ALL FIELDS 5 so this double sum is 0, sice it s the geeratig fuctio of the zero sequece. For each i, the ier sum over is.5 b i0 1 i x + b i1 i x 1 i x + b i i x 1 i x b i e i 1 ei 1 i 1 i x e i x e i 1 Puttig these terms over a commo deomiator, the sum is q i x/1 i x e i for a polyomial q i x ad the vaishig geeratig fuctio for.4 becomes.6 q 1 x 1 1 x e + + q r x = 0. 1 er 1 r x By costructio, each q i x is 0 or deg q i x < e i. What ca we say about each q i x? Lemma.3. Let 1,..., r i K be distict such that.6 is satisfied, where e 1,..., e r are positive itegers ad q 1 x,..., q r x are i K[x] with q i x = 0 or deg q i x < e i for all i. The every q i x is 0. Proof. We argue by iductio o r. The case r = 1 is obvious. If r ad the result is true for r 1 the multiply.6 through by the product 1 1 x e1 1 r x er : r q i x1 1 x e1 1 i x e i 1 r x er = 0, where the hat idicates a omitted factor i the ith term, for every i. Each term i this sum is a polyomial, ad all the terms besides the oe for i = r have 1 r x er as a factor. Thus the term at i = r is divisible by 1 r x er. That term is q r x1 1 x e1 1 r 1 x e r 1. Sice 1,..., r 1 are distict from r, 1 r x er must divide q r x. But q r x, if ot 0, has degree less tha e r by hypothesis. Therefore q r x = 0, so the rth term i.6 is 0, which maes every other q i x equal to 0 by iductio. Remar.4. This lemma becomes obvious if a term i.6 is moved to the other side, say q r x/1 r x er. If q r x 0 the the right side blows up at x = 1/ r sice the umerator ca t completely cacel the deomiator because deg q r x < e r, but the left side without the term q r x/1 r x er has a fiite value at x = 1/ r. Thus q r x = 0. Theorem.5. For 1,..., r K ad positive itegers e 1,..., e r, the sequeces { i } for i = 1,..., r ad = 0,..., e i 1 are liearly idepedet over K. Proof. If the sequeces satisfy a K-liear relatio.4 the applyig Lemma.3 to.6 shows each q i x vaishes, so.5 vaishes for each i. Sice.5 is the geeratig fuctio of the sequece with th term e i 1 =0 b i i, we get.7 e i 1 =0 b i i = 0 for each i ad all 0. We passed from a liear relatio.4 ivolvig several i s to a liear relatio.7 that ivolves just a sigle i that is oe of the ier sums i.4. I.7 we ca cacel the commo ozero factor i : ei 1 =0 b i = 0 for all 0..
6 6 KEITH CONRAD Let s write this out as a system of liear equatios at = 0, 1,..., e i 1: b i b i b i = b i ei 1 The matrix is ivertible i K, so b i = 0 for all i ad. Remar.6. Liear recursios over fiite fields are of iterest to codig theorists because of their close relatio to cyclic codes, a special type of liear code. The importat costructios of cyclic codes, lie Reed Solomo ad BCH codes, are related to liear recursios whose characteristic polyomial 5 has distict roots. Cyclic codes where the characteristic polyomial has repeated roots have bee studied [1], ad for a umber of reasos they are ot competitive with the stadard distict root cyclic codes. 3. Iterlude: Aalogy with Differetial Equatios Liear recursios are aalogous to liear differetial equatios, ad our secod proof of Theorem 1.3 will be motivated by this aalogy, which we set up i this sectio. A sequece {a } satisfyig a = c 1 a 1 + c a + + c d a d ca be compared with a fuctio yt satisfyig 3.1 y d t = c 1 y d 1 t + c y d t + + c d yt, which is a dth-order liear ODE with costat coefficiets. The solutio space to such a ODE is d-dimesioal. How similar are solutios to the recursio ad the ODE? Example 3.1. A first-order liear recursio a = ca 1 has geeral solutio a = a 0 c, while a first-order ODE of the form y t = cyt has geeral solutio yt = y0e ct. The geometric progressio c is aalogous to the expoetial fuctio e ct. Example 3.. A secod-order liear recursio a = ba 1 + ca has a geeral solutio that depeds o whether or ot the factorizatio 1 bx cx = 1 x1 µx has distict or repeated reciprocal roots: { α + βµ, if µ, a = α + β, if = µ. A secod-order ODE of the form y t = by t + cyt has a geeral solutio that depeds o whether or ot the factorizatio x bx c = x x µ has distict or repeated roots: { αe t + βe µt, if µ, yt = αe t + βte t, if = µ. Lettig D = d/dt, the differetial equatio 3.1 ca be writte as 3. D d c 1 D d 1 c d yt = 0, so solutios of 3.1 are the ullspace of the differetial operator 3.3 D d c 1 D d 1 c d, 5 This is x d c 1x d 1 c d i our otatio.. 0
7 SOLVING LINEAR RECURSIONS OVER ALL FIELDS 7 which acts o the real vector space of smooth fuctios R R. O sequeces, the aalogue of D is the left-shift operator L: if a = a 0, a 1, a,... the La = a 1, a, a 3,..., or equivaletly L{a } = {a +1 }. This is a liear operator o the K-vector space SeqK of sequeces with coordiates i K. Here is the aalogue of 3. that ca serve as a characterizatio of sequeces satisfyig a liear recursio i place of Theorem.1. Theorem 3.3. A sequece a = {a } i SeqK satisfies the liear recursio 1.1 if ad oly if L d c 1 L d 1 c d Ia = 0, where I is the idetity operator o SeqK ad 0 = 0, 0, 0,.... Proof. For i 0, the sequece L i a has th compoet a +i, so the sequece c i L i a has th compoet c i a +i. The th compoet of L d c 1 L d 1 c d Ia is a +d c 1 a +d 1 c d a, which is 0 for all if ad oly if a satisfies 1.1. Example 3.4. If a sequece a satisfies a = a 1 + a the L L Ia has th compoet a + a +1 a, which is 0 for all, so L L Ia = 0. To solve the differetial equatio 3., factor the polyomial x d c 1 x d 1 c d over C to get a factorizatio of the differetial operator 3.3: x d c 1 x d 1 c d = x i e i = D d c 1 D d 1 c d = D i e i, where 1,..., r are distict ad e i 1. We have to allow i C, so for compatibility let D = d/dt act o the smooth fuctios R C fuctios whose real ad imagiary parts are ordiary smooth fuctios R R. The operators D i e i for i = 1,,..., r commute, so C-valued solutios yt to the differetial equatio D i e i yt = 0 are solutios to 3.1. This is eough to describe all solutios of 3.1: Theorem 3.5. Usig the above otatio, a C-basis of solutios to D i e i yt = 0 is e it, te it,..., t e i 1 e it, ad puttig these together for i = 1,..., r gives a C-basis of solutios to 3.1. We omit a proof of this theorem, which for us serves oly as motivatio. I the simplest case that each e i is 1, so x d c 1 x d 1 c d = d x i, a basis of the solutio space to 3.1 is e 1t,..., e dt, which is aalogous to Example 1.4. Remar 3.6. Sice the i i Theorem 3.5 are i C, the solutio space i the theorem is the complex-valued solutios of 3.1. If the coefficiets c i i 3.1 are all real, the eve if some i i Theorem 3.5 is ot real ad therefore some t e it is ot a real-valued fuctio, it ca be proved that the R-valued solutio space to 3.1 is d-dimesioal over R. 4. Secod Proof: Liear Operators We will apply the ideas from Sectio 3 to the liear operator L d c 1 L d 1 c d I i Theorem 3.3 to reprove Theorem 1.3 usig a argumet of Aa Medvedovsy [6, App. B]. Our first approach to provig Theorem 1.3 ivolved the polyomial 1 c 1 x c d x d ad its reciprocal roots ad their multiplicities. By aalogy with the method of solvig differetial equatios, we will ow use the polyomial x d c 1 x d 1 c d istead. These two polyomials are reciprocal i the sese that x d c 1 x d 1 c d = x d 1 c 1 x c d x d.
8 8 KEITH CONRAD Therefore x d c 1 x d 1 c d = x i e i 1 c 1 x c d x d = 1 i x e i, where i j for i j, so reciprocal roots of 1 c 1 x c x c d x d are ordiary roots of x d c 1 x d 1 c d, with matchig multiplicities. Sice c d 0, o i is 0. Theorem 3.3 tells us that a sequece a SeqK satisfies 1.1 precisely whe a is i the erel of L d c 1 L d 1 c d I. Sice 4.1 x d c 1 x d 1 c d = x i e i = L d c 1 L d 1 c d I = L i I e i ad the operators L i I e i for differet i commute, ay a i the erel of some L i I e i is a solutio of 1.1. Solutios to L i I e i a = 0 belog to the geeralized i -eigespace of L, which is the set of a illed by some positive iteger power of L i I. If e i = 1, such a form the i -eigespace of L: L i Ia = 0 if ad oly if La = i a. The i -eigevectors are the ozero vectors i the i -eigespace, ad the ozero vectors i a geeralized eigespace are called geeralized eigevectors. Our secod proof of Theorem 1.3, lie the first, is established i two steps by provig results lie Corollary. ad Theorem.5. Theorem 4.1. If K is a root of x d c 1 x d 1 c d with multiplicity e 1 the the sequece { } for = 0, 1,..., e 1 satisfies 1.1. Proof. Sice x e is a factor of x d c d 1 x d 1 c d, it suffices by Theorem 3.3 to show the sequece { } for 0 e 1 is illed by L I e to mae it satisfy 1.1. First we treat = 0. Sice L{ } = { +1 } = { }, we get L I{ } = 0. Therefore L I e { } = 0. Let 1. Applyig L I to { }, we get the sequece { } { } { } { } + 1 L I = L = For 1, +1 = 1 +, so By iductio, L I { } = { } L I i = { } { } +i i for 1 i. Thus L I { } = { + } = { }. The sequece { } is a -eigevector of L, ad hece is i the erel of L I, so applyig L I more tha times to the sequece { } ills it. Thus L I e { } = 0 for e >. Secod proof of Theorem.5. Suppose a K-liear combiatio of these sequeces vaishes, say r e i 1 { } 4. b i i = 0. =0
9 SOLVING LINEAR RECURSIONS OVER ALL FIELDS 9 with b i K. We wat to show each b i is 0. For each i, the sequeces { i } for 0 e i 1 are all illed by L i I e i by Theorem 4.1, so the ier sum v i := e i 1 =0 b i{ i } i 4. belogs to the geeralized i -eigespace of L. A stadard theorem i liear algebra says that eigevectors of a liear operator associated to differet eigevalues are liearly idepedet, ad this exteds to geeralized eigevectors of a liear operator associated to differet eigevalues; a proof of that is i the appedix ad serves as a aalogue of Lemma.3. Sice v 1,..., v r belog to geeralized eigespaces associated to differet eigevalues of L, ad v 1 + +v r = 0, each v i must be 0; if ay v i were ot 0 the the vaishig sum over the ozero v i would be a liear depedece relatio amog geeralized eigevectors associated to distict eigevalues. The equatio v i = 0 says e i 1 { } 4.3 b i i = 0. =0 The passage from 4. to 4.3 is a aalogue of the passage from.4 to.7, ad 4.3 for i = 1,..., r is exactly the same as.7, so we ca fiish off this proof i the same way that we did before: equatig the coordiates o both sides of 4.3 for = 0,..., e i 1 ad dividig by i leads to the matrix equatio.8 so all b i are 0. Appedix A. Liear Idepedece of Geeralized Eigevectors Theorem A.1. Let V be a K-vector space, A: V V be a liear operator, ad v 1,..., v r i V be geeralized eigevectors of A associated to distict respective eigevalues 1,..., r. The v 1,..., v r are liearly idepedet over K. Proof. Sice v i is a geeralized eigevector of A associated to the eigevalue i, v i 0 ad A i I e i v i = 0 for some e i 1. Suppose there is a liear relatio b 1 v b r v r = 0 for some b 1,..., b r K. We wat to prove each b i is 0, ad will argue by iductio o r. The result is clear if r = 1, sice v 1 0, so suppose r ad the lemma is proved for r 1 geeralized eigevectors associated to distict eigevalues. The operators A i I e i commute, so applyig the product A 1 I e1 A r 1 e r 1 to the liear relatio ills the first r 1 terms ad leaves us with b r A 1 I e1 A r 1 e r 1 v r = 0. If b r 0 the v r is illed by A 1 I e1 A r 1 e r 1. It is also illed by A r I er. I K[x] the polyomials x 1 e1 x r 1 e r 1 ad x r er are relatively prime sice r 1,..., r 1, so there s a polyomial idetity gxx 1 e1 x r 1 e r 1 + hxx r er = 1 for some gx ad hx i K[x]. Thus gaa 1 I e1 A r 1 I e r 1 + haa r I er = I, ad applyig both sides to v r implies 0 = v r, which is a cotradictio. Thus b r = 0. The liear relatio amog the v i simplifies to b 1 v b r 1 v r 1 = 0, so by iductio all the remaiig b i equal 0.
10 10 KEITH CONRAD Refereces [1] G. Castagoli, J. L. Massey, P. A. Schoeller, ad N. vo Seema, O Repeated-Root Cyclic Codes, IEEE Tras. Iform. Theory , [] H. T. Egstrom, O sequeces defied by liear recurrece relatios, Tras. AMS , Olie at S pdf. [3] E. Catala, Mauel des Cadidats à l École Polytechique, Tome 1, Olie at https: //boos.google.com/boos?id=zwditswmaamc&pg=pr1&lpg=pr1&dq=mauel+des+cadidats+a+l% 7ecole+polytechique&source=bl&ots=S07mvdvW8&sig=hgtPbUzXIQ_pM9i4fupwKQF c&hl=e& sa=x&ei=nujkvfsdceyogstjicoca&ved=0cciq6aewaq#v=oepage&q=mauel%0des%0cadidats%0a% 0l ecole%0polytechique&f=false. [4] J. P. Fillmore ad M. L. Marx, Liear Recursive Sequeces, SIAM Review , [5] R. J. McEliece, Liear Recurrig Sequeces over Fiite Fields, Ph.D. thesis, Caltech, Olie at [6] A. Medvedovsy, Lower bouds o dimesios of mod-p Hece algebras: The ilpotece method, Ph.D. thesis, Bradeis, 015. [7] L. M. Mile-Thomso, The Calculus of Fiite Differeces, MacMilla ad Co., Lodo, Olie at
1 Last time: similar and diagonalizable matrices
Last time: similar ad diagoalizable matrices Let be a positive iteger Suppose A is a matrix, v R, ad λ R Recall that v a eigevector for A with eigevalue λ if v ad Av λv, or equivaletly if v is a ozero
More informationMath 2784 (or 2794W) University of Connecticut
ORDERS OF GROWTH PAT SMITH Math 2784 (or 2794W) Uiversity of Coecticut Date: Mar. 2, 22. ORDERS OF GROWTH. Itroductio Gaiig a ituitive feel for the relative growth of fuctios is importat if you really
More information1 Generating functions for balls in boxes
Math 566 Fall 05 Some otes o geeratig fuctios Give a sequece a 0, a, a,..., a,..., a geeratig fuctio some way of represetig the sequece as a fuctio. There are may ways to do this, with the most commo ways
More informationMath 155 (Lecture 3)
Math 55 (Lecture 3) September 8, I this lecture, we ll cosider the aswer to oe of the most basic coutig problems i combiatorics Questio How may ways are there to choose a -elemet subset of the set {,,,
More informationZeros of Polynomials
Math 160 www.timetodare.com 4.5 4.6 Zeros of Polyomials I these sectios we will study polyomials algebraically. Most of our work will be cocered with fidig the solutios of polyomial equatios of ay degree
More informationLECTURE NOTES, 11/10/04
18.700 LECTURE NOTES, 11/10/04 Cotets 1. Direct sum decompositios 1 2. Geeralized eigespaces 3 3. The Chiese remaider theorem 5 4. Liear idepedece of geeralized eigespaces 8 1. Direct sum decompositios
More informationInfinite Sequences and Series
Chapter 6 Ifiite Sequeces ad Series 6.1 Ifiite Sequeces 6.1.1 Elemetary Cocepts Simply speakig, a sequece is a ordered list of umbers writte: {a 1, a 2, a 3,...a, a +1,...} where the elemets a i represet
More informationProperties and Tests of Zeros of Polynomial Functions
Properties ad Tests of Zeros of Polyomial Fuctios The Remaider ad Factor Theorems: Sythetic divisio ca be used to fid the values of polyomials i a sometimes easier way tha substitutio. This is show by
More informationRecurrence Relations
Recurrece Relatios Aalysis of recursive algorithms, such as: it factorial (it ) { if (==0) retur ; else retur ( * factorial(-)); } Let t be the umber of multiplicatios eeded to calculate factorial(). The
More informationWe are mainly going to be concerned with power series in x, such as. (x)} converges - that is, lims N n
Review of Power Series, Power Series Solutios A power series i x - a is a ifiite series of the form c (x a) =c +c (x a)+(x a) +... We also call this a power series cetered at a. Ex. (x+) is cetered at
More informationSolutions to Problem Set 8
8.78 Solutios to Problem Set 8. We ow that ( ) ( + x) x. Now we plug i x, ω, ω ad add the three equatios. If 3 the we ll get a cotributio of + ω + ω + ω + ω 0, whereas if 3 we ll get a cotributio of +
More informationFLOOR AND ROOF FUNCTION ANALOGS OF THE BELL NUMBERS. H. W. Gould Department of Mathematics, West Virginia University, Morgantown, WV 26506, USA
INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 7 (2007), #A58 FLOOR AND ROOF FUNCTION ANALOGS OF THE BELL NUMBERS H. W. Gould Departmet of Mathematics, West Virgiia Uiversity, Morgatow, WV
More informationCHAPTER I: Vector Spaces
CHAPTER I: Vector Spaces Sectio 1: Itroductio ad Examples This first chapter is largely a review of topics you probably saw i your liear algebra course. So why cover it? (1) Not everyoe remembers everythig
More informationECE-S352 Introduction to Digital Signal Processing Lecture 3A Direct Solution of Difference Equations
ECE-S352 Itroductio to Digital Sigal Processig Lecture 3A Direct Solutio of Differece Equatios Discrete Time Systems Described by Differece Equatios Uit impulse (sample) respose h() of a DT system allows
More informationRecursive Algorithms. Recurrences. Recursive Algorithms Analysis
Recursive Algorithms Recurreces Computer Sciece & Egieerig 35: Discrete Mathematics Christopher M Bourke cbourke@cseuledu A recursive algorithm is oe i which objects are defied i terms of other objects
More informationApplication of Jordan Canonical Form
CHAPTER 6 Applicatio of Jorda Caoical Form Notatios R is the set of real umbers C is the set of complex umbers Q is the set of ratioal umbers Z is the set of itegers N is the set of o-egative itegers Z
More informationThe multiplicative structure of finite field and a construction of LRC
IERG6120 Codig for Distributed Storage Systems Lecture 8-06/10/2016 The multiplicative structure of fiite field ad a costructio of LRC Lecturer: Keeth Shum Scribe: Zhouyi Hu Notatios: We use the otatio
More information, then cv V. Differential Equations Elements of Lineaer Algebra Name: Consider the differential equation. and y2 cos( kx)
Cosider the differetial equatio y '' k y 0 has particular solutios y1 si( kx) ad y cos( kx) I geeral, ay liear combiatio of y1 ad y, cy 1 1 cy where c1, c is also a solutio to the equatio above The reaso
More information5. Matrix exponentials and Von Neumann s theorem The matrix exponential. For an n n matrix X we define
5. Matrix expoetials ad Vo Neuma s theorem 5.1. The matrix expoetial. For a matrix X we defie e X = exp X = I + X + X2 2! +... = 0 X!. We assume that the etries are complex so that exp is well defied o
More information8. Applications To Linear Differential Equations
8. Applicatios To Liear Differetial Equatios 8.. Itroductio 8.. Review Of Results Cocerig Liear Differetial Equatios Of First Ad Secod Orders 8.3. Eercises 8.4. Liear Differetial Equatios Of Order N 8.5.
More informationNICK DUFRESNE. 1 1 p(x). To determine some formulas for the generating function of the Schröder numbers, r(x) = a(x) =
AN INTRODUCTION TO SCHRÖDER AND UNKNOWN NUMBERS NICK DUFRESNE Abstract. I this article we will itroduce two types of lattice paths, Schröder paths ad Ukow paths. We will examie differet properties of each,
More information6 Integers Modulo n. integer k can be written as k = qn + r, with q,r, 0 r b. So any integer.
6 Itegers Modulo I Example 2.3(e), we have defied the cogruece of two itegers a,b with respect to a modulus. Let us recall that a b (mod ) meas a b. We have proved that cogruece is a equivalece relatio
More informationDIVISIBILITY PROPERTIES OF GENERALIZED FIBONACCI POLYNOMIALS
DIVISIBILITY PROPERTIES OF GENERALIZED FIBONACCI POLYNOMIALS VERNER E. HOGGATT, JR. Sa Jose State Uiversity, Sa Jose, Califoria 95192 ad CALVIN T. LONG Washigto State Uiversity, Pullma, Washigto 99163
More information3.2 Properties of Division 3.3 Zeros of Polynomials 3.4 Complex and Rational Zeros of Polynomials
Math 60 www.timetodare.com 3. Properties of Divisio 3.3 Zeros of Polyomials 3.4 Complex ad Ratioal Zeros of Polyomials I these sectios we will study polyomials algebraically. Most of our work will be cocered
More informationSequences, Mathematical Induction, and Recursion. CSE 2353 Discrete Computational Structures Spring 2018
CSE 353 Discrete Computatioal Structures Sprig 08 Sequeces, Mathematical Iductio, ad Recursio (Chapter 5, Epp) Note: some course slides adopted from publisher-provided material Overview May mathematical
More information[ 11 ] z of degree 2 as both degree 2 each. The degree of a polynomial in n variables is the maximum of the degrees of its terms.
[ 11 ] 1 1.1 Polyomial Fuctios 1 Algebra Ay fuctio f ( x) ax a1x... a1x a0 is a polyomial fuctio if ai ( i 0,1,,,..., ) is a costat which belogs to the set of real umbers ad the idices,, 1,...,1 are atural
More informationCALCULATION OF FIBONACCI VECTORS
CALCULATION OF FIBONACCI VECTORS Stuart D. Aderso Departmet of Physics, Ithaca College 953 Daby Road, Ithaca NY 14850, USA email: saderso@ithaca.edu ad Dai Novak Departmet of Mathematics, Ithaca College
More informationANOTHER GENERALIZED FIBONACCI SEQUENCE 1. INTRODUCTION
ANOTHER GENERALIZED FIBONACCI SEQUENCE MARCELLUS E. WADDILL A N D LOUIS SACKS Wake Forest College, Wisto Salem, N. C., ad Uiversity of ittsburgh, ittsburgh, a. 1. INTRODUCTION Recet issues of umerous periodicals
More information6.3 Testing Series With Positive Terms
6.3. TESTING SERIES WITH POSITIVE TERMS 307 6.3 Testig Series With Positive Terms 6.3. Review of what is kow up to ow I theory, testig a series a i for covergece amouts to fidig the i= sequece of partial
More informationDeterminants of order 2 and 3 were defined in Chapter 2 by the formulae (5.1)
5. Determiats 5.. Itroductio 5.2. Motivatio for the Choice of Axioms for a Determiat Fuctios 5.3. A Set of Axioms for a Determiat Fuctio 5.4. The Determiat of a Diagoal Matrix 5.5. The Determiat of a Upper
More informationSolutions to Final Exam
Solutios to Fial Exam 1. Three married couples are seated together at the couter at Moty s Blue Plate Dier, occupyig six cosecutive seats. How may arragemets are there with o wife sittig ext to her ow
More informationMath 61CM - Solutions to homework 3
Math 6CM - Solutios to homework 3 Cédric De Groote October 2 th, 208 Problem : Let F be a field, m 0 a fixed oegative iteger ad let V = {a 0 + a x + + a m x m a 0,, a m F} be the vector space cosistig
More informationEigenvalues and Eigenvectors
5 Eigevalues ad Eigevectors 5.3 DIAGONALIZATION DIAGONALIZATION Example 1: Let. Fid a formula for A k, give that P 1 1 = 1 2 ad, where Solutio: The stadard formula for the iverse of a 2 2 matrix yields
More informationL-FUNCTIONS FOR GAUSS AND JACOBI SUMS
L-FUNCTIONS FOR GAUSS AND JACOBI SUMS KEITH CONRAD 1. Itroductio For a multiplicative character χ: F q C ad additive character ψ : F q C o a fiite field F q of order q, their Gauss sum is G(χ, ψ) = χ(c)ψ(c),
More informationENGI Series Page 6-01
ENGI 3425 6 Series Page 6-01 6. Series Cotets: 6.01 Sequeces; geeral term, limits, covergece 6.02 Series; summatio otatio, covergece, divergece test 6.03 Stadard Series; telescopig series, geometric series,
More informationMath 475, Problem Set #12: Answers
Math 475, Problem Set #12: Aswers A. Chapter 8, problem 12, parts (b) ad (d). (b) S # (, 2) = 2 2, sice, from amog the 2 ways of puttig elemets ito 2 distiguishable boxes, exactly 2 of them result i oe
More informationOn the Linear Complexity of Feedback Registers
O the Liear Complexity of Feedback Registers A. H. Cha M. Goresky A. Klapper Northeaster Uiversity Abstract I this paper, we study sequeces geerated by arbitrary feedback registers (ot ecessarily feedback
More informationGenerating Functions II
Geeratig Fuctios II Misha Lavrov ARML Practice 5/4/2014 Warm-up problems 1. Solve the recursio a +1 = 2a, a 0 = 1 by usig commo sese. 2. Solve the recursio b +1 = 2b + 1, b 0 = 1 by usig commo sese ad
More information3. Z Transform. Recall that the Fourier transform (FT) of a DT signal xn [ ] is ( ) [ ] = In order for the FT to exist in the finite magnitude sense,
3. Z Trasform Referece: Etire Chapter 3 of text. Recall that the Fourier trasform (FT) of a DT sigal x [ ] is ω ( ) [ ] X e = j jω k = xe I order for the FT to exist i the fiite magitude sese, S = x [
More informationSequences. Notation. Convergence of a Sequence
Sequeces A sequece is essetially just a list. Defiitio (Sequece of Real Numbers). A sequece of real umbers is a fuctio Z (, ) R for some real umber. Do t let the descriptio of the domai cofuse you; it
More informationChapter 10: Power Series
Chapter : Power Series 57 Chapter Overview: Power Series The reaso series are part of a Calculus course is that there are fuctios which caot be itegrated. All power series, though, ca be itegrated because
More informationSome remarks for codes and lattices over imaginary quadratic
Some remarks for codes ad lattices over imagiary quadratic fields Toy Shaska Oaklad Uiversity, Rochester, MI, USA. Caleb Shor Wester New Eglad Uiversity, Sprigfield, MA, USA. shaska@oaklad.edu Abstract
More informationA Note on the Symmetric Powers of the Standard Representation of S n
A Note o the Symmetric Powers of the Stadard Represetatio of S David Savitt 1 Departmet of Mathematics, Harvard Uiversity Cambridge, MA 0138, USA dsavitt@mathharvardedu Richard P Staley Departmet of Mathematics,
More informationALGEBRAIC GEOMETRY COURSE NOTES, LECTURE 5: SINGULARITIES.
ALGEBRAIC GEOMETRY COURSE NOTES, LECTURE 5: SINGULARITIES. ANDREW SALCH 1. The Jacobia criterio for osigularity. You have probably oticed by ow that some poits o varieties are smooth i a sese somethig
More informationMath 104: Homework 2 solutions
Math 04: Homework solutios. A (0, ): Sice this is a ope iterval, the miimum is udefied, ad sice the set is ot bouded above, the maximum is also udefied. if A 0 ad sup A. B { m + : m, N}: This set does
More informationHoggatt and King [lo] defined a complete sequence of natural numbers
REPRESENTATIONS OF N AS A SUM OF DISTINCT ELEMENTS FROM SPECIAL SEQUENCES DAVID A. KLARNER, Uiversity of Alberta, Edmoto, Caada 1. INTRODUCTION Let a, I deote a sequece of atural umbers which satisfies
More informationCSE 1400 Applied Discrete Mathematics Number Theory and Proofs
CSE 1400 Applied Discrete Mathematics Number Theory ad Proofs Departmet of Computer Scieces College of Egieerig Florida Tech Sprig 01 Problems for Number Theory Backgroud Number theory is the brach of
More informationUnit 4: Polynomial and Rational Functions
48 Uit 4: Polyomial ad Ratioal Fuctios Polyomial Fuctios A polyomial fuctio y px ( ) is a fuctio of the form p( x) ax + a x + a x +... + ax + ax+ a 1 1 1 0 where a, a 1,..., a, a1, a0are real costats ad
More informationEnumerative & Asymptotic Combinatorics
C50 Eumerative & Asymptotic Combiatorics Notes 4 Sprig 2003 Much of the eumerative combiatorics of sets ad fuctios ca be geeralised i a maer which, at first sight, seems a bit umotivated I this chapter,
More information#A51 INTEGERS 14 (2014) MULTI-POLY-BERNOULLI-STAR NUMBERS AND FINITE MULTIPLE ZETA-STAR VALUES
#A5 INTEGERS 4 (24) MULTI-POLY-BERNOULLI-STAR NUMBERS AND FINITE MULTIPLE ZETA-STAR VALUES Kohtaro Imatomi Graduate School of Mathematics, Kyushu Uiversity, Nishi-ku, Fukuoka, Japa k-imatomi@math.kyushu-u.ac.p
More information11. FINITE FIELDS. Example 1: The following tables define addition and multiplication for a field of order 4.
11. FINITE FIELDS 11.1. A Field With 4 Elemets Probably the oly fiite fields which you ll kow about at this stage are the fields of itegers modulo a prime p, deoted by Z p. But there are others. Now although
More informationCHAPTER 10 INFINITE SEQUENCES AND SERIES
CHAPTER 10 INFINITE SEQUENCES AND SERIES 10.1 Sequeces 10.2 Ifiite Series 10.3 The Itegral Tests 10.4 Compariso Tests 10.5 The Ratio ad Root Tests 10.6 Alteratig Series: Absolute ad Coditioal Covergece
More informationIn algebra one spends much time finding common denominators and thus simplifying rational expressions. For example:
74 The Method of Partial Fractios I algebra oe speds much time fidig commo deomiators ad thus simplifyig ratioal epressios For eample: + + + 6 5 + = + = = + + + + + ( )( ) 5 It may the seem odd to be watig
More informationSeries: Infinite Sums
Series: Ifiite Sums Series are a way to mae sese of certai types of ifiitely log sums. We will eed to be able to do this if we are to attai our goal of approximatig trascedetal fuctios by usig ifiite degree
More informationSquare-Congruence Modulo n
Square-Cogruece Modulo Abstract This paper is a ivestigatio of a equivalece relatio o the itegers that was itroduced as a exercise i our Discrete Math class. Part I - Itro Defiitio Two itegers are Square-Cogruet
More informationRoger Apéry's proof that zeta(3) is irrational
Cliff Bott cliffbott@hotmail.com 11 October 2011 Roger Apéry's proof that zeta(3) is irratioal Roger Apéry developed a method for searchig for cotiued fractio represetatios of umbers that have a form such
More informationChapter 2. Periodic points of toral. automorphisms. 2.1 General introduction
Chapter 2 Periodic poits of toral automorphisms 2.1 Geeral itroductio The automorphisms of the two-dimesioal torus are rich mathematical objects possessig iterestig geometric, algebraic, topological ad
More informationPolynomials with Rational Roots that Differ by a Non-zero Constant. Generalities
Polyomials with Ratioal Roots that Differ by a No-zero Costat Philip Gibbs The problem of fidig two polyomials P(x) ad Q(x) of a give degree i a sigle variable x that have all ratioal roots ad differ by
More informationThe Growth of Functions. Theoretical Supplement
The Growth of Fuctios Theoretical Supplemet The Triagle Iequality The triagle iequality is a algebraic tool that is ofte useful i maipulatig absolute values of fuctios. The triagle iequality says that
More informationBeurling Integers: Part 2
Beurlig Itegers: Part 2 Isomorphisms Devi Platt July 11, 2015 1 Prime Factorizatio Sequeces I the last article we itroduced the Beurlig geeralized itegers, which ca be represeted as a sequece of real umbers
More informationSequences A sequence of numbers is a function whose domain is the positive integers. We can see that the sequence
Sequeces A sequece of umbers is a fuctio whose domai is the positive itegers. We ca see that the sequece 1, 1, 2, 2, 3, 3,... is a fuctio from the positive itegers whe we write the first sequece elemet
More informationLINEAR RECURSION RELATIONS - LESSON FOUR SECOND-ORDER LINEAR RECURSION RELATIONS
LINEAR RECURSION RELATIONS - LESSON FOUR SECOND-ORDER LINEAR RECURSION RELATIONS BROTHER ALFRED BROUSSEAU St. Mary's College, Califoria Give a secod-order liear recursio relatio (.1) T. 1 = a T + b T 1,
More informationChapter 3. Strong convergence. 3.1 Definition of almost sure convergence
Chapter 3 Strog covergece As poited out i the Chapter 2, there are multiple ways to defie the otio of covergece of a sequece of radom variables. That chapter defied covergece i probability, covergece i
More informationM A T H F A L L CORRECTION. Algebra I 1 4 / 1 0 / U N I V E R S I T Y O F T O R O N T O
M A T H 2 4 0 F A L L 2 0 1 4 HOMEWORK ASSIGNMENT #4 CORRECTION Algebra I 1 4 / 1 0 / 2 0 1 4 U N I V E R S I T Y O F T O R O N T O P r o f e s s o r : D r o r B a r - N a t a Correctio Homework Assigmet
More informationDefinition 4.2. (a) A sequence {x n } in a Banach space X is a basis for X if. unique scalars a n (x) such that x = n. a n (x) x n. (4.
4. BASES I BAACH SPACES 39 4. BASES I BAACH SPACES Sice a Baach space X is a vector space, it must possess a Hamel, or vector space, basis, i.e., a subset {x γ } γ Γ whose fiite liear spa is all of X ad
More informationMath 312 Lecture Notes One Dimensional Maps
Math 312 Lecture Notes Oe Dimesioal Maps Warre Weckesser Departmet of Mathematics Colgate Uiversity 21-23 February 25 A Example We begi with the simplest model of populatio growth. Suppose, for example,
More informationStochastic Matrices in a Finite Field
Stochastic Matrices i a Fiite Field Abstract: I this project we will explore the properties of stochastic matrices i both the real ad the fiite fields. We first explore what properties 2 2 stochastic matrices
More informationPAPER : IIT-JAM 2010
MATHEMATICS-MA (CODE A) Q.-Q.5: Oly oe optio is correct for each questio. Each questio carries (+6) marks for correct aswer ad ( ) marks for icorrect aswer.. Which of the followig coditios does NOT esure
More informationConvergence of random variables. (telegram style notes) P.J.C. Spreij
Covergece of radom variables (telegram style otes).j.c. Spreij this versio: September 6, 2005 Itroductio As we kow, radom variables are by defiitio measurable fuctios o some uderlyig measurable space
More informationA 2nTH ORDER LINEAR DIFFERENCE EQUATION
A 2TH ORDER LINEAR DIFFERENCE EQUATION Doug Aderso Departmet of Mathematics ad Computer Sciece, Cocordia College Moorhead, MN 56562, USA ABSTRACT: We give a formulatio of geeralized zeros ad (, )-discojugacy
More informationA sequence of numbers is a function whose domain is the positive integers. We can see that the sequence
Sequeces A sequece of umbers is a fuctio whose domai is the positive itegers. We ca see that the sequece,, 2, 2, 3, 3,... is a fuctio from the positive itegers whe we write the first sequece elemet as
More informationSeunghee Ye Ma 8: Week 5 Oct 28
Week 5 Summary I Sectio, we go over the Mea Value Theorem ad its applicatios. I Sectio 2, we will recap what we have covered so far this term. Topics Page Mea Value Theorem. Applicatios of the Mea Value
More informationTEACHER CERTIFICATION STUDY GUIDE
COMPETENCY 1. ALGEBRA SKILL 1.1 1.1a. ALGEBRAIC STRUCTURES Kow why the real ad complex umbers are each a field, ad that particular rigs are ot fields (e.g., itegers, polyomial rigs, matrix rigs) Algebra
More information(A sequence also can be thought of as the list of function values attained for a function f :ℵ X, where f (n) = x n for n 1.) x 1 x N +k x N +4 x 3
MATH 337 Sequeces Dr. Neal, WKU Let X be a metric space with distace fuctio d. We shall defie the geeral cocept of sequece ad limit i a metric space, the apply the results i particular to some special
More information2.4 - Sequences and Series
2.4 - Sequeces ad Series Sequeces A sequece is a ordered list of elemets. Defiitio 1 A sequece is a fuctio from a subset of the set of itegers (usually either the set 80, 1, 2, 3,... < or the set 81, 2,
More informationMathematics review for CSCI 303 Spring Department of Computer Science College of William & Mary Robert Michael Lewis
Mathematics review for CSCI 303 Sprig 019 Departmet of Computer Sciece College of William & Mary Robert Michael Lewis Copyright 018 019 Robert Michael Lewis Versio geerated: 13 : 00 Jauary 17, 019 Cotets
More informationIn number theory we will generally be working with integers, though occasionally fractions and irrationals will come into play.
Number Theory Math 5840 otes. Sectio 1: Axioms. I umber theory we will geerally be workig with itegers, though occasioally fractios ad irratioals will come ito play. Notatio: Z deotes the set of all itegers
More informationEnumerative & Asymptotic Combinatorics
C50 Eumerative & Asymptotic Combiatorics Stirlig ad Lagrage Sprig 2003 This sectio of the otes cotais proofs of Stirlig s formula ad the Lagrage Iversio Formula. Stirlig s formula Theorem 1 (Stirlig s
More informationWeek 5-6: The Binomial Coefficients
Wee 5-6: The Biomial Coefficiets March 6, 2018 1 Pascal Formula Theorem 11 (Pascal s Formula For itegers ad such that 1, ( ( ( 1 1 + 1 The umbers ( 2 ( 1 2 ( 2 are triagle umbers, that is, The petago umbers
More informationChapter 6 Infinite Series
Chapter 6 Ifiite Series I the previous chapter we cosidered itegrals which were improper i the sese that the iterval of itegratio was ubouded. I this chapter we are goig to discuss a topic which is somewhat
More informationSequences and Series of Functions
Chapter 6 Sequeces ad Series of Fuctios 6.1. Covergece of a Sequece of Fuctios Poitwise Covergece. Defiitio 6.1. Let, for each N, fuctio f : A R be defied. If, for each x A, the sequece (f (x)) coverges
More informationProduct measures, Tonelli s and Fubini s theorems For use in MAT3400/4400, autumn 2014 Nadia S. Larsen. Version of 13 October 2014.
Product measures, Toelli s ad Fubii s theorems For use i MAT3400/4400, autum 2014 Nadia S. Larse Versio of 13 October 2014. 1. Costructio of the product measure The purpose of these otes is to preset the
More informationLecture 7: Properties of Random Samples
Lecture 7: Properties of Radom Samples 1 Cotiued From Last Class Theorem 1.1. Let X 1, X,...X be a radom sample from a populatio with mea µ ad variace σ
More informationLinear Differential Equations of Higher Order Basic Theory: Initial-Value Problems d y d y dy
Liear Differetial Equatios of Higher Order Basic Theory: Iitial-Value Problems d y d y dy Solve: a( ) + a ( )... a ( ) a0( ) y g( ) + + + = d d d ( ) Subject to: y( 0) = y0, y ( 0) = y,..., y ( 0) = y
More informationAn analog of the arithmetic triangle obtained by replacing the products by the least common multiples
arxiv:10021383v2 [mathnt] 9 Feb 2010 A aalog of the arithmetic triagle obtaied by replacig the products by the least commo multiples Bair FARHI bairfarhi@gmailcom MSC: 11A05 Keywords: Al-Karaji s triagle;
More informationTest One (Answer Key)
CS395/Ma395 (Sprig 2005) Test Oe Name: Page 1 Test Oe (Aswer Key) CS395/Ma395: Aalysis of Algorithms This is a closed book, closed otes, 70 miute examiatio. It is worth 100 poits. There are twelve (12)
More informationApply change-of-basis formula to rewrite x as a linear combination of eigenvectors v j.
Eigevalue-Eigevector Istructor: Nam Su Wag eigemcd Ay vector i real Euclidea space of dimesio ca be uiquely epressed as a liear combiatio of liearly idepedet vectors (ie, basis) g j, j,,, α g α g α g α
More informationChapter Vectors
Chapter 4. Vectors fter readig this chapter you should be able to:. defie a vector. add ad subtract vectors. fid liear combiatios of vectors ad their relatioship to a set of equatios 4. explai what it
More informationAbstract. 1. Introduction This note is a supplement to part I ([4]). Let. F x (1.1) x n (1.2) Then the moments L x are the Catalan numbers
Abstract Some elemetary observatios o Narayaa polyomials ad related topics II: -Narayaa polyomials Joha Cigler Faultät für Mathemati Uiversität Wie ohacigler@uivieacat We show that Catala umbers cetral
More informationMathematical Induction
Mathematical Iductio Itroductio Mathematical iductio, or just iductio, is a proof techique. Suppose that for every atural umber, P() is a statemet. We wish to show that all statemets P() are true. I a
More informationComplex Analysis Spring 2001 Homework I Solution
Complex Aalysis Sprig 2001 Homework I Solutio 1. Coway, Chapter 1, sectio 3, problem 3. Describe the set of poits satisfyig the equatio z a z + a = 2c, where c > 0 ad a R. To begi, we see from the triagle
More informationMath 778S Spectral Graph Theory Handout #3: Eigenvalues of Adjacency Matrix
Math 778S Spectral Graph Theory Hadout #3: Eigevalues of Adjacecy Matrix The Cartesia product (deoted by G H) of two simple graphs G ad H has the vertex-set V (G) V (H). For ay u, v V (G) ad x, y V (H),
More informationSection Let A =. Then A has characteristic equation λ. 2 4λ + 3 = 0 or (λ 3)(λ 1) = 0. Hence the eigenvalues of A are λ 1 = 3 and λ 2 = 1.
Sectio 63 4 3 Let A The A has characteristic equatio λ 2 4λ + 3 or (λ 3)(λ ) Hece the eigevalues of A are λ 3 ad λ 2 λ 3 The correspodig eigevectors satisfy (A λ I 2 )X, or 3 3 or equivaletly x 3y Hece
More informationBrief Review of Functions of Several Variables
Brief Review of Fuctios of Several Variables Differetiatio Differetiatio Recall, a fuctio f : R R is differetiable at x R if ( ) ( ) lim f x f x 0 exists df ( x) Whe this limit exists we call it or f(
More informationInverse Matrix. A meaning that matrix B is an inverse of matrix A.
Iverse Matrix Two square matrices A ad B of dimesios are called iverses to oe aother if the followig holds, AB BA I (11) The otio is dual but we ofte write 1 B A meaig that matrix B is a iverse of matrix
More informationLinearly Independent Sets, Bases. Review. Remarks. A set of vectors,,, in a vector space is said to be linearly independent if the vector equation
Liearly Idepedet Sets Bases p p c c p Review { v v vp} A set of vectors i a vector space is said to be liearly idepedet if the vector equatio cv + c v + + c has oly the trivial solutio = = { v v vp} The
More information+ au n+1 + bu n = 0.)
Lecture 6 Recurreces - kth order: u +k + a u +k +... a k u k 0 where a... a k are give costats, u 0... u k are startig coditios. (Simple case: u + au + + bu 0.) How to solve explicitly - first, write characteristic
More informationSubject: Differential Equations & Mathematical Modeling-III
Power Series Solutios of Differetial Equatios about Sigular poits Subject: Differetial Equatios & Mathematical Modelig-III Lesso: Power series solutios of differetial equatios about Sigular poits Lesso
More informationSequences of Definite Integrals, Factorials and Double Factorials
47 6 Joural of Iteger Sequeces, Vol. 8 (5), Article 5.4.6 Sequeces of Defiite Itegrals, Factorials ad Double Factorials Thierry Daa-Picard Departmet of Applied Mathematics Jerusalem College of Techology
More informationarxiv: v1 [math.co] 23 Mar 2016
The umber of direct-sum decompositios of a fiite vector space arxiv:603.0769v [math.co] 23 Mar 206 David Ellerma Uiversity of Califoria at Riverside August 3, 208 Abstract The theory of q-aalogs develops
More information