Permutations, the Parity Theorem, and Determinants

Size: px
Start display at page:

Download "Permutations, the Parity Theorem, and Determinants"

Transcription

1 1 Permutatios, the Parity Theorem, ad Determiats Joh A. Guber Departmet of Electrical ad Computer Egieerig Uiversity of Wiscosi Madiso Cotets 1 What is a Permutatio 1 2 Cycles Traspositios 4 3 Orbits 5 4 The Parity Theorem Decompositio of Permutatios ito Cycles with Disjoit Supports 7 5 Determiats 9 Refereces 12 Abstract The Parity Theorem says that wheever a eve (resp. odd) permutatio is expressed as a compositio of traspositios, the umber of traspositios must be eve (resp. odd). The purpose of this article is to give a simple defiitio of whe a permutatio is eve or odd, ad develop just eough backgroud to prove the parity theorem. Several examples are icluded to illustrate the use of the otatio ad cocepts as they are itroduced. We the defie the determiat i terms of the parity of permutatios. We establish basic properties of the determiat. I particular, we show that detba = detb deta, ad we show that A is osigular if ad oly if deta 0. If you fid this writeup useful, or if you fid typos or mistakes, please let me kow at 1. What is a Permutatio A permutatio is a ivertible fuctio that maps a fiite set to itself. 1 If we specify a order for the elemets i the fiite set ad apply a give permutatio to each poit i order, the the fuctio values we geerate simply list all the poits 1 To say that a fuctio is ivertible meas that it is both oe-to-oe ad oto. Oe-to-oe meas that o pair of poits ca map to a commo destiatio poit. Oto meas that every poit is the image of some poit.

2 2 of the set i a ew order. I this way, a permutatio specifies a reorderig of the elemets of a fiite set. Without loss of geerality, it suffices to take as our fiite set {1,...,} for some positive, fiite iteger. A permutatio ϕ o {1,...,} ca be described explicitly with the 2 matrix ( 1 ϕ1 ϕ The top row lists the first itegers i their usual order, ad the bottom row lists them i a ew order. Example 1. O {1,2,3,4,5}, is the permutatio such that ϕ := ). ( ) ϕ1 = 4, ϕ2 = 3, ϕ3 = 5, ϕ4 = 1, ad ϕ5 = 2. Similarly, is the permutatio such that ψ := ( ) ψ1 = 4, ψ2 = 5, ψ3 = 3, ψ4 = 1, ad ψ5 = Cycles A cycle is a especially simple kid of permutatio. Give k distict elemets i {1,...,}, say x 1,...,x k, we write ϕ = (x 1,...,x k ) if ϕ takes x 1 to x 2, x 2 to x 3,..., x k 1 to x k, ad x k to x 1, while leavig all other iputs uchaged. I other words, ad (x 1,...,x i,...,x k )x i = x i+1, where x k+1 := x 1, (1) (x 1,...,x i,...,x k )x = x, if x / {x 1,...,x k }. (2) Such a permutatio is called a k-cycle. The support of a k-cycle ϕ = (x 1,...,x k ) is suppϕ := {x 1,...,x k }. Formula (2) says that all other values of x are fixed poits of the cycle. Remarks. (i) From (1), it is apparet that for x suppϕ, ϕ k x = x. Of course, for x / suppϕ, (2) also implies ϕ k x = x. Hece, for a k-cycle ϕ, we always have that ϕ k

3 3 is the idetity, which we deote by I. I particular, for k = 2, (x 1,x 2 )(x 1,x 2 ) = I, which says that a 2-cycle is its ow iverse. (ii) The cycle otatio is ot uique i the sese that ay circular shift of the sequece x 1,...,x k yields the same permutatio; i.e., (x 1,...,x k ), (x 2,...,x k,x 1 ),..., ad (x k,x 1,...,x k 1 ) all defie the same permutatio. I particular, ote that (x 1,x 2 ) = (x 2,x 1 ). Example 2. O {1,2,3,4,5,6,7,8,9}, cosider the 3-cycle ψ := (1,2,6) ad the 4-cycle ϕ := (3, 5, 7, 6). The followig calculatios illustrate how to compute with cycle otatio: ϕ7 = (3,5,7,6)7 = 6 ϕ6 = (3,5,7,6)6 = 3 ψ6 = (1,2,6)6 = 1 ψϕ6 = (1,2,6)(3,5,7,6)6 = (1,2,6)3 = 3 ϕψ6 = (3,5,7,6)(1,2,6)6 = (3,5,7,6)1 = 1 ϕ4 = (3,5,7,6)4 = 4 ψ4 = (1,2,6)4 = 4 ψϕ4 = (1,2,6)(3,5,7,6)4 = (1,2,6)4 = 4 ϕψ4 = (3,5,7,6)(1,2,6)4 = (3,5,7,6)4 = 4. I particular, otice that ψϕ6 = 3 1 = ϕψ6. So i geeral, cycles do ot commute. Propositio 3. If cycles ψ 1,...,ψ m have pairwise disjoit supports, the ψ i x, x suppψ i, ψ 1 ψ m x = m x x / suppψ i. Furthermore, the ψ i commute ad ca be applied i ay order. Proof. Fix a value of i i the rage from 1 to m. If x suppψ i, the ψ i x also belogs to suppψ i. Therefore, x ad ψ i x do ot belog to the supports of the other cycles; i.e., x ad ψ i x are fixed poits of the other cycles. Hece, we ca write ψ 1 ψ m x = ψ 1 ψ m 1 x, sice x is a fixed poit of ψ m, i=1 = ψ 1 ψ m 2 x, sice x is a fixed poit of ψ m 1, =. = ψ 1 ψ i 1 ψ i x

4 4 = ψ 1 ψ i 2 ψ i x, sice ψ i x is a fixed poit of ψ i 1, = ψ 1 ψ i 3 ψ i x, sice ψ i x is a fixed poit of ψ i 2, =. = ψ 1 ψ i x = ψ i x. We ca similarly argue that ψ m ψ 1 x = ψ i x. I fact, applyig the cycles i ay order to x suppψ i always results i ψ i x. Now suppose x does ot belog to the support of ay ψ i. The x is a fixed poit of every ψ i ad we ca write ψ 1 ψ m x = ψ 1 ψ m 1 x = = ψ 1 x = x. Agai, we ca apply the cycles i ay order; e.g., ψ m ψ 1 x = x. Propositio 3 is importat, because we will see later that every permutatio ca be decomposed ito a compositio of cycles with pairwise disjoit supports Traspositios A traspositio is a 2-cycle such as (x,y), where x y. Thus, (x,y)x = y ad (x,y)y = x, while for all z x,y, we have (x,y)z = z. As metioed i the Remarks above, a traspositio is its ow iverse, ad (x,y) = (y,x). Lemma 4. Let ψ be a k-cycle, ad let τ be a traspositio whose support is a subset of the support of ψ. The ψτ is equal to the compositio of two cycles with disjoit supports. Proof. Suppose ψ = (x 1,...,x i,...,x j,...,x k ) ad τ = (x i,x j ). It is easy to check that ψτ = (x 1,...,x i,x j+1,...,x k )(x i+1,...,x j ), which is the compositio of two cycles with disjoit supports. Lemma 5. Let ψ ad η be cycles with disjoit supports, ad let τ be a traspositio whose support itersects the supports of both ψ ad η. The ψητ is a sigle cycle whose support is suppψ suppη. Proof. Suppose ψ = (x 1,...,x i,...,x k ), η = (y 1,...,y j,...,y m ), ad τ = (x i,y j ). It is easy to check that ψητ = (x 1,...,x i,y j+1,...,y m,y 1,...,y j,x i+1,...,x k ), which is a sigle cycle whose support is suppψ suppη.

