Study%20Tips.1doc - The Euclidean Algorithm and its uses...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
Study Tips (Midterm I) 1. “Proof” vaaaaaar. .... (bu ders boyle, ama ileride cok faydasini goreceksiniz, gercekten) 2. Make sure that you know/understand; The algorithms we have covered What “complexity” means, how one finds a O- estimate for it What we mean by “growth of a function” Prime numbers, their properties That, “every integer >1 has a prime factor”, and why it is so. The division algorithm and why it works
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

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.

Ask a homework question - tutors are online