HomeClass Notes1,200,000AU40,000

MATH221 Lecture Notes - Lecture 4: Becquerel, Natural Number, Euclidean Algorithm

50 views3 pages

periwinklecheetah866

10 Aug 2018

School

Department

Course

Professor

For unlimited access to Class Notes, a Class+ subscription is required.

Document Summary

Quotient-remainder theorem (qrt): if n and d > 0 are both integers, then there exist unique integers q and r such that n = dq + r and 0 r < d. Greatest common divisors (gcd): let a, b with at least one of a or b nonzero. * can use prime factorization to calculate gcd i. e. given 3320 = 22 * 5 * 7 * 11 and 1155 = 3 * 5 * 7 * 11, gcd(3220, 1166) = 5 * 7 = 35. Least common multiples (lcm): let a, b with at least one of a or b nonzero. The euclidean algorithm can be described as follows: let a > b 0, check whether b = 0. If so, gcd(a, b) = a: if b 0, then se qrt to divide a by b to obtain a = bq + r, where 0 r < b.

Related textbook solutions

Calculus

ISBN: 9781319050733

Single Variable Calculus: Early Transcendentals

4th Edition, 2018

ISBN: 9781337687805

CALCULUS:EARLY TRANSCENDENTALS

ISBN: 9781319050740

Related Documents

MATH221 Lecture Notes - Lecture 3: Well-Order, Logical Equivalence, Binary Operation

periwinklecheetah866

MATH221 Lecture Notes - Lecture 5: Modular Arithmetic, Pigeonhole Principle, Coprime Integers

periwinklecheetah866

MAT102H5 Lecture Notes - Lecture 14: Mathematical Induction, Recursive Definition

cerisegiraffe538

Related Questions

Complete problem 3 using the information above.

Math 151 Sections 34, 35, 36 Workshop 11 ted to arn This workshop deals with an addition formula in section 5.1. This formula is rel oft told story about the great mathematician Gauss. Here is one version of the story When Gauss was ten years old, he attended a certain math class with other kids. One fine day, the math teacher discovered that he was running out of time to grade the latest batch of math homeworks. This is why he decided to finish the grading during his math period. To keep the students busy while he graded, he gave them the following task at th of the period: Use your slate (the small personal blackboard that every student had start in class) to add up the numbers 1,2,3,... , 100 Seconds after the teacher gave this in-class assignment, little Gauss pointed to his slate Here is the answer." Then Gauss did nothing for an hour, while the other students labored with the additions and the teacher graded. At the end of the perioc Gauss showed the correct answer 5050 on his slate. Only Gauss got the correct answer. Then Gauss told everybody that the sum 12 +3.+ 100 is (1+100)+(2+99) + (3498)+ Problem 1. Explain carefully what Gauss had done. Include the reason why it is impor tant that 100 happens to be an even number Problem 2. Let N be an even positive integer. Use the method of Problem 1 to prove the formula 1 +2 +3+.. . +N(N. Include the reason why it is important that N +(50+51) = 101 + 101 +101 + +101-101.50-5050 an even number. Problem 3. The formula is still valid when N is an odd integer. Prove this, using a variation on the argument given by Gauss The story continues: Gauss then gave the class a lecture on how his method could be used to sum an arithmeric series (a +1.b) (a +2.b) (a +3.b)+. (a +N b), where a and b are constants Problem 4. Find a formula for the sum (a+1.b)+ (a+2.b) + (a +3.b)+ +(a+ N.b) Prove this formula the way Gauss would have done it. You have to do the case when N is even and the case when N is odd Now let us consider a fictional alternate history where Gauss had not thought of this very clever trick. We can imagine the ten year old Gauss going home and doing the sequential computations 1+2 1+2+3 1+2+3+4 1+2+3+4+5 and so forth, just to see if he could find a pattern in the sequence of answers. He would have discovered somethin like this: once he had the sum 1+2+3+...+ N, he could simply add N +1 to that sum and that would give him the sum 1+2+3+ + (N +1) very quickly Now ass N(N+1 ume that, by trial and error, Gauss discovered that the formula 1+2+3+ is true for several values of N. How could he prove that the formula is r for ALL N? The insight described in the previous paragraph might have led Gauss to other words, he only needed to show: Formula for 1+2+3+ + N plus N +1 equals formula for 1+2+3++N+1). He would have discovered the principle of mathema -.. + N eally true 1)+1) think the following: All he had to do was prove mm) + (N + 1) NN+1 (N+1)(( In ered the principle of mathematical induction Problem 5. Prove N(N+1) (N + 1 of the formula for 1+2+3+.+N. (Nt1MNHHI) Show how this leads to a uCtion a proof

Problem 3

Math 151 - Sections 34, 35, 36 - Workshop 11 This workshop deals with an addition formula in section 5.1. This formula is related to an ld story about the great mathematician Gauss. Here is one version of the story Wh en Gauss was ten years old, he attended a certain math class with other kids. One fine day, the math teacher discovered that he was running out of time to grade the latest batch of math homeworks. This is why he decided to finish the grading during his math lecture period. To keep the students busy while he graded, he gave them the following task at the start of the period: Use your slate (the small personal blackboard that every student had in class) to add up the numbers 1,2,3,... , 100 Seconds after the teacher gave this in-class assignment, little Gauss pointed to his slate and yelled "Here is the answer." Then Gauss did nothing for an hour, while the other students labored with the additions and the teacher graded. At the end of the period Gauss showed the correct answer 5050 on his slate. Only Gauss got the correct answer Then Gauss told everybody that the sum 1+2+3+ + 100 is ( 1 + 100) + (2+99)+ (2+98)+--+ (50+51) = 101 + 101 + 101 +. . . +10 101. 50-5050 Problem 1. Explain carefully what Gauss had done. Include the reason why it is impor tant that 100 happens to be Problem 2. Let N be an even positive integer. Use the method of Problem 1 to prov the formula 1 +2+3+.+N) be an even number Problem 3. The formula is still valid when N is an odd integer. Prove this, using a variation on the argument given by Gauss The story continues: Gauss then gave the class a lecture on how his method could be used to sum an arithmeric series (a+1.b) + (a+2 b) + (a+3.b)+. + (a + N b), where a and b are constants Problem 4. Find a formula for the sum (a+1.b)+(a+2.b)+ (a +3.b)+(a+ N b) Prove this formula the way Gauss would have done it. You have to do the case when N is even and the case when N is odd Now let us consider a fictional alternate history where Gauss had not thought of this ve clever trick. We can imagine the ten year old Gauss going home and doing the sequential computations 1+2 1+2+3 1+2+3+4 1+2+3+4+5 and so forth, just to see if he could find a pattern in the sequence of answers. He would have discovered somethin like this: once he had the sum 1+2+3++N, he could simply add N+1 to that sum, and that would give him the sum 1+2+3 Now assume that, by trial and error, Gauss discovered that the formula 1+2+3+ +N an even numbe +) Include the reason why it is important that +Â·Â·Â· + (N +1) very quickly is true for several values of N. How could he prove that the formula is really true for ALL N? The insight described in the previous paragraph might have led Gauss to think the following: All he had to do was prove N(N+1) Â± (N + 1) other words, he only needed to show: Formula for 1 + 2+3+.+ N plus N +1 equals formula for 1+2+3+(N+1). He would have discovered the principle of mathematical induction Problem 5. Prove of the formula for 1+2 +3+... + N (N +1)(+1X++1) Show how this leads to a proof N(N+1 N+)

Show transcribed image text

scarletmallard305