5 5 3. Orbits Let ϕ be a permutatio o {1,...,}. Give x {1,...,}, cosider the sequece x,ϕx,ϕ 2 x,...,ϕ x. These + 1 values all belog to {1,...,}. So there must be at least two values that are the same, say ϕ k x = ϕ m x for some 0 k < m. Now apply ϕ 1 to both sides k times to get x = ϕ m k x. Hece, for ay x, there is a smallest positive iteger l (depedig o x) for which ϕ l x = x. The orbit of x (uder ϕ) is the set O x := {x,ϕx,...,ϕ l 1 x}. If l = 1, the orbit is just the sigleto set {x}. A sigleto orbit is a fixed poit. Example 6. Cosider the permutatio ϕ of Example 1. We see that O 1 = {1,4} ad O 2 = {2,3,5}. However, O 3 = O 2, O 4 = O 1, ad O 5 = O 2. The orbits of the permutatio ψ of Example 1 are O 1 = {1,4}, O 2 = {2,5}, ad O 3 = {3}, while O 4 = O 1 ad O 5 = O 2. For each x {1,...,} we ca determie its orbit O x, ad sice each x belogs to its ow orbit; i.e., x O x, we ca write {1,...,} = O x. x=1 Cosider two orbits O y ad O z for y z. We show below that if they are ot disjoit, the they are the same. If O y = O z, the the above uio ca be simplified to {1,...,} = O x. x=1 x z Proceedig i this way, after a fiite umber of steps, we obtai a sequece of distict poits y 1,...,y with {1,...,} = O yi, (3) where ad the orbits O y1,...,o y are pairwise disjoit. If is eve, we say that the permutatio ϕ is eve, ad we write sgϕ = 1. If is odd, we say that the permutatio ϕ is odd, ad we write sgϕ = 1. The quatity sgϕ is called the sig, sigature, or parity of the permutatio ϕ. Example 7. Cosider the idetity permutatio, which we deote by I. For each x, I x = x, ad so the orbit of x uder iperm is {x}. Hece, the umber of disjoit orbits of I is =. Sice = 0 is eve, the idetity is a eve permutatio, ad sg I = 1. i=1

6 6 Example 8. Let us determie the disjoit orbits of a k-cycle ϕ = (x 1,...,x k ). If we start with x 1 ad apply ϕ over ad over usig (1), we fid that O x1 = {x 1,...,x k } = suppϕ. If fact, startig with x 2 or x 3,..., or x k, we fid they all have the same orbit, suppϕ. O the other had if we start with a x / suppϕ, we have by (2) that ϕx = x. Hece, the orbit of such a x is the sigleto set {x}. We have thus show that for a k-cycle, the umber of disjoit orbits is = 1 + ( k). Sice this formula is equivalet to = k 1, the sig of a k-cycle is 1 if k is odd ad 1 if k is eve. We ow show that if two orbits are ot disjoit, they are the same. Suppose O y O z, ad let x deote a poit i O y O z. Sice x O y, we must have x = ϕ r y for some oegative iteger r. Sice x O z, we must have x = ϕ s z for some oegative iteger s. Hece, ϕ r y = ϕ s z, which implies y = ϕ s r z. This further implies ϕ m y = ϕ m+s r z O z for all m; hece, O y O z. Similarly, writig z = ϕ r s y implies O z O y. 4. The Parity Theorem It is easy to write a k-cycle as a compositio of traspositios. Cosider the formula (x 1,...,x k ) = (x 1,x k )(x 1,x k 1 ) (x 1,x 3 )(x 1,x 2 ). (4) Notice that each of x 2,...,x k appears i oly oe factor, while x 1 appears i every factor. If we apply the right-had side to x 1, we get (x 1,x k )(x 1,x k 1 ) (x 1,x 3 )(x 1,x 2 )x 1 = (x 1,x k )(x 1,x k 1 ) (x 1,x 3 )x 2 = x 2, sice x 2 is ot i the supports of ay of the remaiig traspositios. If we start with x 2, we get (x 1,x k )(x 1,x k 1 ) (x 1,x 4 )(x 1,x 3 )(x 1,x 2 )x 2 = (x 1,x k )(x 1,x k 1 ) (x 1,x 4 )(x 1,x 3 )x 1 = (x 1,x k )(x 1,x k 1 ) (x 1,x 4 )x 3 = x 3. Cotiuig i this way, we see that (4) holds. Notice that i (4), there are k 1 traspositios. We saw earlier that a k-cycle ϕ has = 1 + ( k) orbits so that k 1 = determies the sig of ϕ. Hece, it is possible to write a k-cycle ϕ as a compositio of traspositios such that the umber of traspositios is eve if sgϕ = 1, ad the umber of traspositios is odd if sgϕ = 1. However, there are may ways to write a k-cycle as compositios of differet umbers of traspositios.

