This preview shows page 1. Sign up to view the full content.
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
This note was uploaded on 03/16/2012 for the course FENS 101 taught by Professor Selçukerdem during the Fall '12 term at Sabancı University.
- Fall '12