Unformatted text preview: The Euclidean Algorithm and its uses Some modular arithmetic- what we did in the class and also at the recitation classes What the Fundamental Thm of Arithmetic says, and the proof of it How to prove that there are infinitely may primes How to use the “induction principle” 3. Make sure that you can solve all the assigned exercises and preferably more…....
View Full Document
- Fall '12
- Number Theory, Natural number, Fundamental theorem of arithmetic, thm of arithmetic