7 7 Example 9. O {1,2,3,4,5}, we ca use (4) to write the 3-cycle (1,2,3) as (1,2,3) = (1,3)(1,2). Sice k = 3 is odd, k 1 = 2 is eve. Hece, it is o surprise that we ca write a 3-cycle as the compositio of 2 (a eve umber) traspositios. However, sice (4, 5)(4, 5) = I, we ca also write (1, 2, 3) = (1, 3)(1, 2)(4, 5)(4, 5), which is aother way to write this 3 cycle as a eve umber of traspositios Decompositio of Permutatios ito Cycles with Disjoit Supports For a arbitrary permutatio ϕ, oce we have idetified its disjoit orbits we ca associate each orbit with a cycle i the followig way. The disjoit orbit decompositio (3) suggests that we put { ϕx, x Oyi, ψ i x := x, otherwise. (5) Note that the ψ i are cycles ad have disjoit supports. We ca further write ϕ = ψ 1 ψ, (6) which expresses ϕ as the compositio of cycles with disjoit supports. The fact that (6) holds follows from Propositio 3 ad the defiitio (5). Parity Theorem. Wheever a eve (resp. odd) permutatio is expressed as a compositio of traspositios, the umber of traspositios must be eve (resp. odd). Proof. Cosider a permutatio ϕ with disjoit orbits ad correspodig represetatio as cycles with disjoit supports as i (6). Suppose also that ϕ = τ 1 τ m, where each τ i is a traspositio. Recallig that a traspositio is its ow iverse, write I = ϕϕ 1 = (ψ 1 ψ )(τ 1 τ m ) 1 = (ψ 1 ψ )(τ m τ 1 ) = ψ 1 ψ τ m τ 1. Cosider the expressio ψ 1 ψ τ m. Sice the supports of the ψ i partitio {1,...,}, the two poits i the support of τ m must belog to the supports of the ψ i. If τ m = (u,v), there are two cases to cosider. First, there is the case that u ad v both belog to the support of a sigle ψ i. Secod, u belogs to the support of some ψ i, while v belogs to the support of some other ψ j with j > i. 2 I the first case, we use Propositio 3 ad Lemma 4 to write ψ 1 ψ τ m = ψ 1 ψ i 1 ψ i+1 ψ (ψ i τ m ), 2 There is o loss of geerality i assumig j > i because (u,v) is equal to (v,u).

8 8 where ψ i τ m is equal to the compositio of two cycles with disjoit supports created from suppψ i. Hece, the above expressio is a permutatio with + 1 pairwise disjoit orbits. I the secod case, we use Propositio 3 ad Lemma 5 to write ψ 1 ψ τ m = ψ 1 ψ i 1 ψ i+1 ψ j ψ j+1 ψ (ψ i ψ j τ m ), where ψ i ψ j τ m is equal to a sigle cycle whose support is the uio of the supports of ψ i ad ψ j. Hece, the above expressio is a permutatio with 1 pairwise disjoit orbits. Sice we do ot kow which of the two cases τ m falls ito, let us deote the ew umber of disjoit orbits by + σ m, where σ m = ±1. Now that we have determied the umber of disjoit orbits of ψ 1 ψ τ m, we ca determie the umber of disjoit orbits of ψ 1 ψ τ m τ m 1 as + σ m + σ m 1, ad so o. The umber of disjoit orbits of I = ψ 1 ψ τ m τ 1 ca be writte as + m k=1 where each σ k = ±1. The sig of I = ψ 1 ψ τ m τ 1 is determied by whether ( m ) + σ k = ( m ) k=1 σ k, σ k k=1 is eve or odd. However, we kow from Example 7 that the idetity is eve. This meas that ( ) mius the above sum has to be eve. Therefore, if ( ) is eve, the above sum must be eve, while if ( ) is odd, the above sum must be odd. Now observe that if m is eve, the possible values for the above sum are m,m 2,...,4,2,0, 2, 4,..., m, which are all eve, while if m is odd the possible values are m,m 2,...,3,1, 1, 3,..., m, which are all odd. Hece, if ( ) is eve, i.e., if the origial permutatio ϕ is eve, the m must be eve, while if ϕ is odd, the m must be odd. Corollary 10. If ϕ ad ψ are permutatios, the sg(ϕψ) = sg(ϕ) sg(ψ), ad is therefore equal to sg(ψϕ). I particular, if ψ is itself a traspositio (so that sg(ψ) = 1), sg(ϕψ) = sg(ϕ). Proof. We oly prove sg(ϕψ) = sg(ϕ)sg(ψ) sice the other parts of the corollary follow immediately from this. Suppose ϕ = τ 1 τ m ad ψ = θ 1 θ k, where the τ i ad θ j are traspositios. By the Parity Theorem, sg(ϕψ) = ± accordig to whether m + k is eve or odd. Similarly for sg(ϕ) ad m ad sg(ψ) ad k. It is easy to verify sg(ϕψ) = sg(ϕ)sg(ψ) for each of the four possibilities of m ad k beig eve/odd.

9 9 5. Determiats If A is a matrix with colums a(1),...,a(), the the ith row of the colum vector a( j), deoted by a i ( j), is the i, j etry of A. The determiat of A is deta := sg(ϕ)a 1 (ϕ1) a (ϕ), (7) ϕ where the sum is over all possible! permutatios ϕ of the itegers {1,...,}. Propositio 11. The determiat of a triagular matrix is the product of its diagoal etries. Proof. To begi, recall that A is upper (resp. lower) triagular if the elemets below (resp. above) the mai diagoal are zero. Without loss of geerality, assume A is upper triagular so that a i ( j) = 0 for i > j. The result will follow if we ca show that all terms i (7) with ϕ I have zero as a factor. If ϕ I, the for some i, we must have i > ϕi. 3 ad for such i, sice A is upper triagular, a i (ϕi) = 0. Let I deote the idetity matrix, whose i, j etry is 1 if i = j ad 0 for i j. Our first observatio is that the determiat of the idetity matrix is oe. To see this, cosider a typical term i (7). If ϕ I, the for some i, ϕi i, ad so the factor a i (ϕi) = 0 whe A is the idetity matrix. The oly term i (7) that is ot zero is the term with ϕ = I. That term is equal to oe. Fix a particular colum idex u, ad cosider a typical term i (7). This term cotais the factor a i (u) for some i, 4 ad o other factor i that term ivolves a etry from the colum a(u). Hece, whe all the colums of A are fixed except for colum u, deta is liear i colum u. Let u ad v be two distict itegers from {1,...,}, ad let τ := (u,v) be the traspositio that iterchages u ad v. Let B deote the matrix with colums b( j) := a(τ j). The a( j), j / {u,v}, b( j) := a(τ j) = a(v), j = u, a(u), j = v. I other words, B is obtaied from A by iterchagig colums u ad v. We claim that detb = deta. To see this, write detb = sg(ϕ)b 1 (ϕ1) b (ϕ) ϕ 3 To see this, cosider the decompositio (6). If ϕ I, some ψ i must be a k-cycle with k 2, say ψ i = (x 1,...,x k ). These x j are all distict, ad oe is the largest, say x l. The ϕx l = ψ i x l < x l. 4 The value of i is ϕ 1 u.

10 10 = sg(ϕ)a 1 (τϕ1) a (τϕ) ϕ = sg(τ 1 ψ)a 1 (ττ 1 ψ) a (ττ 1 ψ) ψ = sg(τ 1 ψ)a 1 (ψ) a (ψ) ψ = sg(τ 1 )sg(ψ)a 1 (ψ) a (ψ) ψ = sg(ψ)a 1 (ψ) a (ψ) ψ = deta, where the third equality follows by substitutig ϕ = τ 1 ψ; the fifth equality follows because the sig of a compositio of permutatios is the product of their sigs by Corollary 10; ad the sixth equality follows because traspositios are odd. Now suppose A has two equal colums, ad B is obtaied by iterchagig those two colums. The by the precedig paragraph, det B = det A. But sice B = A, detb = deta. Therefore, deta = 0. We showed above that if b( j) = a(τ j) for some traspositio τ, the detb = deta. What if b( j) = a(ϕ j) for some arbitrary permutatio ϕ? Writig ϕ i terms of traspositios, say ϕ = τ 1 τ k, we see that detb = ( 1) k deta = sg(ϕ)deta. Theorem 12. detba = detb deta. Proof. It is coveiet to write deta i terms of its colums. We use the otatio (a(1),...,a()) = deta. If B is aother matrix with colums b(1),...,b(), the the colums of BA are Ba(1),...,Ba(), ad detba = (Ba(1),...,Ba()). Now recall that Write a( j) = i=1 ([ detba = B = i=1 i=1 a i ( j)e(i), j = 1,...,. ] ) a i (1)e(i),Ba(2),...,Ba() a i (1) (Be(i),Ba(2),...,Ba()).

11 11 Repeatig this calculatio for a(2),...,a() yields detba = = i 1 =1 i 1 =1 i =1 i =1 a i1 (1) a i () (Be(i 1 ),...,Be(i )) a i1 (1) a i () (b(i 1 ),...,b(i )). Amog the -tuples (i 1,...,i ), if the i k are ot distict, the (b(i 1 ),...,b(i )) is the determiat of a matrix with two or more equal colums ad is therefore zero. Otherwise, (i 1,...,i ) = (ϕ1,...,ϕ) for some permutatio ϕ. Hece, detba = a ϕ1 (1) a ϕ () (b(ϕ1),...,b(ϕ)) ϕ = a ϕ1 (1) a ϕ ()sg(ϕ)detb ϕ = detbsg(ϕ)a 1 (ϕ 1 1) a (ϕ 1 ) ϕ = detbsg(ψ 1 )a 1 (ψ1) a (ψ) ψ = detbsg(ψ)a 1 (ψ1) a (ψ) ψ = detb deta. Corollary 13. deta = 0 if ad oly if A is osigular. Proof. If A is osigular, the 1 = deti = det(a 1 A) = (deta 1 )(deta) implies deta 0. Now suppose A is sigular. The the colums of A are liearly depedet. Without loss of geerality, suppose a() + 1 j=1 c ja( j) = 0 for some coefficiets c j. Hece, 0 = ( a(1),...,a( 1),0 ) ( 1 ) = a(1),...,a( 1),a() + c j a( j) j=1 = ( a(1),...,a( 1),a() ) 1 + = deta + 0, j=1 c j ( a(1),...,a( 1),a( j) ) sice i the sum over j, the jth term ivolves the determiat of a matrix whose colum j ad colum are the same. Such a determiat is zero.

12 12 Refereces [1] T. L. Barlow, A historical ote o the parity of permutatios, The America Mathematical Mothly, vol. 79, o. 7, pp , [2] W. Phillips, O the defiitio of eve ad odd permutatios, The America Mathematical Mothly, vol. 74, o. 10, pp , [3] W. Rudi, Priciples of Mathematical Aalysis, 3rd ed. New York: McGraw-Hill, 1976.

Linear Algebra II. 4 Determinants. Notes 4 1st November Definition of determinant

Linear Algebra II. 4 Determinants. Notes 4 1st November Definition of determinant MTH6140 Liear Algebra II Notes 4 1st November 2010 4 Determiats The determiat is a fuctio defied o square matrices; its value is a scalar. It has some very importat properties: perhaps most importat is

More information

x(x 1)(x 2)... (x k + 1) = [x] k n+m 1

x(x 1)(x 2)... (x k + 1) = [x] k n+m 1 1 Coutig mappigs For every real x ad positive iteger k, let [x] k deote the fallig factorial ad x(x 1)(x 2)... (x k + 1) ( ) x = [x] k k k!, ( ) k = 1. 0 I the sequel, X = {x 1,..., x m }, Y = {y 1,...,

More information

{{1}, {2, 4}, {3}} {{1, 3, 4}, {2}} {{1}, {2}, {3, 4}} 5.4 Stirling Numbers

{{1}, {2, 4}, {3}} {{1, 3, 4}, {2}} {{1}, {2}, {3, 4}} 5.4 Stirling Numbers . Stirlig Numbers Whe coutig various types of fuctios from., we quicly discovered that eumeratig the umber of oto fuctios was a difficult problem. For a domai of five elemets ad a rage of four elemets,

More information

Linear Algebra II. Notes 6 25th November 2010

Linear Algebra II. Notes 6 25th November 2010 MTH6140 Liear Algebra II Notes 6 25th November 2010 6 Quadratic forms A lot of applicatios of mathematics ivolve dealig with quadratic forms: you meet them i statistics (aalysis of variace) ad mechaics

More information

Example: Consider the sequence {a i = i} i=1. Starting with i = 1, since a i = i,

Example: Consider the sequence {a i = i} i=1. Starting with i = 1, since a i = i, Sequeces: Defiitio: A sequece is a fuctio whose domai is the set of atural umbers or a subset of the atural umbers. We usually use the symbol a to represet a sequece, where is a atural umber ad a is the

More information

1. MATHEMATICAL INDUCTION

1. MATHEMATICAL INDUCTION 1. MATHEMATICAL INDUCTION EXAMPLE 1: Prove that for ay iteger 1. Proof: 1 + 2 + 3 +... + ( + 1 2 (1.1 STEP 1: For 1 (1.1 is true, sice 1 1(1 + 1. 2 STEP 2: Suppose (1.1 is true for some k 1, that is 1

More information

n Find all pairs of integers x, y which satisfy the diophantine equation 50x 65y = 75. a i. G n = a i a 1 a 2 a k

n Find all pairs of integers x, y which satisfy the diophantine equation 50x 65y = 75. a i. G n = a i a 1 a 2 a k Math 00. Treibergs σιι Fial Exam Name: Sample March 7, 0 Sample Fial Questios.. Show usig iductio that 5 (7 ) for every positive iteger.. Prove that! > for all itegers 4. [From miterm for Math 30-, Sept.

More information

The Binomial Theorem

The Binomial Theorem The Biomial Theorem Itroductio You should be familiar with the followig formula: x + y 2 = x 2 + 2xy + y 2 The biomial theorem explais how to get a correspodig expasio whe the expoet is a arbitrary atural

More information

Chapter Gaussian Elimination

Chapter Gaussian Elimination Chapter 04.06 Gaussia Elimiatio After readig this chapter, you should be able to:. solve a set of simultaeous liear equatios usig Naïve Gauss elimiatio,. lear the pitfalls of the Naïve Gauss elimiatio

More information

When the sum equals the product

When the sum equals the product Whe the sum equals the product E-mail: Leo Kurladchik ad Adrzej Nowicki Departmet of Mathematics ad Computer Sciece, Nicholaus Copericus Uiversity, 87-100 Toruń, Polad (lekur @ mat.ui.toru.pl), (aow @

More information

Math Discrete Math Combinatorics MULTIPLICATION PRINCIPLE:

Math Discrete Math Combinatorics MULTIPLICATION PRINCIPLE: Math 355 - Discrete Math 4.1-4.4 Combiatorics Notes MULTIPLICATION PRINCIPLE: If there m ways to do somethig ad ways to do aother thig the there are m ways to do both. I the laguage of set theory: Let

More information

MT5821 Advanced Combinatorics

MT5821 Advanced Combinatorics MT581 Advaced Combiatorics 6 Gaussia coefficiets The -aaolgue of a combiatorial formula is, loosely speaig, a formula ivolvig a parameter, which teds to the origial formula as 1 However, this is much too

More information

2.7 Sequences, Sequences of Sets

2.7 Sequences, Sequences of Sets 2.7. SEQUENCES, SEQUENCES OF SETS 67 2.7 Sequeces, Sequeces of Sets 2.7.1 Sequeces Defiitio 190 (sequece Let S be some set. 1. A sequece i S is a fuctio f : K S where K = { N : 0 for some 0 N}. 2. For

More information

1.3 Binomial Coefficients

1.3 Binomial Coefficients 18 CHAPTER 1. COUNTING 1. Biomial Coefficiets I this sectio, we will explore various properties of biomial coefficiets. Pascal s Triagle Table 1 cotais the values of the biomial coefficiets ( ) for 0to

More information

Department of Computer Science, University of Otago

Department of Computer Science, University of Otago Departmet of Computer Sciece, Uiversity of Otago Techical Report OUCS-2006-09 Permutatios Cotaiig May Patters Authors: M.H. Albert Departmet of Computer Sciece, Uiversity of Otago Micah Colema, Rya Fly

More information

In nite Sequences. Dr. Philippe B. Laval Kennesaw State University. October 9, 2008

In nite Sequences. Dr. Philippe B. Laval Kennesaw State University. October 9, 2008 I ite Sequeces Dr. Philippe B. Laval Keesaw State Uiversity October 9, 2008 Abstract This had out is a itroductio to i ite sequeces. mai de itios ad presets some elemetary results. It gives the I ite Sequeces

More information

A curious result related to Kempner s series

A curious result related to Kempner s series Amer. Math. Mothly, 5 (28), p. 933-938. A curious result related to Kemper s series Bakir FARHI bakir.farhi@gmail.com Abstract It is well kow sice A. J. Kemper s work that the series of the reciprocals

More information

ARITHMETIC AND GEOMETRIC PROGRESSIONS

ARITHMETIC AND GEOMETRIC PROGRESSIONS Arithmetic Ad Geometric Progressios Sequeces Ad ARITHMETIC AND GEOMETRIC PROGRESSIONS Successio of umbers of which oe umber is desigated as the first, other as the secod, aother as the third ad so o gives

More information

1 The Binomial Theorem: Another Approach

1 The Binomial Theorem: Another Approach The Biomial Theorem: Aother Approach Pascal s Triagle I class (ad i our text we saw that, for iteger, the biomial theorem ca be stated (a + b = c a + c a b + c a b + + c ab + c b, where the coefficiets

More information

BINOMIAL THEOREM INTRODUCTION. Development of Binomial Theorem

BINOMIAL THEOREM INTRODUCTION. Development of Binomial Theorem 8 BINOMIAL THEOREM INTRODUCTION I previous classes, you have leart the squares ad cubes of biomial epressios like a + b, a b ad used these to fid the values of umbers like (10), (998) by epressig these

More information

When π(n) does not divide n

When π(n) does not divide n Whe π() does ot divide Germá Adrés Paz Jauary 26, 2015 Abstract Let π() deote the prime-coutig fuctio ad let / log 1 log 1 f() = log log 0.1. I this paper we prove that if is a iteger 60184 ad f() = 0,

More information

Solutions for problems in the 9 th International Mathematics Competition for University Students

Solutions for problems in the 9 th International Mathematics Competition for University Students Solutios for problems i the 9 th Iteratioal Mathematics Competitio for Uiversity Studets Warsaw, July 9 - July 25, 2002 First Day Problem. A stadard parabola is the graph of a quadratic polyomial y = x

More information

ΣΤΟΙΧΕΙΑ ΓΡΑΜΜΙΚΗΣ ΑΛΓΕΒΡΑΣ

ΣΤΟΙΧΕΙΑ ΓΡΑΜΜΙΚΗΣ ΑΛΓΕΒΡΑΣ ΣΤΟΙΧΕΙΑ ΓΡΑΜΜΙΚΗΣ ΑΛΓΕΒΡΑΣ Οι παρούσες σημειώσεις αποτελούν βοήθημα στο μάθημα Αριθμητικές Μέθοδοι του 5 ου εξαμήνου του ΤΜΜ Δημήτρης Βαλουγεώργης Καθηγητής Εργαστήριο Φυσικών και Χημικών Διεργασιών Τμήμα

More information

The Euler Totient, the Möbius and the Divisor Functions

The Euler Totient, the Möbius and the Divisor Functions The Euler Totiet, the Möbius ad the Divisor Fuctios Rosica Dieva July 29, 2005 Mout Holyoke College South Hadley, MA 01075 1 Ackowledgemets This work was supported by the Mout Holyoke College fellowship

More information

NUMBERS COMMON TO TWO POLYGONAL SEQUENCES

NUMBERS COMMON TO TWO POLYGONAL SEQUENCES NUMBERS COMMON TO TWO POLYGONAL SEQUENCES DIANNE SMITH LUCAS Chia Lake, Califoria a iteger, The polygoal sequece (or sequeces of polygoal umbers) of order r (where r is r > 3) may be defied recursively

More information

Combinatorics Dan Hefetz, Richard Mycroft (lecturer)

Combinatorics Dan Hefetz, Richard Mycroft (lecturer) Combiatorics Da Hefetz, Richard Mycroft (lecturer) These are otes of the lectures give by Richard Mycroft for the course Commuicatio Theory ad Combiatorics (3P16/4P16) at the Uiversity of Birmigham, o

More information

SAMPLE QUESTIONS FOR FINAL EXAM. (1) (2) (3) (4) Find the following using the definition of the Riemann integral: (2x + 1)dx

SAMPLE QUESTIONS FOR FINAL EXAM. (1) (2) (3) (4) Find the following using the definition of the Riemann integral: (2x + 1)dx SAMPLE QUESTIONS FOR FINAL EXAM REAL ANALYSIS I FALL 006 3 4 Fid the followig usig the defiitio of the Riema itegral: a 0 x + dx 3 Cosider the partitio P x 0 3, x 3 +, x 3 +,......, x 3 3 + 3 of the iterval

More information

Winter Camp 2012 Sequences Alexander Remorov. Sequences. Alexander Remorov

Winter Camp 2012 Sequences Alexander Remorov. Sequences. Alexander Remorov Witer Camp 202 Sequeces Alexader Remorov Sequeces Alexader Remorov alexaderrem@gmail.com Warm-up Problem : Give a positive iteger, cosider a sequece of real umbers a 0, a,..., a defied as a 0 = 2 ad =

More information

Randomized Algorithms I, Spring 2016, Department of Computer Science, University of Helsinki Homework 1: Solutions (Discussed January 29, 2016)

Randomized Algorithms I, Spring 2016, Department of Computer Science, University of Helsinki Homework 1: Solutions (Discussed January 29, 2016) Radomized Algorithms I, Sprig 0, Departmet of Computer Sciece, Uiversity of Helsiki Homework : Solutios Discussed Jauary 9, 0). Exercise.: Cosider the followig balls-ad-bi game. We start with oe black

More information

natural number contains 1 and also contains the successor of any number that it contains then the set is all natural numbers.

natural number contains 1 and also contains the successor of any number that it contains then the set is all natural numbers. 2. Proof by Iductio Purpose of Sectio: To itroduce the Priciple of Mathematical Iductio, both the weak ad the strog versio, ad show how certai types of theorems ca easily be prove usig this techique. Itroductio

More information

Review for College Algebra Final Exam

Review for College Algebra Final Exam Review for College Algebra Fial Exam (Please remember that half of the fial exam will cover chapters 1-4. This review sheet covers oly the ew material, from chapters 5 ad 7.) 5.1 Systems of equatios i

More information

SECTION 8-4 Binomial Formula

SECTION 8-4 Binomial Formula 8- Biomial Formula 581 poit of view it appears that he will ever fiish the race. This famous paradox is attributed to the Gree philosopher Zeo, 95 35 B.C. If we assume the ruer rus at 0 yards per miute,

More information

Binet Formulas for Recursive Integer Sequences

Binet Formulas for Recursive Integer Sequences Biet Formulas for Recursive Iteger Sequeces Homer W. Austi Jatha W. Austi Abstract May iteger sequeces are recursive sequeces ad ca be defied either recursively or explicitly by use of Biet-type formulas.

More information

Homework 1 Solutions

Homework 1 Solutions Homewor 1 Solutios Math 171, Sprig 2010 Please sed correctios to herya@math.staford.edu 2.2. Let h : X Y, g : Y Z, ad f : Z W. Prove that (f g h = f (g h. Solutio. Let x X. Note that ((f g h(x = (f g(h(x

More information

Module 4: Mathematical Induction

Module 4: Mathematical Induction Module 4: Mathematical Iductio Theme 1: Priciple of Mathematical Iductio Mathematical iductio is used to prove statemets about atural umbers. As studets may remember, we ca write such a statemet as a predicate

More information

14 Dihedral Groups. In this paragraph, we examine the symmetry groups of regular polygons.

14 Dihedral Groups. In this paragraph, we examine the symmetry groups of regular polygons. Dihedral Groups I this paragraph, we examie the symmetry groups of regular polygos. Let F be ay oempty subset of the Euclidea plae E.. Here F might be a set with a sigle poit, a lie, a geometric figure.

More information

17. Vandermonde determinants

17. Vandermonde determinants 17. Vadermode determiats 17.1 Vadermode determiats 17.2 Worked examples 1. Vadermode determiats A rigorous systematic evaluatio of Vadermode determiats below) of the followig idetity uses the fact that

More information

Solutions to Problem Set 0: Math 149S

Solutions to Problem Set 0: Math 149S Solutios to Problem Set 0: Math 49S Matthew Roglie September 8, 009 Some terms or cocepts here may be ufamiliar to you. We will cover them later, but i the meatime you are strogly ecouraged to google them!

More information

Lecture 7: Borel Sets and Lebesgue Measure

Lecture 7: Borel Sets and Lebesgue Measure EE50: Probability Foudatios for Electrical Egieers July-November 205 Lecture 7: Borel Sets ad Lebesgue Measure Lecturer: Dr. Krisha Jagaatha Scribes: Ravi Kolla, Aseem Sharma, Vishakh Hegde I this lecture,

More information

To get the next Fibonacci number, you add the previous two. numbers are defined by the recursive formula. F 1 F n+1

To get the next Fibonacci number, you add the previous two. numbers are defined by the recursive formula. F 1 F n+1 Liear Algebra Notes Chapter 6 FIBONACCI NUMBERS The Fiboacci umbers are F, F, F 2, F 3 2, F 4 3, F, F 6 8, To get the ext Fiboacci umber, you add the previous two umbers are defied by the recursive formula

More information

A SHORT SUMMARY OF SEQUENCES AND SERIES. by John Alexopoulos

A SHORT SUMMARY OF SEQUENCES AND SERIES. by John Alexopoulos A SHORT SUMMARY OF SEQUENCES AND SERIES by Joh Alexopoulos Last updated o October 2 st, 2005 Cotets Sequeces 3. Defiitios, otatio ad examples...................................... 3.2 More defiitios ad

More information

FIBONACCI NUMBERS: AN APPLICATION OF LINEAR ALGEBRA. 1. Powers of a matrix

FIBONACCI NUMBERS: AN APPLICATION OF LINEAR ALGEBRA. 1. Powers of a matrix FIBONACCI NUMBERS: AN APPLICATION OF LINEAR ALGEBRA. Powers of a matrix We begi with a propositio which illustrates the usefuless of the diagoalizatio. Recall that a square matrix A is diogaalizable if

More information

] 3 ] 3 0. Exercises with Matrices. Part One Practice with Numbers (if there is no answer, say so) Solve for x and y:

] 3 ] 3 0. Exercises with Matrices. Part One Practice with Numbers (if there is no answer, say so) Solve for x and y: Keeth L. Simos, 005 Eercises with Matrices Part Oe Practice with Numbers (if there is o aswer, say so). 0 0 3 4+ 30 40 5 6 50 60. [ ] 3 4 3. [ ] 3 0 4 4. 3 0 0 0 4 5. [ 7 ] 3 4 6. 3[ 4 7 ] 7. 3 0 4 5 6

More information

Asymptotic Growth of Functions

Asymptotic Growth of Functions CMPS Itroductio to Aalysis of Algorithms Fall 3 Asymptotic Growth of Fuctios We itroduce several types of asymptotic otatio which are used to compare the performace ad efficiecy of algorithms As we ll

More information

LINEAR ALGEBRA Eigenvalues and Eigenvectors. Paul Dawkins

LINEAR ALGEBRA Eigenvalues and Eigenvectors. Paul Dawkins LINEAR ALGEBRA Eigevalues ad Eigevectors Paul Dawkis Table of Cotets Preface... ii Eigevalues ad Eigevectors... 3 Itroductio... 3 Review of Determiats... 4 Eigevalues ad Eigevectors... 3 Diagoalizatio...

More information

The Field of Complex Numbers

The Field of Complex Numbers The Field of Complex Numbers S. F. Ellermeyer The costructio of the system of complex umbers begis by appedig to the system of real umbers a umber which we call i with the property that i = 1. (Note that

More information

CS103X: Discrete Structures Homework 4 Solutions

CS103X: Discrete Structures Homework 4 Solutions CS103X: Discrete Structures Homewor 4 Solutios Due February 22, 2008 Exercise 1 10 poits. Silico Valley questios: a How may possible six-figure salaries i whole dollar amouts are there that cotai at least

More information

Math 475, Problem Set #6: Solutions

Math 475, Problem Set #6: Solutions Math 475, Problem Set #6: Solutios A (a) For each poit (a, b) with a, b o-egative itegers satisfyig ab 8, cout the paths from (0,0) to (a, b) where the legal steps from (i, j) are to (i 2, j), (i, j 2),

More information

The Fundamental Theorem of Algebra and the Minimum Modulus Principle

The Fundamental Theorem of Algebra and the Minimum Modulus Principle FudametalThmAlgAdMiModulusPriciple.tex November 8, 214 1 The Fudametal Theorem of Algebra ad the Miimum Modulus Priciple Joh A. Guber Departmet of Electrical ad Computer Egieerig Uiversity of Wiscosi Madiso

More information

2 2 i. 8.3 POLAR FORM AND DEMOIVRE S THEOREM. Definition of Polar Form of a Complex Number

2 2 i. 8.3 POLAR FORM AND DEMOIVRE S THEOREM. Definition of Polar Form of a Complex Number SECTION 8. POLAR FORM AND DEMOIVRE S THEOREM 445. Describe the set of poits i the complex plae that satisfy the followig. (a) z 4 (b) z i (c) z i (d) z. (a) Evaluate for,,, 4, ad 5. (b) Calculate i 57

More information

The Number of Symmetric Permutation Matrices Or How a Misunderstanding Can Lead to an Interesting Question

The Number of Symmetric Permutation Matrices Or How a Misunderstanding Can Lead to an Interesting Question Symmetric Permutatio Matrices Page he Number of Symmetric Permutatio Matrices Or How a Misuderstadig Ca Lead to a Iterestig Questio Abstract: A rather simple combiatorial argumet is preseted which aswers

More information

Gregory Carey, 1998 Linear Transformations & Composites - 1. Linear Transformations and Linear Composites

Gregory Carey, 1998 Linear Transformations & Composites - 1. Linear Transformations and Linear Composites Gregory Carey, 1998 Liear Trasformatios & Composites - 1 Liear Trasformatios ad Liear Composites I Liear Trasformatios of Variables Meas ad Stadard Deviatios of Liear Trasformatios A liear trasformatio

More information

Russian Math Circle Problems

Russian Math Circle Problems Russia Math Circle Problems April 1, 2011 Istructios: Work as may problems as you ca. Eve if you ca t solve a problem, try to lear as much as you ca about it. Please write a complete solutio to each problem

More information

Chimica Inorganica 3

Chimica Inorganica 3 himica Iorgaica Irreducible Represetatios ad haracter Tables Rather tha usig geometrical operatios, it is ofte much more coveiet to employ a ew set of group elemets which are matrices ad to make the rule

More information

Our aim is to show that under reasonable assumptions a given 2π-periodic function f can be represented as convergent series

Our aim is to show that under reasonable assumptions a given 2π-periodic function f can be represented as convergent series 8 Fourier Series Our aim is to show that uder reasoable assumptios a give -periodic fuctio f ca be represeted as coverget series f(x) = a + (a cos x + b si x). (8.) By defiitio, the covergece of the series

More information

Strong Solutions of the Fuzzy Linear Systems

Strong Solutions of the Fuzzy Linear Systems Strog Solutios of the Fuzzy Liear Systems Şahi Emrah Amrahov 1 ad Ima N. Askerzade 1 Abstract We cosider a fuzzy liear system with crisp coefficiet matrix ad with a arbitrary fuzzy umber i parametric form

More information

4.1 Sigma Notation and Riemann Sums

4.1 Sigma Notation and Riemann Sums 0 the itegral. Sigma Notatio ad Riema Sums Oe strategy for calculatig the area of a regio is to cut the regio ito simple shapes, calculate the area of each simple shape, ad the add these smaller areas

More information

Convexity, Inequalities, and Norms

Convexity, Inequalities, and Norms Covexity, Iequalities, ad Norms Covex Fuctios You are probably familiar with the otio of cocavity of fuctios. Give a twicedifferetiable fuctio ϕ: R R, We say that ϕ is covex (or cocave up) if ϕ (x) 0 for

More information

HW 1 Solutions Math 115, Winter 2009, Prof. Yitzhak Katznelson

HW 1 Solutions Math 115, Winter 2009, Prof. Yitzhak Katznelson HW Solutios Math 5, Witer 2009, Prof. Yitzhak Katzelso.: Prove 2 + 2 2 +... + 2 = ( + )(2 + ) for all atural umbers. The proof is by iductio. Call the th propositio P. The basis for iductio P is the statemet

More information

CHAPTER 1. Vector Valued Functions of One-Variable (Time)

CHAPTER 1. Vector Valued Functions of One-Variable (Time) A SERIES OF CLASS NOTES FOR 2005-2006 TO INTRODUCE LINEAR AND NONLINEAR PROBLEMS TO ENGINEERS, SCIENTISTS, AND APPLIED MATHEMATICIANS DE CLASS NOTES 3 A COLLECTION OF HANDOUTS ON SYSTEMS OF ORDINARY DIFFERENTIAL

More information

SUMS OF GENERALIZED HARMONIC SERIES. Michael E. Ho man Department of Mathematics, U. S. Naval Academy, Annapolis, Maryland

SUMS OF GENERALIZED HARMONIC SERIES. Michael E. Ho man Department of Mathematics, U. S. Naval Academy, Annapolis, Maryland #A46 INTEGERS 4 (204) SUMS OF GENERALIZED HARMONIC SERIES Michael E. Ho ma Departmet of Mathematics, U. S. Naval Academy, Aapolis, Marylad meh@usa.edu Courtey Moe Departmet of Mathematics, U. S. Naval

More information

Measurable Functions

Measurable Functions Measurable Fuctios Dug Le 1 1 Defiitio It is ecessary to determie the class of fuctios that will be cosidered for the Lebesgue itegratio. We wat to guaratee that the sets which arise whe workig with these

More information

4.4 Monotone Sequences and Cauchy Sequences

4.4 Monotone Sequences and Cauchy Sequences 4.4. MONOTONE SEQUENCES AND CAUCHY SEQUENCES 3 4.4 Mootoe Sequeces ad Cauchy Sequeces 4.4. Mootoe Sequeces The techiques we have studied so far require we kow the limit of a sequece i order to prove the

More information

ORDERS OF GROWTH KEITH CONRAD

ORDERS OF GROWTH KEITH CONRAD ORDERS OF GROWTH KEITH CONRAD Itroductio Gaiig a ituitive feel for the relative growth of fuctios is importat if you really wat to uderstad their behavior It also helps you better grasp topics i calculus

More information

8.3 POLAR FORM AND DEMOIVRE S THEOREM

8.3 POLAR FORM AND DEMOIVRE S THEOREM SECTION 8. POLAR FORM AND DEMOIVRE S THEOREM 48 8. POLAR FORM AND DEMOIVRE S THEOREM Figure 8.6 (a, b) b r a 0 θ Complex Number: a + bi Rectagular Form: (a, b) Polar Form: (r, θ) At this poit you ca add,

More information

MATHEMATICS: CONCEPTS, AND FOUNDATIONS Vol. I - Matrices, Vectors, Determinants, and Linear Algebra - Tadao ODA

MATHEMATICS: CONCEPTS, AND FOUNDATIONS Vol. I - Matrices, Vectors, Determinants, and Linear Algebra - Tadao ODA MATRICES, VECTORS, DETERMINANTS, AND LINEAR ALGEBRA Tadao Tohoku Uiversity, Japa Keywords: matrix, determiat, liear equatio, Cramer s rule, eigevalue, Jorda caoical form, symmetric matrix, vector space,

More information

Sets with a Negative Number of Elements

Sets with a Negative Number of Elements Sets with a Negative Number of Elemets D. Loeb November 16, 1995 1 Itroductio Give a uiverse of discourse U a multiset ca be thought of as a fuctio M from U to the atural umbers N. I this paper, we defie

More information

Chapter 5: Inner Product Spaces

Chapter 5: Inner Product Spaces Chapter 5: Ier Product Spaces Chapter 5: Ier Product Spaces SECION A Itroductio to Ier Product Spaces By the ed of this sectio you will be able to uderstad what is meat by a ier product space give examples

More information

CME 302: NUMERICAL LINEAR ALGEBRA FALL 2005/06 LECTURE 8

CME 302: NUMERICAL LINEAR ALGEBRA FALL 2005/06 LECTURE 8 CME 30: NUMERICAL LINEAR ALGEBRA FALL 005/06 LECTURE 8 GENE H GOLUB 1 Positive Defiite Matrices A matrix A is positive defiite if x Ax > 0 for all ozero x A positive defiite matrix has real ad positive

More information

3. Greatest Common Divisor - Least Common Multiple

3. Greatest Common Divisor - Least Common Multiple 3 Greatest Commo Divisor - Least Commo Multiple Defiitio 31: The greatest commo divisor of two atural umbers a ad b is the largest atural umber c which divides both a ad b We deote the greatest commo gcd

More information

Linear Operators / Functions as Vectors

Linear Operators / Functions as Vectors ecture 4 Phys 3750 iear Operators / Fuctios as Vectors Overview ad otivatio: We first itroduce the cocept of liear operators o a vector space. We the look at some more vector-space examples, icludig a

More information

5.3. Generalized Permutations and Combinations

5.3. Generalized Permutations and Combinations 53 GENERALIZED PERMUTATIONS AND COMBINATIONS 73 53 Geeralized Permutatios ad Combiatios 53 Permutatios with Repeated Elemets Assume that we have a alphabet with letters ad we wat to write all possible

More information

A classification of Ramanujan unitary Cayley graphs

A classification of Ramanujan unitary Cayley graphs A classificatio of Ramauja uitary Cayley graphs Adrew Droll Submitted: Sep 24, 2009; Accepted: May 18, 2010; Published: May 25, 2010 Mathematics Subject Classificatio: 05C75 Abstract The uitary Cayley

More information

Sequences and Series

Sequences and Series CHAPTER 9 Sequeces ad Series 9.. Covergece: Defiitio ad Examples Sequeces The purpose of this chapter is to itroduce a particular way of geeratig algorithms for fidig the values of fuctios defied by their

More information

SECTION 1.5 : SUMMATION NOTATION + WORK WITH SEQUENCES

SECTION 1.5 : SUMMATION NOTATION + WORK WITH SEQUENCES SECTION 1.5 : SUMMATION NOTATION + WORK WITH SEQUENCES Read Sectio 1.5 (pages 5 9) Overview I Sectio 1.5 we lear to work with summatio otatio ad formulas. We will also itroduce a brief overview of sequeces,

More information

Some Recent Developments in Symmetries and Conservation Laws for Partial Differential Equations

Some Recent Developments in Symmetries and Conservation Laws for Partial Differential Equations Some Recet Developmets i Symmetries ad Coservatio Laws for Partial Differetial Equatios This course will be cocered with recet developmets o how to fid ad use symmetries for PDEs; how to fid ad use coservatio

More information

Advanced Probability Theory

Advanced Probability Theory Advaced Probability Theory Math5411 HKUST Kai Che (Istructor) Chapter 1. Law of Large Numbers 1.1. σ-algebra, measure, probability space ad radom variables. This sectio lays the ecessary rigorous foudatio

More information

The Field Q of Rational Numbers

The Field Q of Rational Numbers Chapter 3 The Field Q of Ratioal Numbers I this chapter we are goig to costruct the ratioal umber from the itegers. Historically, the positive ratioal umbers came first: the Babyloias, Egyptias ad Grees

More information

when n = 1, 2, 3, 4, 5, 6, This list represents the amount of dollars you have after n days. Note: The use of is read as and so on.

when n = 1, 2, 3, 4, 5, 6, This list represents the amount of dollars you have after n days. Note: The use of is read as and so on. Geometric eries Before we defie what is meat by a series, we eed to itroduce a related topic, that of sequeces. Formally, a sequece is a fuctio that computes a ordered list. uppose that o day 1, you have

More information

A probabilistic proof of a binomial identity

A probabilistic proof of a binomial identity A probabilistic proof of a biomial idetity Joatho Peterso Abstract We give a elemetary probabilistic proof of a biomial idetity. The proof is obtaied by computig the probability of a certai evet i two

More information

The second difference is the sequence of differences of the first difference sequence, 2

The second difference is the sequence of differences of the first difference sequence, 2 Differece Equatios I differetial equatios, you look for a fuctio that satisfies ad equatio ivolvig derivatives. I differece equatios, istead of a fuctio of a cotiuous variable (such as time), we look for

More information

6.1 Evaluate nth Roots and Use Rational Exponents

6.1 Evaluate nth Roots and Use Rational Exponents 6.1 Evaluate th Roots ad Use Ratioal Expoets Goal Evaluate th roots ad study ratioal expoets. VOCABULARY th root of a For a iteger greater tha 1, if b = a, the b is a th root of a. Idex of a radical A

More information

Properties of MLE: consistency, asymptotic normality. Fisher information.

Properties of MLE: consistency, asymptotic normality. Fisher information. Lecture 3 Properties of MLE: cosistecy, asymptotic ormality. Fisher iformatio. I this sectio we will try to uderstad why MLEs are good. Let us recall two facts from probability that we be used ofte throughout

More information

SEQUENCE AND SERIES. Chapter Overview

SEQUENCE AND SERIES. Chapter Overview Chapter 9 SEQUENCE AND SERIES 9.1 Overview By a sequece, we mea a arragemet of umbers i a defiite order accordig to some rule. We deote the terms of a sequece by a 1, a,..., etc., the subscript deotes

More information

Sets, Logic and Categories Solutions to Exercises: Chapter 1

Sets, Logic and Categories Solutions to Exercises: Chapter 1 Sets, Logic ad Categories Solutios to Exercises: Chapter 1 1.1 Show that the empty set is a subset of every set. Let x be ay set. The for ay set z, the implicatio (z /0) (z x) is true, sice (z /0) is false;

More information

π d i (b i z) (n 1)π )... sin(θ + )

π d i (b i z) (n 1)π )... sin(θ + ) SOME TRIGONOMETRIC IDENTITIES RELATED TO EXACT COVERS Joh Beebee Uiversity of Alaska, Achorage Jauary 18, 1990 Sherma K Stei proves that if si π = k si π b where i the b i are itegers, the are positive

More information

Newton s method is a iterative scheme for solving equations by finding zeros of a function. The

Newton s method is a iterative scheme for solving equations by finding zeros of a function. The Usig Iterative Methods to Solve Equatios Newto s method is a iterative scheme for solvig equatios by fidig zeros of a fuctio. The f Newto iteratio 1 f fids the zeros of f by fidig the fied poit of g f

More information

From compound interest to the natural exponential function

From compound interest to the natural exponential function From compoud iterest to the atural expoetial fuctio Abstract The most commo itroductio to the atural expoetial fuctio occurs i coectio with compoud iterest. I this paper we will show how to build o this

More information

Distributions of Order Statistics

Distributions of Order Statistics Chapter 2 Distributios of Order Statistics We give some importat formulae for distributios of order statistics. For example, where F k: (x)=p{x k, x} = I F(x) (k, k + 1), I x (a,b)= 1 x t a 1 (1 t) b 1

More information

Is mathematics discovered or

Is mathematics discovered or 112 Chapter 11 Sequeces, Iductio, ad Probability Sectio 11. Objectives Evaluate a biomial coefficiet. Expad a biomial raised to a power. Fid a particular term i a biomial expasio. The Biomial Theorem Galaxies

More information

A CHARACTERIZATION OF MINIMAL ZERO-SEQUENCES OF INDEX ONE IN FINITE CYCLIC GROUPS

A CHARACTERIZATION OF MINIMAL ZERO-SEQUENCES OF INDEX ONE IN FINITE CYCLIC GROUPS INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 5(1) (2005), #A27 A CHARACTERIZATION OF MINIMAL ZERO-SEQUENCES OF INDEX ONE IN FINITE CYCLIC GROUPS Scott T. Chapma 1 Triity Uiversity, Departmet

More information

The Discrete Fourier Transform

The Discrete Fourier Transform The Discrete Fourier Trasform Fracis J. Narcowich October 4, 2005 1 Motivatio We wat to umerically approximate coefficiets i a Fourier series. The first step is to see how the trapezoidal rule applies

More information

Chapter Suppose you wish to use the Principle of Mathematical Induction to prove that 1 1! + 2 2! + 3 3! n n! = (n + 1)! 1 for all n 1.

Chapter Suppose you wish to use the Principle of Mathematical Induction to prove that 1 1! + 2 2! + 3 3! n n! = (n + 1)! 1 for all n 1. Chapter 4. Suppose you wish to prove that the followig is true for all positive itegers by usig the Priciple of Mathematical Iductio: + 3 + 5 +... + ( ) =. (a) Write P() (b) Write P(7) (c) Write P(73)

More information

6.10 The Binomial Series

6.10 The Binomial Series 6 THE BINOMIAL SERIES 375 6 The Biomial Series 6 Itroductio This sectio focuses o derivig a Maclauri series for fuctios of the form f x) + x) for ay umber We use the results we obtaied i the sectio o Taylor

More information

Florian Enescu, Fall 2010 Polynomials: Lecture notes Week 9.

Florian Enescu, Fall 2010 Polynomials: Lecture notes Week 9. Floria Eescu, Fall 200 Polyomials: Lecture otes Wee 9 Gauss-Lucas Theorem; Jese diss, Jese Theorem The followig theorem by Gauss ad rediscovered by Lucas describes a beautiful relatio ship betwee the roots

More information

Inequalities and Maximum-Minimum Problems

Inequalities and Maximum-Minimum Problems Iequalities ad Maximum-Miimum Problems Hery Liu, 6 February 007 There are may olympiad level problems i mathematics which belog to areas that are ot covered well at all at schools Three major examples

More information

B. Fast Algorithms for Discrete Fourier Transform

B. Fast Algorithms for Discrete Fourier Transform B. Fast Algorithms for Discrete Fourier Trasform B.. Itroductio (9., 9.) B.. Radix- Decimatio-i-Time FFT (9.3, 9.5) B.3. Radix- Decimatio-i-Frequecy FFT (9.4, 9.5) B.4. FFT for a More Geeral (9.5) B.5.

More information

The Probability of a Random Walk First Returning to the Origin at Time t = 2n

The Probability of a Random Walk First Returning to the Origin at Time t = 2n The Probability of a Radom Wal First Returig to the Origi at Time t Arturo Feradez Uiversity of Califoria, Bereley Statistics 157: Topics I Stochastic Processes Semiar February 1, 011 What is the probability

More information

Errors in Polynomial Interpolation

Errors in Polynomial Interpolation LECTURE 6 Errors i Polyomial Iterpolatio As with ay approximate method, the utility of polyomial iterpolatio ca ot be stretched too far. I this lecture we shall quatify the errors that ca occur i polyomial

More information

Lecture 16: Properties of S Matrices. Shifting Reference Planes.

Lecture 16: Properties of S Matrices. Shifting Reference Planes. Whites, EE 48/58 Lecture 6 Page of Lecture 6: Properties of S Matrices. Shiftig Referece Plaes. I Lecture 4, we saw that for reciprocal etworks the Z ad Y matrices are:. Purely imagiary for lossless etworks,

More information