1. MATHEMATICAL INDUCTION

Save this PDF as:
 WORD  PNG  TXT  JPG

Size: px
Start display at page:

Download "1. MATHEMATICAL INDUCTION"

Transcription

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

2 EXAMPLE 3: Prove that for ay iteger 1.! (1.3 Proof: STEP 1: For 1 (1.3 is true, sice 1! 1 1. STEP 2: Suppose (1.3 is true for some k 1, that is k! k k. STEP 3: Prove that (1.3 is true for k + 1, that is (k + 1!? (k + 1 k+1. We have (k + 1! k! (k + 1 ST.2 k k (k + 1 < (k + 1 k (k + 1 (k + 1 k+1. EXAMPLE 4: Prove that for ay iteger (1.4 Proof: STEP 1: For 0 (1.4 is true, sice STEP 2: Suppose (1.4 is true for some k 0, that is 8 3 2k 1. STEP 3: Prove that (1.4 is true for k + 1, that is 8 3 2(k+1 1. We have 3 2(k k k k ( } 2k {{ 8} + } 3 2k {{ 1 }. div.by 8 St. 2 div.by 8 EXAMPLE 5: Prove that for ay iteger (1.5 Proof: STEP 1: For 1 (1.5 is true, sice STEP 2: Suppose (1.5 is true for some k 1, that is 7 k 7 k. STEP 3: Prove that (1.5 is true for k + 1, that is 7 (k (k + 1. We have (k (k + 1 k 7 + 7k k k k k 2 + 7k + 1 k 1 k 7 k } {{ } St. 2 div. by 7 + 7k } k k 4 {{ + 35k k 2 + 7k }. div. by 7 2

3 2. THE BINOMIAL THEOREM DEFINITION: Let ad k be some itegers with 0 k. The! k k!( k! is called a biomial coefficiet. PROPERTIES: Proof: We have 0! 0!( 0!! 1! 1,!!(!!! 0!!! Proof: We have 1 1! 1!( 1! ( 1! 1! ( 1!,! ( 1![ ( 1]!! ( 1! 1! ( 1! ( 1! 1!. 3.. k k Proof: We have k! k!( k!! ( k!k!! ( k![ ( k]!. k 3

4 4. + k k 1 Proof: We have + k k 1 ( + 1 k.! k!( k! +! (k 1!( k + 1!!( k + 1 k!( k!( k + 1 +!k (k 1!k( k + 1!!( k + 1 k!( k + 1! +!k k!( k + 1!!( k + 1 +!k k!( k + 1!!!k +! +!k k!( k + 1!! +! k!( k + 1!!( + 1 k!( k + 1! ( + 1! k!( k + 1! ( + 1! k!( + 1 k! ( + 1 k. PROBLEM: For all itegers ad k with 1 k we have k 1 k k k + 1 Proof: By property 4 we have k 1 k + k + 1 k k + k + 1 k k k k + 1 THEOREM (The Biomial Theorem: Let a ad b be ay real umbers ad let be ay oegative iteger. The (a + b a + a 1 b + a 2 b a 2 b 2 + ab 1 + b

5 PROBLEM: For all itegers 1 we have Proof: Puttig a b 1 i the Theorem above, we get ( hece , therefore by property 1 we get , PROBLEM: For all itegers 1 we have ( Proof: Puttig a 1 ad b 1 i the Theorem above, we get hece ( ( ( ( ( 1, ( ( 1, 1 therefore by property 1 we get ( (

6 3. RATIONAL AND IRRATIONAL NUMBERS DEFINITION: Ratioal umbers are all umbers of the form p, where p ad q are itegers ad q 0. q EXAMPLE: 1 2, 5 50, 2, 0, 3 10, etc. NOTATIONS: N all atural umbers, that is, 1, 2, 3,... Z all iteger umbers, that is, 0, ±1, ±2, ±3,... Q all ratioal umbers R all real umbers DEFINITION: A umber which is ot ratioal is said to be irratioal. PROBLEM 1: Prove that 2 is irratioal. Proof: Assume to the cotrary that 2 is ratioal, that is 2 p q, where p ad q are itegers ad q 0. Moreover, let p ad q have o commo divisor > 1. The 2 p2 q 2 2q 2 p 2. (3.1 Sice 2q 2 is eve, it follows that p 2 is eve. The p is also eve (i fact, if p is odd, the p 2 is odd. This meas that there exists k Z such that Substitutig (3.2 ito (3.1, we get p 2k. (3.2 2q 2 (2k 2 2q 2 4k 2 q 2 2k 2. Sice 2k 2 is eve, it follows that q 2 is eve. The q is also eve. This is a cotradictio. 6

7 PROBLEM 2: Prove that 3 4 is irratioal. Proof: Assume to the cotrary that 3 4 is ratioal, that is 3 4 p q, where p ad q are itegers ad q 0. Moreover, let p ad q have o commo divisor > 1. The 4 p3 q 3 4q 3 p 3. (3.3 Sice 4q 3 is eve, it follows that p 3 is eve. The p is also eve (i fact, if p is odd, the p 3 is odd. This meas that there exists k Z such that Substitutig (3.4 ito (3.3, we get p 2k. (3.4 4q 3 (2k 3 4q 3 8k 3 q 3 2k 3. Sice 2k 3 is eve, it follows that q 3 is eve. The q is also eve. This is a cotradictio. PROBLEM 3: Prove that 6 is irratioal. Proof: Assume to the cotrary that 6 is ratioal, that is 6 p q, where p ad q are itegers ad q 0. Moreover, let p ad q have o commo divisor > 1. The 6 p2 q 2 6q 2 p 2. (3.5 Sice 6q 2 is eve, it follows that p 2 is eve. The p is also eve (i fact, if p is odd, the p 2 is odd. This meas that there exists k Z such that Substitutig (3.6 ito (3.5, we get p 2k. (3.6 6q 2 (2k 2 6q 2 4k 2 3q 2 2k 2. Sice 2k 2 is eve, it follows that 3q 2 is eve. The q is also eve (i fact, if q is odd, the 3q 2 is odd. This is a cotradictio. 7

8 PROBLEM 4: Prove that is irratioal. Proof: Assume to the cotrary that is ratioal, that is where p ad q are itegers ad q 0. The 1 p q, 3(p 5q 2. q Sice 2 is irratioal ad 3(p 5q q is ratioal, we obtai a cotradictio. PROBLEM 5: Prove that log 5 2 is irratioal. Proof: Assume to the cotrary that log 5 2 is ratioal, that is log 5 2 p q, where p ad q are itegers ad q 0. The 5 p/q 2 5 p 2 q. Sice 5 p is odd ad 2 q is eve, we obtai a cotradictio. 8

9 4. DIVISION ALGORITHM PROBLEM: Prove that 3 is irratioal. Proof: Assume to the cotrary that 3 is ratioal, that is 3 p q, where p ad q are itegers ad q 0. Moreover, let p ad q have o commo divisor > 1. The 3 p2 q 2 3q 2 p 2. Sice 3q 2 is divisible by 3, it follows that p 2 is divisible by 3. The p is also divisible by 3 (i fact, if p is ot divisible by 3, the...??? THEOREM (DIVISION ALGORITHM: For ay itegers a ad b with a 0 there exist uique itegers q ad r such that b aq + r, where 0 r < a. The itegers q ad r are called the quotiet ad the remider respectively. EXAMPLE 1: Let b 49 ad a 4, the , so the quotiet is 12 ad the remider is 1. REMARK: We ca also write 49 as , but i this case 13 is ot a remider, sice it is NOT less tha 3. EXAMPLE 2: Let a 2. Sice 0 r < 2, the for ay iteger umber b we have ONLY TWO possibilities: b 2q or b 2q + 1. So, thaks to the Divisio Algorithm we proved that ay iteger umber is either eve or odd. EXAMPLE 3: Let a 3. Sice 0 r < 3, the for ay iteger umber b we have ONLY THREE possibilities: b 3q, b 3q + 1, or b 3q + 2. Proof of the Problem: Assume to the cotrary that 3 is ratioal, that is 3 a b, where a ad b are itegers ad b 0. Moreover, let a ad b have o commo divisor > 1. The 3 a2 b 2 3b 2 a 2. (4.1 9

10 Sice 3b 2 is divisible by 3, it follows that a 2 is divisible by 3. The a is also divisible by 3. I fact, if a is ot divisible by 3, the by the Divisio Algorithm there exists q Z such that Suppose a 3q + 1, the a 3q + 1 or a 3q + 2. a 2 (3q q 2 + 6q + 1 3(3q 2 + 2q } {{ } q + 1 3q + 1, which is ot divisible by 3. We get a cotradictio. Similarly, if a 3q + 2, the a 2 (3q q q + 4 3(3q 2 + 4q + 1 } {{ } q + 1 3q + 1, which is ot divisible by 3. We get a cotradictio agai. So, we proved that if a 2 is divisible by 3, the a is also divisible by 3. This meas that there exists q Z such that a 3q. (4.2 Substitutig (4.2 ito (4.1, we get 3b 2 (3q 2 3b 2 9q 2 b 2 3q 2. Sice 3q 2 is divisible by 3, it follows that b 2 is divisible by 3. The b is also divisible by 3 by the argumets above. This is a cotradictio. 10

11 5. GREATEST COMMON DIVISOR AND EUCLID S LEMMA PROBLEM: Prove that 101 is irratioal. Proof: Assume to the cotrary that 101 is ratioal, that is 101 a b, where a ad b are itegers ad b 0. Moreover, let a ad b have o commo divisor > 1. The 101 a2 b 2 101b 2 a 2. Sice 101b 2 is divisible by 101, it follows that a 2 is divisible by 101. The a is also divisible by 101. I fact, if a is ot divisible by 101, the by the Divisio Algorithm there exists q Z such that a 101q + 1 or a 101q + 2 or a 101q + 3 or a 101q ??? DEFINITION: If a ad b are itegers with a 0, we say that a is a divisor of b if there exists a iteger q such that b aq. We also say that a divides b ad we deote this by a b. EXAMPLE: We have: 4 12, sice , sice DEFINITION: A commo divisor of ozero itegers a ad b is a iteger c such that c a ad c b. The greatest commo divisor (gcd of a ad b, deoted by (a, b, is the largest commo divisor of itegers a ad b. EXAMPLE: The commo divisors of 24 ad 84 are ±1, ±2, ±3, ±4, ±6, ad ±12. Hece, (24, Similarly, lookig at sets of commo divisors, we fid that (15, 81 3, (100, 5 5, (17, 25 1, ( 17, , etc. THEOREM: If a ad b are ozero itegers, the their gcd is a liear combiatio of a ad b, that is there exist iteger umbers s ad t such that sa + tb (a, b. Proof: Let d be the least positive iteger that is a liear combiatio of a ad b. We write d sa + tb, (5.1 11

12 where s ad t are itegers. We first show that d a. By the Divisio Algorithm we have From this ad (5.1 it follows that a dq + r, where 0 r < d. r a dq a q(sa + tb a qsa qtb (1 qsa + ( qtb. This shows that r is a liear combiatio of a ad b. Sice 0 r < d, ad d is the least positive liear combiatio of a ad b, we coclude that r 0, ad hece d a. I a similar maer, we ca show that d b. We have show that d is a commo divisor of a ad b. We ow show that d is the greatest commo divisor of a ad b. Assume to the cotrary that (a, b d ad d > d. Sice d a, d b, ad d sa + tb, it follows that d d, therefore d d. We obtai a cotradictio. So, d is the greatest commo divisor of a ad b ad this cocludes the proof. DEFINITION: A iteger 2 is called prime if its oly positive divisors are 1 ad. Otherwise, is called composite. EXAMPLE: Numbers 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, are prime. THEOREM (Euclid s Lemma: If p is a prime ad p ab, the p a or p b. More geerally, if a prime p divides a product a 1 a 2... a, the it must divide at least oe of the factors a i. Proof: Assume that p a. We must show that p b. By the theorem above, there are itegers s ad t with sp + ta (p, a. Sice p is prime ad p a, we have (p, a 1, ad so sp + ta 1. Multiplyig both sides by b, we get Sice p ab ad p spb, it follows that spb + tab b. (5.2 p (spb + tab. This ad (5.2 give p b. This completes the proof of the first part of the theorem. The secod part (geeralizatio easily follows by iductio o 2. COROLLARY: If p is a prime ad p a 2, the p a. Proof: Put a b i Euclid s Lemma. 12

13 THEOREM: Let p be a prime. The p is irratioal. Proof: Assume to the cotrary that p is ratioal, that is p a b, where a ad b are itegers ad b 0. Moreover, let a ad b have o commo divisor > 1. The p a2 b 2 pb 2 a 2. (5.3 Sice pb 2 is divisible by p, it follows that a 2 is divisible by p. The a is also divisible by p by the Corollary above. This meas that there exists q Z such that Substitutig (5.4 ito (5.3, we get a pq. (5.4 pb 2 (pq 2 b 2 pq 2. Sice pq 2 is divisible by p, it follows that b 2 is divisible by p. The b is also divisible by p by the Corollary above. This is a cotradictio. PROBLEM: Prove that 101 is irratioal. Proof: Sice 101 is prime, the result immediately follows from the Theorem above. PROBLEM: Prove that if a ad b are positive itegers with (a, b 1, the (a 2, b 2 1 for all Z +. Proof 1: Assume to the cotrary that (a 2, b 2 > 1. The there is a prime p such that p a 2 ad p b 2. From this by Euclid s Lemma it follows that p a ad p b, therefore (a, b p. This is a cotradictio. Proof 2 (Hit: Use the Fudametal Theorem of Arithmetic below. 13

14 6. FUNDAMENTAL THEOREM OF ARITHMETIC THEOREM (Fudametal Theorem of Arithmetic: Assume that a iteger a 2 has factorizatios a p 1... p m ad a q 1... q, where the p s ad q s are primes. The m ad the q s may be reidexed so that q i p i for all i. Proof: We prove by iductio o l, the larger of m ad, i. e. l max(m,. where Step 1. If l 1, the the give equatio i a p 1 q 1, ad the result is obvious. Step 2. Suppose the theorem holds for some l k 1. Step 3. We prove it for l k + 1. Let a p 1... p m q 1... q, (6.1 max(m, k + 1. (6.2 From (6.1 it follows that p m q 1... q, therefore by Euclid s Lemma there is some q i such that p m q i. But q i, beig a prime, has o positive divisors other tha 1, therefore p m q i. Reidexig, we may assume that q p m. Cacelig, we have p 1... p m 1 q 1... q 1. Moreover, max(m 1, 1 k by (6.2. Therefore by step 2 q s may be reidexed so that q i p i for all i; plus, m 1 1, hece m. COROLLARY: If a 2 is a iteger, the there are uique distict primes p i ad uique itegers e i > 0 such that a p e p e. Proof: Just collect like terms i a prime factorizatio. EXAMPLE: PROBLEM: Prove that log 3 5 is irratioal. Proof: Assume to the cotrary that log 3 5 is ratioal, that is log 3 5 p q, where p ad q are itegers ad q 0. The 3 p/q 5 3 p 5 q, which cotradicts the Fudametal Theorem of Arithmetic. 14

15 7. EUCLIDEAN ALGORITHM THEOREM (Euclidea Algorithm: Let a ad b be positive itegers. The there is a algorithm that fids (a, b. LEMMA: If a, b, q, r are itegers ad a bq + r, the (a, b (b, r. Proof: We have (a, b (bq + r, b (b, r. Proof of the Theorem: The idea is to keep repeatig the divisio algorithm. We have: therefore a bq 1 + r 1, (a, b (b, r 1 b r 1 q 2 + r 2, (b, r 1 (r 1, r 2 r 1 r 2 q 3 + r 3, (r 1, r 2 (r 2, r 3 r 2 r 3 q 4 + r 4, (r 2, r 3 (r 3, r 4... r 2 r 1 q + r, (r 2, r 1 (r 1, r r 1 r q +1, (r 1, r r, (a, b (b, r 1 (r 1, r 2 (r 2, r 3 (r 3, r 4... (r 2, r 1 (r 1, r r. PROBLEM: Fid (326, 78. Solutio: By the Euclidea Algorithm we have therefore (326, PROBLEM: Fid (252, Solutio: By the Euclidea Algorithm we have therefore (252,

16 PROBLEM: Fid (4361, Solutio: By the Euclidea Algorithm we have therefore (4361, , THEOREM: Let a p e p e ad b p f p f (a, b p mi(e 1,f p mi(e,f. be positive itegers. The EXAMPLE: Sice ad , we have: (720, PROBLEM: Let a Z. Prove that (2a + 3, a Proof: By the Lemma above we have (2a + 3, a + 2 (a a + 2, a + 2 (a + 1, a + 2 (a + 1, a (a + 1, 1 1. PROBLEM: Let a Z. Prove that (7a + 2, 10a Proof: By the Lemma above we have (7k + 2, 10k + 3 (7k + 2, 7k k + 1 (7k + 2, 3k + 1 (6k k, 3k + 1 (k, 3k + 1 (k,

17 8. FERMAT S LITTLE THEOREM Theorem (Fermat s Little Theorem: Let p be a prime. We have p p (8.1 for ay iteger 1. Proof 1: STEP 1: For 1 (8.1 is true, sice p 1 p 1. STEP 2: Suppose (8.1 is true for some k 1, that is p k p k. STEP 3: Prove that (8.1 is true for k + 1, that is p (k + 1 p (k + 1. Lemma: Let p be a prime ad l be a iteger with 1 l p 1. The p p. l Proof: We have p l p! l!(p l! l!(l p l!(p l! (l p, (p l! therefore p (p l! (l p. l Form this it follows that p p (p l!, l p hece by Euclid s Lemma p divides or (p l!. It is easy to see that p (p l!. Therefore l p p. l We have (k + 1 p (k + 1 k p + k p k } {{ } St. 2 div. by p p k p ( p + p p k p k + 1 k 1 2 p 1 p p k p 1 + k p k. 1 2 p 1 } {{ } div. by p by Lemma 17

18 9. CONGRUENCES DEFINITION: Let m be a positive iteger. The itegers a ad b are cogruet modulo m, deoted by a b mod m, if m (a b. EXAMPLE: 3 1 mod 2, 6 4 mod 2, 14 0 mod 7, mod 9, mod 35. PROPERTIES: Let m be a positive iteger ad let a, b, c, d be itegers. The 1. a a mod m 2. If a b mod m, the b a mod m. 3. If a b mod m ad b c mod m, the a c mod m. 4. (a If a qm + r mod m, the a r mod m. (b Every iteger a is cogruet mod m to exactly oe of 0, 1,..., m If a b mod m ad c d mod m, the a ± c b ± d mod m ad ac bd mod m. 5. If a b mod m, the a ± c b ± c mod m ad ac bc mod m. 5. If a b mod m, the a b mod m for ay Z If (c, m 1 ad ac bc mod m, the a b mod m. Proof 2 of Fermat s Little Theorem: We distiguish two cases. Case A: Let p, the, obviously, p p, ad we are doe. Case B: Let p. Sice p is prime, we have (p, 1. (9.1 Cosider the followig umbers:, 2, 3,..., (p 1. 18

19 We have r 1 mod p 2 r 2 mod p 3 r 3 mod p... (p 1 r p 1 mod p, where 0 r i p 1. Moreover, r i 0, sice otherwise p i, ad therefore by Euclid d Lemma p i or p. But this is impossible, sice p > i ad p. So, From (9.2 by property 5 we have (9.2 1 r i p 1. ( (p 1 r 1 r 2... r p 1 mod p (p 1! p 1 r 1 r 2... r p 1 mod p. (9.4 Lemma: We have Proof: We first show that r 1 r 2... r p 1 (p 1!. (9.5 r 1, r 2,..., r p 1 are all distict. (9.6 I fact, assume to the cotrary that there are some r i ad r j with r i r j. The by (9.2 we have i j mod p, therefore by property 6 with (9.1 we get i j mod p, which is impossible. This cotradictio proves (9.6. By the Lemma we have r 1 r 2... r p 1 (p 1!. (9.7 By (9.4 ad (9.7 we obtai (p 1! p 1 (p 1! mod p. Sice (p, (p 1! 1, from this by by property 6 we get hece p 1 1 mod p, p mod p by property 4. This meas that p is divisible by p. COROLLARY: Let p be a prime. The for ay iteger 1 with (, p 1. p 1 1 mod p THEOREM: If (a, m 1, the, for every iteger b, the cogruece ax b mod m (9.8 19

20 has exactly oe solutio where s is such umber that x bs mod m, (9.9 as 1 mod m. (9.10 Proof (Sketch: We show that (9.9 is the solutio of (9.8. I fact, if we multiply (9.9 by a ad (9.10 by b (we ca do that by property 5, we get which imply (9.8 by property 3. ax abs mod m ad bsa b mod m, Problems Problem 1: Fid all solutios of the cogruece 2x 1 mod 3. Solutio: We first ote that (2, 3 1. Therefore we ca apply the theorem above. Sice mod 3, we get x mod 3. Problem 2: Fid all solutios of the followig cogruece 2x 5 mod 7. Solutio: We first ote that (2, 7 1. Therefore we ca apply the theorem above. Sice mod 7, we get x mod 7. Problem 3: Fid all solutios of the cogruece 3x 4 mod 8. Solutio: We first ote that (3, 8 1. Therefore we ca apply the theorem above. Sice mod 8, we get x mod 8. Problem 4: Fid all solutios of the followig cogruece 2x 5 mod 8. 20

21 Solutio: Sice (2, 8 2, we ca t apply the theorem above directly. We ow ote that 2x 5 mod 8 is equivalet to 2x 8y 5, which is impossible, sice the left-had side is divisible by 2, whereas the right-had side is ot. So, this equatio has o solutios. Problem 5: Fid all solutios of the cogruece 8x 7 mod 18. Solutio: Sice (8, 18 2, we ca t apply the theorem above directly. We ow ote that 8x 7 mod 18 is equivalet to 8x 18y 7, which is impossible, sice the left-had side is divisible by 2, whereas the right-had side is ot. So, this equatio has o solutios. Problem 6: Fid all solutios of the followig cogruece 4x 2 mod 6. Solutio: Sice (4, 6 2, we ca t apply the theorem above directly agai. However, cacelig out 2 (thik about that!, we obtai 2x 1 mod 3. Note that (2, 3 1. Therefore we ca apply the theorem above to the ew equatio. Sice mod 3, we get x mod 3. Problem 7: Fid all solutios of the cogruece 6x 3 mod 15. Solutio: Sice (6, 15 3, we ca t apply the theorem above directly agai. cacelig out 3, we obtai 2x 1 mod 5. However, Note that (2, 5 1. Therefore we ca apply the theorem above to the ew equatio. Sice mod 5, we get x mod 5. Problem 8: Fid all solutios of the cogruece 9x mod

22 Solutio: We first rewrite this cogruece as 9x 5 mod 25. Note that (9, Therefore we ca apply the theorem above. Sice mod 25, we get x mod 25. Problem 9: What is the last digit of ? Solutio: It is obvious that therefore by property 5 we have mod 10, mod 10. This meas that the last digit of is 1. Problem 10: What is the last digit of ? Solutio: It is obvious that therefore by property 5 we have mod 10, This meas that the last digit is mod 10. Problem 11: Prove that there is o perfect square a 2 which is cogruet to 2 or 3 mod 4. Solutio 1: By the property 4(b each iteger umber is cogruet to 0 or 1 mod 2. Cosider all these cases ad use property 4(a: If a 0 mod 2, the a 2k, therefore a 2 4k 2, hece a 2 0 mod 4. If a 1 mod 2, the a 2k + 1, therefore a 2 4k 2 + 4k + 1, hece a 2 1 mod 4. So, a 2 0 or 1 mod 4. Therefore a 2 2 or 3 mod 4. Solutio 2: By the property 4(b each iteger umber is cogruet to 0, 1, 2, or 3 mod 4. Cosider all these cases ad use property 5 : If a 0 mod 4, the a mod 4. If a 1 mod 4, the a mod 4. If a 2 mod 4, the a mod 4. If a 3 mod 4, the a mod 4. So, a 2 0 or 1 mod 4. Therefore a 2 2 or 3 mod 4. 22

23 Problem 12: Prove that there is o itegers a such that a 4 is cogruet to 2 or 3 mod 4. Solutio: By the property 4(b each iteger umber is cogruet to 0, 1, 2, or 3 mod 4. Cosider all these cases ad use property 5 : If a 0 mod 4, the a mod 4. If a 1 mod 4, the a mod 4. If a 2 mod 4, the a mod 4. If a 3 mod 4, the a mod 4. So, a 4 0 or 1 mod 4. Therefore a 4 2 or 3 mod 4. Problem 13: Prove that there is o perfect square a 2 whose last digit is 2, 3, 7 or 8. Solutio: By the property 4(b each iteger umber is cogruet to 0, 1, 2,..., 8 or 9 mod 10. Cosider all these cases ad use property 5 : If a 0 mod 10, the a mod 10. If a 1 mod 10, the a mod 10. If a 2 mod 10, the a mod 10. If a 3 mod 10, the a mod 10. If a 4 mod 10, the a mod 10. If a 5 mod 10, the a mod 10. If a 6 mod 10, the a mod 10. If a 7 mod 10, the a mod 10. If a 8 mod 10, the a mod 10. If a 9 mod 10, the a mod 10. So, a 2 0, 1, 4, 5, 6 or 9 mod 10. Therefore a 2 2, 3, 7 or 8 mod 10, ad the result follows. Problem 14: Prove that is ot a perfect square. Solutio: The last digit is 3, which is impossible by Problem 13. Problem 15: Prove that is ot a perfect square. Solutio 1: The last digit is 2, which is impossible by Problem 13. Solutio 2: We have k+2. Therefore it is cogruet to 2 mod 4 by property 4(a, which is impossible by Problem 11. Problem 16: Prove that there is o perfect square a 2 whose last digits are 85. Solutio: It follows from problem 13 that a 2 5 mod 10 oly if a 5 mod 10. Therefore a 2 85 mod 100 oly if a 5, 15, 25,..., 95 mod 100. If we cosider all these cases ad use property 5 is the same maer as i problem 13, we will see that a 2 25 mod 100. Therefore a 2 85 mod 100, ad the result follows. 23

24 Problem 17: Prove that the equatio x 4 4y 3 has o solutios i iteger umbers. Solutio: Rewrite this equatio as which meas that which is impossible by Problem 12. x 4 4y + 3, x 4 3 mod 4, Problem 18: Prove that the equatio x 2 3y 5 has o solutios i iteger umbers. Solutio: Rewrite this equatio as which meas that x 2 3y + 5, x mod 3. By the property 4(a each iteger umber is cogruet to 0, 1, or 2 mod 3. Cosider all these cases ad use property 5 : If a 0 mod 3, the a mod 3. If a 1 mod 3, the a mod 3. If a 2 mod 4, the a mod 3. So, a 2 0 or 1 mod 3. Therefore a 2 2 mod 3. Problem 19: Prove that the equatio has o solutios i iteger umbers. Solutio: Rewrite this equatio as which meas that 3x 2 4y 5 3x 2 4y + 5, 3x mod 4. O the other had, by Problem 11 we have x 2 0 or 1 mod 4, hece 3x 2 0 or 3 mod 4. Therefore x 2 1 mod 4. Problem 20: Prove that the equatio has o solutios i iteger umbers. x 2 y

25 Solutio: By Problem 11 we have x 2 0 or 1 mod 4, hece x 2 y 2 0, 1 or -1 mod 4. O the other had, mod 4. Therefore x 2 y mod 4, Problem 21: Prove that Solutio: We have 11 1 mod 10, therefore by property 5 we get mod 10, which meas that Problem 22: Prove that Solutio: We have therefore by property 5 we get mod 10, which meas that mod 10, Problem 23: Prove that 23 a for ay a Z + with (a, Solutio: By Fermat s Little theorem we have a 22 1 mod 23, therefore by property 5 we get a mod 23, ad the result follows. Problem 24: Prove that 17 a 80 1 for ay a Z + with (a, Solutio: By Fermat s Little theorem we have a 16 1 mod 17, therefore by property 5 we get a mod 17, ad the result follows. Problem 25: What is the remaider after dividig 3 50 by 7? Solutio: By Fermat s Little theorem we have mod 7, therefore by property 5 we get mod 7, therefore mod 7. 25

26 10. PERMUTATIONS DEFINITION: A permutatio of a set X is a rearragemet of its elemets. EXAMPLE: 1. Let X {1, 2}. The there are 2 permutatios: 12, Let X {1, 2, 3}. The there are 6 permutatios: 123, 132, 213, 231, 312, Let X {1, 2, 3, 4}. The there are 24 permutatios: 1234, 1243, 1324, 1342, 1423, , 2143, 2314, 2341, 2413, , 3241, 3124, 3142, 3421, , 4213, 4321, 4312, 4123, 4132 REMARK: Oe ca show that there are exactly! permutatios of the -elemet set X. DEFINITION : A permutatio of a set X is a oe-oe correspodece (a bijectio from X to itself. NOTATION: Let X {1, 2,..., } ad α : X X be a permutatio. It is coveiet to describe this fuctio i the followig way: α. α(1 α(2... α( EXAMPLE: ( ( ( ( ( CONCLUSION: For a permutatio we ca use two differet otatios. For example, are the same permutatios. ( ad 26

27 DEFINITION: Let X {1, 2,..., } ad α : X X be a permutatio. Let i 1, i 2,..., i r be distict umbers from {1, 2,..., }. If α(i 1 i 2, α(i 2 i 3,..., α(i r 1 i r, α(i r i 1, ad α(i ν i ν for other umbers from {1, 2,..., }, the α is called a r-cycle. NOTATION: A r-cycle is deoted by (i 1 i 2... i r. EXAMPLE: 1 (1 1 cycle (1 1 cycle (12 2 cycle (13 2 cycle (123 3 cycle ( cycle ( cycle (125 3 cycle is ot a cycle REMARK: We ca use differet otatios for the same cycles. For example, (1 (2 (3, (123 (231 ( WARNING: Do ot cofuse otatios of a permutatio ad a cycle. For example, ( Istead, ( ad 123 (1. 27

28 Compositio (Product Of Permutatios Let The α ( α(1 α(2... α( ( α β ( β α ad β α(β(1 α(β(2... α(β( β(α(1 β(α(2... β(α( ( β(1 β(2... β(,.. WARNING: I geeral, α β β α. EXAMPLE: ( Let α α β β α ( , β ( ( ( ( We have: ( ( ,. REMARK: It is coveiet to represet a permutatio as the product of circles. EXAMPLE: ( (1367(49(2(5(8 (1367(49 REMARK: Oe ca fid a compositio of permutatios usig circles. EXAMPLE: Let α (123, β ( α β (123(12 (13(2 (13 β α (12(123 (1(23 (23 28 (12(3 (12. We have: ( ( ,.

29 2. Let We have: α (1532(4 (1532, β (14(2(35 (14( α β (1532(14(35 (1452(3 (1452 β α (14(35(1532 (1324(5 (1324 ( ( ,. THEOREM: The iverse of the cycle α (i 1 i 2... i r is the cycle α 1 (i r i r 1... i 1. EXAMPLE: Let α (15724(36. Fid α We have: I fact, ad THEOREM: α 1 (42751(63 α α 1 (15724(36(42751(63 (1 α 1 α (42751(63(15724(36 (1. Every permutatio α is either a cycle or a product of disjoit (with o commo elemets cycles. Examples 1. Determie which permutatios are equal: (a (12 12 (g (124(53 (53(124 (b (1 12 (h (124(53 (124(35 (c (1(2 (1 (i (124(53 (142(53 (d (12(34 (1234 (j ( (e (12(34 (123(234 (k ( (f (12(34 (123(234(341 (l (

30 2. Factor the followig permutatios ito the product of cycles: ( ( (2 3 10( ( (4 7 8(5 9( Fid the followig products: 4. Let α (135(24, β (124(35. We have: (a αβ (143 (b βα (152 (c β 1 (421(53 (d α 2004 (1 (12(34(56(1234 (24(56 (12(23(34(45 (12345 (12(34(56 (12(34(56 (123(234(345 (12(45 30

31 11. GROUPS DEFINITION: A operatio o a set G is a fuctio : G G G. DEFINITION: A group is a set G which is equipped with a operatio ad a special elemet e G, called the idetity, such that (i the associative law holds: for every x, y, z G, x (y z (x y z; (ii e x x x e for all x G; (iii for every x G, there is x G with x x e x x. EXAMPLE: Set Operatio + Operatio Additioal Coditio N o o Z yes o Q yes o for Q \ {0} R yes o for R \ {0} R \ Q o o EXAMPLE: Set Operatio + Operatio Z >0 o o Z 0 o o Q >0 o yes Q 0 o o R >0 o yes R 0 o o 31

32 EXAMPLE: Set Operatio + Operatio {2 : Z} yes o {2 + 1 : Z} o o {3 : Z} yes o {k : Z}, where k N is some fixed umber yes o {a : Z}, where a R, a 0, ±1, is some fixed umber o yes { p 2 : p Z, Z 0} yes o EXAMPLE: Set Operatio R >0 a b a 2 b 2 o R >0 a b a b o 32

GREATEST COMMON DIVISOR

GREATEST COMMON DIVISOR DEFINITION: GREATEST COMMON DIVISOR The greatest common divisor (gcd) of a and b, denoted by (a, b), is the largest common divisor of integers a and b. THEOREM: If a and b are nonzero integers, then their

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

Applications of Fermat s Little Theorem and Congruences

Applications of Fermat s Little Theorem and Congruences Applications of Fermat s Little Theorem and Congruences Definition: Let m be a positive integer. Then integers a and b are congruent modulo m, denoted by a b mod m, if m (a b). Example: 3 1 mod 2, 6 4

More information

Example 2 Find the square root of 0. The only square root of 0 is 0 (since 0 is not positive or negative, so those choices don t exist here).

Example 2 Find the square root of 0. The only square root of 0 is 0 (since 0 is not positive or negative, so those choices don t exist here). BEGINNING ALGEBRA Roots ad Radicals (revised summer, 00 Olso) Packet to Supplemet the Curret Textbook - Part Review of Square Roots & Irratioals (This portio ca be ay time before Part ad should mostly

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

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

THE ARITHMETIC OF INTEGERS. - multiplication, exponentiation, division, addition, and subtraction

THE ARITHMETIC OF INTEGERS. - multiplication, exponentiation, division, addition, and subtraction THE ARITHMETIC OF INTEGERS - multiplicatio, expoetiatio, divisio, additio, ad subtractio What to do ad what ot to do. THE INTEGERS Recall that a iteger is oe of the whole umbers, which may be either positive,

More information

Factoring x n 1: cyclotomic and Aurifeuillian polynomials Paul Garrett <garrett@math.umn.edu>

Factoring x n 1: cyclotomic and Aurifeuillian polynomials Paul Garrett <garrett@math.umn.edu> (March 16, 004) Factorig x 1: cyclotomic ad Aurifeuillia polyomials Paul Garrett Polyomials of the form x 1, x 3 1, x 4 1 have at least oe systematic factorizatio x 1 = (x 1)(x 1

More information

Soving Recurrence Relations

Soving Recurrence Relations Sovig Recurrece Relatios Part 1. Homogeeous liear 2d degree relatios with costat coefficiets. Cosider the recurrece relatio ( ) T () + at ( 1) + bt ( 2) = 0 This is called a homogeeous liear 2d degree

More information

Trigonometric Form of a Complex Number. The Complex Plane. axis. ( 2, 1) or 2 i FIGURE 6.44. The absolute value of the complex number z a bi is

Trigonometric Form of a Complex Number. The Complex Plane. axis. ( 2, 1) or 2 i FIGURE 6.44. The absolute value of the complex number z a bi is 0_0605.qxd /5/05 0:45 AM Page 470 470 Chapter 6 Additioal Topics i Trigoometry 6.5 Trigoometric Form of a Complex Number What you should lear Plot complex umbers i the complex plae ad fid absolute values

More information

WHEN IS THE (CO)SINE OF A RATIONAL ANGLE EQUAL TO A RATIONAL NUMBER?

WHEN IS THE (CO)SINE OF A RATIONAL ANGLE EQUAL TO A RATIONAL NUMBER? WHEN IS THE (CO)SINE OF A RATIONAL ANGLE EQUAL TO A RATIONAL NUMBER? JÖRG JAHNEL 1. My Motivatio Some Sort of a Itroductio Last term I tought Topological Groups at the Göttige Georg August Uiversity. This

More information

Chapter 5 O A Cojecture Of Erdíos Proceedigs NCUR VIII è1994è, Vol II, pp 794í798 Jeærey F Gold Departmet of Mathematics, Departmet of Physics Uiversity of Utah Do H Tucker Departmet of Mathematics Uiversity

More information

Section 8.3 : De Moivre s Theorem and Applications

Section 8.3 : De Moivre s Theorem and Applications The Sectio 8 : De Moivre s Theorem ad Applicatios Let z 1 ad z be complex umbers, where z 1 = r 1, z = r, arg(z 1 ) = θ 1, arg(z ) = θ z 1 = r 1 (cos θ 1 + i si θ 1 ) z = r (cos θ + i si θ ) ad z 1 z =

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

A Note on Sums of Greatest (Least) Prime Factors

A Note on Sums of Greatest (Least) Prime Factors It. J. Cotemp. Math. Scieces, Vol. 8, 203, o. 9, 423-432 HIKARI Ltd, www.m-hikari.com A Note o Sums of Greatest (Least Prime Factors Rafael Jakimczuk Divisio Matemática, Uiversidad Nacioal de Luá Bueos

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

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

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

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

Permutations, the Parity Theorem, and Determinants

Permutations, the Parity Theorem, and Determinants 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 2 2.1 Traspositios 4 3 Orbits

More information

Infinite Sequences and Series

Infinite Sequences and Series CHAPTER 4 Ifiite Sequeces ad Series 4.1. Sequeces A sequece is a ifiite ordered list of umbers, for example the sequece of odd positive itegers: 1, 3, 5, 7, 9, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29...

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

Factors of sums of powers of binomial coefficients

Factors of sums of powers of binomial coefficients ACTA ARITHMETICA LXXXVI.1 (1998) Factors of sums of powers of biomial coefficiets by Neil J. Cali (Clemso, S.C.) Dedicated to the memory of Paul Erdős 1. Itroductio. It is well ow that if ( ) a f,a = the

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

CS103A Handout 23 Winter 2002 February 22, 2002 Solving Recurrence Relations

CS103A Handout 23 Winter 2002 February 22, 2002 Solving Recurrence Relations CS3A Hadout 3 Witer 00 February, 00 Solvig Recurrece Relatios Itroductio A wide variety of recurrece problems occur i models. Some of these recurrece relatios ca be solved usig iteratio or some other ad

More information

Kevin James. MTHSC 412 Section 2.4 Prime Factors and Greatest Comm

Kevin James. MTHSC 412 Section 2.4 Prime Factors and Greatest Comm MTHSC 412 Section 2.4 Prime Factors and Greatest Common Divisor Greatest Common Divisor Definition Suppose that a, b Z. Then we say that d Z is a greatest common divisor (gcd) of a and b if the following

More information

Repeating Decimals are decimal numbers that have number(s) after the decimal point that repeat in a pattern.

Repeating Decimals are decimal numbers that have number(s) after the decimal point that repeat in a pattern. 5.5 Fractios ad Decimals Steps for Chagig a Fractio to a Decimal. Simplify the fractio, if possible. 2. Divide the umerator by the deomiator. d d Repeatig Decimals Repeatig Decimals are decimal umbers

More information

2-3 The Remainder and Factor Theorems

2-3 The Remainder and Factor Theorems - The Remaider ad Factor Theorems Factor each polyomial completely usig the give factor ad log divisio 1 x + x x 60; x + So, x + x x 60 = (x + )(x x 15) Factorig the quadratic expressio yields x + x x

More information

Cooley-Tukey. Tukey FFT Algorithms. FFT Algorithms. Cooley

Cooley-Tukey. Tukey FFT Algorithms. FFT Algorithms. Cooley Cooley Cooley-Tuey Tuey FFT Algorithms FFT Algorithms Cosider a legth- sequece x[ with a -poit DFT X[ where Represet the idices ad as +, +, Cooley Cooley-Tuey Tuey FFT Algorithms FFT Algorithms Usig these

More information

Lecture 5: Span, linear independence, bases, and dimension

Lecture 5: Span, linear independence, bases, and dimension Lecture 5: Spa, liear idepedece, bases, ad dimesio Travis Schedler Thurs, Sep 23, 2010 (versio: 9/21 9:55 PM) 1 Motivatio Motivatio To uderstad what it meas that R has dimesio oe, R 2 dimesio 2, etc.;

More information

Here are a couple of warnings to my students who may be here to get a copy of what happened on a day that you missed.

Here are a couple of warnings to my students who may be here to get a copy of what happened on a day that you missed. This documet was writte ad copyrighted by Paul Dawkis. Use of this documet ad its olie versio is govered by the Terms ad Coditios of Use located at http://tutorial.math.lamar.edu/terms.asp. The olie versio

More information

Chapter 6: Variance, the law of large numbers and the Monte-Carlo method

Chapter 6: Variance, the law of large numbers and the Monte-Carlo method Chapter 6: Variace, the law of large umbers ad the Mote-Carlo method Expected value, variace, ad Chebyshev iequality. If X is a radom variable recall that the expected value of X, E[X] is the average value

More information

Notes on exponential generating functions and structures.

Notes on exponential generating functions and structures. Notes o expoetial geeratig fuctios ad structures. 1. The cocept of a structure. Cosider the followig coutig problems: (1) to fid for each the umber of partitios of a -elemet set, (2) to fid for each the

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

Math 114- Intermediate Algebra Integral Exponents & Fractional Exponents (10 )

Math 114- Intermediate Algebra Integral Exponents & Fractional Exponents (10 ) Math 4 Math 4- Itermediate Algebra Itegral Epoets & Fractioal Epoets (0 ) Epoetial Fuctios Epoetial Fuctios ad Graphs I. Epoetial Fuctios The fuctio f ( ) a, where is a real umber, a 0, ad a, is called

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

GCE Further Mathematics (6360) Further Pure Unit 2 (MFP2) Textbook. Version: 1.4

GCE Further Mathematics (6360) Further Pure Unit 2 (MFP2) Textbook. Version: 1.4 GCE Further Mathematics (660) Further Pure Uit (MFP) Tetbook Versio: 4 MFP Tetbook A-level Further Mathematics 660 Further Pure : Cotets Chapter : Comple umbers 4 Itroductio 5 The geeral comple umber 5

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

Tangent circles in the ratio 2 : 1. Hiroshi Okumura and Masayuki Watanabe. In this article we consider the following old Japanese geometry problem

Tangent circles in the ratio 2 : 1. Hiroshi Okumura and Masayuki Watanabe. In this article we consider the following old Japanese geometry problem 116 Taget circles i the ratio 2 : 1 Hiroshi Okumura ad Masayuki Wataabe I this article we cosider the followig old Japaese geometry problem (see Figure 1), whose statemet i [1, p. 39] is missig the coditio

More information

THE LEAST COMMON MULTIPLE OF A QUADRATIC SEQUENCE

THE LEAST COMMON MULTIPLE OF A QUADRATIC SEQUENCE THE LEAST COMMON MULTIPLE OF A QUADRATIC SEQUENCE JAVIER CILLERUELO Abstract. We obtai, for ay irreducible quadratic olyomial f(x = ax 2 + bx + c, the asymtotic estimate log l.c.m. {f(1,..., f(} log. Whe

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

I. Chi-squared Distributions

I. Chi-squared Distributions 1 M 358K Supplemet to Chapter 23: CHI-SQUARED DISTRIBUTIONS, T-DISTRIBUTIONS, AND DEGREES OF FREEDOM To uderstad t-distributios, we first eed to look at aother family of distributios, the chi-squared distributios.

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

I. GROUPS: BASIC DEFINITIONS AND EXAMPLES

I. GROUPS: BASIC DEFINITIONS AND EXAMPLES I GROUPS: BASIC DEFINITIONS AND EXAMPLES Definition 1: An operation on a set G is a function : G G G Definition 2: A group is a set G which is equipped with an operation and a special element e G, called

More information

SEQUENCES AND SERIES

SEQUENCES AND SERIES Chapter 9 SEQUENCES AND SERIES Natural umbers are the product of huma spirit. DEDEKIND 9.1 Itroductio I mathematics, the word, sequece is used i much the same way as it is i ordiary Eglish. Whe we say

More information

4. Trees. 4.1 Basics. Definition: A graph having no cycles is said to be acyclic. A forest is an acyclic graph.

4. Trees. 4.1 Basics. Definition: A graph having no cycles is said to be acyclic. A forest is an acyclic graph. 4. Trees Oe of the importat classes of graphs is the trees. The importace of trees is evidet from their applicatios i various areas, especially theoretical computer sciece ad molecular evolutio. 4.1 Basics

More information

Irreducible polynomials with consecutive zero coefficients

Irreducible polynomials with consecutive zero coefficients Irreducible polyomials with cosecutive zero coefficiets Theodoulos Garefalakis Departmet of Mathematics, Uiversity of Crete, 71409 Heraklio, Greece Abstract Let q be a prime power. We cosider the problem

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

S. Tanny MAT 344 Spring 1999. be the minimum number of moves required.

S. Tanny MAT 344 Spring 1999. be the minimum number of moves required. S. Tay MAT 344 Sprig 999 Recurrece Relatios Tower of Haoi Let T be the miimum umber of moves required. T 0 = 0, T = 7 Iitial Coditios * T = T + $ T is a sequece (f. o itegers). Solve for T? * is a recurrece,

More information

Math 319 Problem Set #3 Solution 21 February 2002

Math 319 Problem Set #3 Solution 21 February 2002 Math 319 Problem Set #3 Solution 21 February 2002 1. ( 2.1, problem 15) Find integers a 1, a 2, a 3, a 4, a 5 such that every integer x satisfies at least one of the congruences x a 1 (mod 2), x a 2 (mod

More information

On Formula to Compute Primes. and the n th Prime

On Formula to Compute Primes. and the n th Prime Applied Mathematical cieces, Vol., 0, o., 35-35 O Formula to Compute Primes ad the th Prime Issam Kaddoura Lebaese Iteratioal Uiversity Faculty of Arts ad cieces, Lebao issam.kaddoura@liu.edu.lb amih Abdul-Nabi

More information

INFINITE SERIES KEITH CONRAD

INFINITE SERIES KEITH CONRAD INFINITE SERIES KEITH CONRAD. Itroductio The two basic cocepts of calculus, differetiatio ad itegratio, are defied i terms of limits (Newto quotiets ad Riema sums). I additio to these is a third fudametal

More information

Lecture 4: Cheeger s Inequality

Lecture 4: Cheeger s Inequality Spectral Graph Theory ad Applicatios WS 0/0 Lecture 4: Cheeger s Iequality Lecturer: Thomas Sauerwald & He Su Statemet of Cheeger s Iequality I this lecture we assume for simplicity that G is a d-regular

More information

Solutions to Exercises Chapter 4: Recurrence relations and generating functions

Solutions to Exercises Chapter 4: Recurrence relations and generating functions Solutios to Exercises Chapter 4: Recurrece relatios ad geeratig fuctios 1 (a) There are seatig positios arraged i a lie. Prove that the umber of ways of choosig a subset of these positios, with o two chose

More information

How Euler Did It. In a more modern treatment, Hardy and Wright [H+W] state this same theorem as. n n+ is perfect.

How Euler Did It. In a more modern treatment, Hardy and Wright [H+W] state this same theorem as. n n+ is perfect. Amicable umbers November 005 How Euler Did It by Ed Sadifer Six is a special umber. It is divisible by, ad 3, ad, i what at first looks like a strage coicidece, 6 = + + 3. The umber 8 shares this remarkable

More information

Sampling Distribution And Central Limit Theorem

Sampling Distribution And Central Limit Theorem () Samplig Distributio & Cetral Limit Samplig Distributio Ad Cetral Limit Samplig distributio of the sample mea If we sample a umber of samples (say k samples where k is very large umber) each of size,

More information

FOUNDATIONS OF MATHEMATICS AND PRE-CALCULUS GRADE 10

FOUNDATIONS OF MATHEMATICS AND PRE-CALCULUS GRADE 10 FOUNDATIONS OF MATHEMATICS AND PRE-CALCULUS GRADE 10 [C] Commuicatio Measuremet A1. Solve problems that ivolve liear measuremet, usig: SI ad imperial uits of measure estimatio strategies measuremet strategies.

More information

Basic Elements of Arithmetic Sequences and Series

Basic Elements of Arithmetic Sequences and Series MA40S PRE-CALCULUS UNIT G GEOMETRIC SEQUENCES CLASS NOTES (COMPLETED NO NEED TO COPY NOTES FROM OVERHEAD) Basic Elemets of Arithmetic Sequeces ad Series Objective: To establish basic elemets of arithmetic

More information

Section 11.3: The Integral Test

Section 11.3: The Integral Test Sectio.3: The Itegral Test Most of the series we have looked at have either diverged or have coverged ad we have bee able to fid what they coverge to. I geeral however, the problem is much more difficult

More information

Overview of some probability distributions.

Overview of some probability distributions. Lecture Overview of some probability distributios. I this lecture we will review several commo distributios that will be used ofte throughtout the class. Each distributio is usually described by its probability

More information

CHAPTER 5. Number Theory. 1. Integers and Division. Discussion

CHAPTER 5. Number Theory. 1. Integers and Division. Discussion CHAPTER 5 Number Theory 1. Integers and Division 1.1. Divisibility. Definition 1.1.1. Given two integers a and b we say a divides b if there is an integer c such that b = ac. If a divides b, we write a

More information

UC Berkeley Department of Electrical Engineering and Computer Science. EE 126: Probablity and Random Processes. Solutions 9 Spring 2006

UC Berkeley Department of Electrical Engineering and Computer Science. EE 126: Probablity and Random Processes. Solutions 9 Spring 2006 Exam format UC Bereley Departmet of Electrical Egieerig ad Computer Sciece EE 6: Probablity ad Radom Processes Solutios 9 Sprig 006 The secod midterm will be held o Wedesday May 7; CHECK the fial exam

More information

Integer Factorization Algorithms

Integer Factorization Algorithms Iteger Factorizatio Algorithms Coelly Bares Departmet of Physics, Orego State Uiversity December 7, 004 This documet has bee placed i the public domai. Cotets I. Itroductio 3 1. Termiology 3. Fudametal

More information

EXAMENSARBETEN I MATEMATIK

EXAMENSARBETEN I MATEMATIK EXAMENSARBETEN I MATEMATIK MATEMATISKA INSTITUTIONEN, STOCKHOLMS UNIVERSITET The udeiable charm of iequalities Proofs, solutios ad additioal problems av Patri Friggebo 004 - No MATEMATISKA INSTITUTIONEN,

More information

Class Meeting # 16: The Fourier Transform on R n

Class Meeting # 16: The Fourier Transform on R n MATH 18.152 COUSE NOTES - CLASS MEETING # 16 18.152 Itroductio to PDEs, Fall 2011 Professor: Jared Speck Class Meetig # 16: The Fourier Trasform o 1. Itroductio to the Fourier Trasform Earlier i the course,

More information

.04. This means $1000 is multiplied by 1.02 five times, once for each of the remaining sixmonth

.04. This means $1000 is multiplied by 1.02 five times, once for each of the remaining sixmonth Questio 1: What is a ordiary auity? Let s look at a ordiary auity that is certai ad simple. By this, we mea a auity over a fixed term whose paymet period matches the iterest coversio period. Additioally,

More information

MATH10040 Chapter 2: Prime and relatively prime numbers

MATH10040 Chapter 2: Prime and relatively prime numbers MATH10040 Chapter 2: Prime and relatively prime numbers Recall the basic definition: 1. Prime numbers Definition 1.1. Recall that a positive integer is said to be prime if it has precisely two positive

More information

Elementary Number Theory and Methods of Proof. CSE 215, Foundations of Computer Science Stony Brook University http://www.cs.stonybrook.

Elementary Number Theory and Methods of Proof. CSE 215, Foundations of Computer Science Stony Brook University http://www.cs.stonybrook. Elementary Number Theory and Methods of Proof CSE 215, Foundations of Computer Science Stony Brook University http://www.cs.stonybrook.edu/~cse215 1 Number theory Properties: 2 Properties of integers (whole

More information

A Recursive Formula for Moments of a Binomial Distribution

A Recursive Formula for Moments of a Binomial Distribution A Recursive Formula for Momets of a Biomial Distributio Árpád Béyi beyi@mathumassedu, Uiversity of Massachusetts, Amherst, MA 01003 ad Saverio M Maago smmaago@psavymil Naval Postgraduate School, Moterey,

More information

Discrete Mathematics, Chapter 4: Number Theory and Cryptography

Discrete Mathematics, Chapter 4: Number Theory and Cryptography Discrete Mathematics, Chapter 4: Number Theory and Cryptography Richard Mayr University of Edinburgh, UK Richard Mayr (University of Edinburgh, UK) Discrete Mathematics. Chapter 4 1 / 35 Outline 1 Divisibility

More information

Analysis Notes (only a draft, and the first one!)

Analysis Notes (only a draft, and the first one!) Aalysis Notes (oly a draft, ad the first oe!) Ali Nesi Mathematics Departmet Istabul Bilgi Uiversity Kuştepe Şişli Istabul Turkey aesi@bilgi.edu.tr Jue 22, 2004 2 Cotets 1 Prelimiaries 9 1.1 Biary Operatio...........................

More information

Engineering 323 Beautiful Homework Set 3 1 of 7 Kuszmar Problem 2.51

Engineering 323 Beautiful Homework Set 3 1 of 7 Kuszmar Problem 2.51 Egieerig 33 eautiful Homewor et 3 of 7 Kuszmar roblem.5.5 large departmet store sells sport shirts i three sizes small, medium, ad large, three patters plaid, prit, ad stripe, ad two sleeve legths log

More information

7.1 Finding Rational Solutions of Polynomial Equations

7.1 Finding Rational Solutions of Polynomial Equations 4 Locker LESSON 7. Fidig Ratioal Solutios of Polyomial Equatios Name Class Date 7. Fidig Ratioal Solutios of Polyomial Equatios Essetial Questio: How do you fid the ratioal roots of a polyomial equatio?

More information

Elementary Theory of Russian Roulette

Elementary Theory of Russian Roulette Elemetary Theory of Russia Roulette -iterestig patters of fractios- Satoshi Hashiba Daisuke Miematsu Ryohei Miyadera Itroductio. Today we are goig to study mathematical theory of Russia roulette. If some

More information

5: Introduction to Estimation

5: Introduction to Estimation 5: Itroductio to Estimatio Cotets Acroyms ad symbols... 1 Statistical iferece... Estimatig µ with cofidece... 3 Samplig distributio of the mea... 3 Cofidece Iterval for μ whe σ is kow before had... 4 Sample

More information

Chapter 7 Methods of Finding Estimators

Chapter 7 Methods of Finding Estimators Chapter 7 for BST 695: Special Topics i Statistical Theory. Kui Zhag, 011 Chapter 7 Methods of Fidig Estimators Sectio 7.1 Itroductio Defiitio 7.1.1 A poit estimator is ay fuctio W( X) W( X1, X,, X ) of

More information

Hypothesis testing. Null and alternative hypotheses

Hypothesis testing. Null and alternative hypotheses Hypothesis testig Aother importat use of samplig distributios is to test hypotheses about populatio parameters, e.g. mea, proportio, regressio coefficiets, etc. For example, it is possible to stipulate

More information

Notes on Combinatorics. Peter J. Cameron

Notes on Combinatorics. Peter J. Cameron Notes o Combiatorics Peter J Camero ii Preface: What is Combiatorics? Combiatorics, the mathematics of patters,, helps us desig computer etwors, crac security codes, or solve sudous Ursula Marti, Vice-Pricipal

More information

Incremental calculation of weighted mean and variance

Incremental calculation of weighted mean and variance Icremetal calculatio of weighted mea ad variace Toy Fich faf@cam.ac.uk dot@dotat.at Uiversity of Cambridge Computig Service February 009 Abstract I these otes I eplai how to derive formulae for umerically

More information

Theorems About Power Series

Theorems About Power Series Physics 6A Witer 20 Theorems About Power Series Cosider a power series, f(x) = a x, () where the a are real coefficiets ad x is a real variable. There exists a real o-egative umber R, called the radius

More information

Lecture 4: Cauchy sequences, Bolzano-Weierstrass, and the Squeeze theorem

Lecture 4: Cauchy sequences, Bolzano-Weierstrass, and the Squeeze theorem Lecture 4: Cauchy sequeces, Bolzao-Weierstrass, ad the Squeeze theorem The purpose of this lecture is more modest tha the previous oes. It is to state certai coditios uder which we are guarateed that limits

More information

NATIONAL SENIOR CERTIFICATE GRADE 12

NATIONAL SENIOR CERTIFICATE GRADE 12 NATIONAL SENIOR CERTIFICATE GRADE MATHEMATICS P EXEMPLAR 04 MARKS: 50 TIME: 3 hours This questio paper cosists of 8 pages ad iformatio sheet. Please tur over Mathematics/P DBE/04 NSC Grade Eemplar INSTRUCTIONS

More information

CONTINUED FRACTIONS AND PELL S EQUATION. Contents 1. Continued Fractions 1 2. Solution to Pell s Equation 9 References 12

CONTINUED FRACTIONS AND PELL S EQUATION. Contents 1. Continued Fractions 1 2. Solution to Pell s Equation 9 References 12 CONTINUED FRACTIONS AND PELL S EQUATION SEUNG HYUN YANG Abstract. In this REU paper, I will use some important characteristics of continued fractions to give the complete set of solutions to Pell s equation.

More information

15 Prime and Composite Numbers

15 Prime and Composite Numbers 15 Prime and Composite Numbers Divides, Divisors, Factors, Multiples In section 13, we considered the division algorithm: If a and b are whole numbers with b 0 then there exist unique numbers q and r such

More information

Definition. A variable X that takes on values X 1, X 2, X 3,...X k with respective frequencies f 1, f 2, f 3,...f k has mean

Definition. A variable X that takes on values X 1, X 2, X 3,...X k with respective frequencies f 1, f 2, f 3,...f k has mean 1 Social Studies 201 October 13, 2004 Note: The examples i these otes may be differet tha used i class. However, the examples are similar ad the methods used are idetical to what was preseted i class.

More information

Lecture 13. Lecturer: Jonathan Kelner Scribe: Jonathan Pines (2009)

Lecture 13. Lecturer: Jonathan Kelner Scribe: Jonathan Pines (2009) 18.409 A Algorithmist s Toolkit October 27, 2009 Lecture 13 Lecturer: Joatha Keler Scribe: Joatha Pies (2009) 1 Outlie Last time, we proved the Bru-Mikowski iequality for boxes. Today we ll go over the

More information

MATH 083 Final Exam Review

MATH 083 Final Exam Review MATH 08 Fial Eam Review Completig the problems i this review will greatly prepare you for the fial eam Calculator use is ot required, but you are permitted to use a calculator durig the fial eam period

More information

1 Computing the Standard Deviation of Sample Means

1 Computing the Standard Deviation of Sample Means Computig the Stadard Deviatio of Sample Meas Quality cotrol charts are based o sample meas ot o idividual values withi a sample. A sample is a group of items, which are cosidered all together for our aalysis.

More information

5 Boolean Decision Trees (February 11)

5 Boolean Decision Trees (February 11) 5 Boolea Decisio Trees (February 11) 5.1 Graph Coectivity Suppose we are give a udirected graph G, represeted as a boolea adjacecy matrix = (a ij ), where a ij = 1 if ad oly if vertices i ad j are coected

More information

Taking DCOP to the Real World: Efficient Complete Solutions for Distributed Multi-Event Scheduling

Taking DCOP to the Real World: Efficient Complete Solutions for Distributed Multi-Event Scheduling Taig DCOP to the Real World: Efficiet Complete Solutios for Distributed Multi-Evet Schedulig Rajiv T. Maheswara, Milid Tambe, Emma Bowrig, Joatha P. Pearce, ad Pradeep araatham Uiversity of Souther Califoria

More information

BINOMIAL EXPANSIONS 12.5. In this section. Some Examples. Obtaining the Coefficients

BINOMIAL EXPANSIONS 12.5. In this section. Some Examples. Obtaining the Coefficients 652 (12-26) Chapter 12 Sequeces ad Series 12.5 BINOMIAL EXPANSIONS I this sectio Some Examples Otaiig the Coefficiets The Biomial Theorem I Chapter 5 you leared how to square a iomial. I this sectio you

More information

GCDs and Relatively Prime Numbers! CSCI 2824, Fall 2014!

GCDs and Relatively Prime Numbers! CSCI 2824, Fall 2014! GCDs and Relatively Prime Numbers! CSCI 2824, Fall 2014!!! Challenge Problem 2 (Mastermind) due Fri. 9/26 Find a fourth guess whose scoring will allow you to determine the secret code (repetitions are

More information

Ekkehart Schlicht: Economic Surplus and Derived Demand

Ekkehart Schlicht: Economic Surplus and Derived Demand Ekkehart Schlicht: Ecoomic Surplus ad Derived Demad Muich Discussio Paper No. 2006-17 Departmet of Ecoomics Uiversity of Muich Volkswirtschaftliche Fakultät Ludwig-Maximilias-Uiversität Müche Olie at http://epub.ub.ui-mueche.de/940/

More information

0.7 0.6 0.2 0 0 96 96.5 97 97.5 98 98.5 99 99.5 100 100.5 96.5 97 97.5 98 98.5 99 99.5 100 100.5

0.7 0.6 0.2 0 0 96 96.5 97 97.5 98 98.5 99 99.5 100 100.5 96.5 97 97.5 98 98.5 99 99.5 100 100.5 Sectio 13 Kolmogorov-Smirov test. Suppose that we have a i.i.d. sample X 1,..., X with some ukow distributio P ad we would like to test the hypothesis that P is equal to a particular distributio P 0, i.e.

More information

Solutions to Selected Problems In: Pattern Classification by Duda, Hart, Stork

Solutions to Selected Problems In: Pattern Classification by Duda, Hart, Stork Solutios to Selected Problems I: Patter Classificatio by Duda, Hart, Stork Joh L. Weatherwax February 4, 008 Problem Solutios Chapter Bayesia Decisio Theory Problem radomized rules Part a: Let Rx be the

More information

THE REGRESSION MODEL IN MATRIX FORM. For simple linear regression, meaning one predictor, the model is. for i = 1, 2, 3,, n

THE REGRESSION MODEL IN MATRIX FORM. For simple linear regression, meaning one predictor, the model is. for i = 1, 2, 3,, n We will cosider the liear regressio model i matrix form. For simple liear regressio, meaig oe predictor, the model is i = + x i + ε i for i =,,,, This model icludes the assumptio that the ε i s are a sample

More information

SUM OF TWO SQUARES JAHNAVI BHASKAR

SUM OF TWO SQUARES JAHNAVI BHASKAR SUM OF TWO SQUARES JAHNAVI BHASKAR Abstract. I will investigate which numbers can be written as the sum of two squares and in how many ways, providing enough basic number theory so even the unacquainted

More information

MATH 289 PROBLEM SET 4: NUMBER THEORY

MATH 289 PROBLEM SET 4: NUMBER THEORY MATH 289 PROBLEM SET 4: NUMBER THEORY 1. The greatest common divisor If d and n are integers, then we say that d divides n if and only if there exists an integer q such that n = qd. Notice that if d divides

More information

Descriptive Statistics

Descriptive Statistics Descriptive Statistics We leared to describe data sets graphically. We ca also describe a data set umerically. Measures of Locatio Defiitio The sample mea is the arithmetic average of values. We deote

More information

The Prime Numbers. Definition. A prime number is a positive integer with exactly two positive divisors.

The Prime Numbers. Definition. A prime number is a positive integer with exactly two positive divisors. The Prime Numbers Before starting our study of primes, we record the following important lemma. Recall that integers a, b are said to be relatively prime if gcd(a, b) = 1. Lemma (Euclid s Lemma). If gcd(a,

More information