Course notes (chap. 1 Number Theory, chap. 2 ... - McGill University
Course notes (chap. 1 Number Theory, chap. 2 ... - McGill University
Course notes (chap. 1 Number Theory, chap. 2 ... - McGill University
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
1.5 Prime numbers<br />
If we want a random prime (Maple rand, isprime) ofagivensize,weuse<br />
the following theorem to estimate the number of integers we must try before<br />
finding a prime. Let π(n) =#{a :0