This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: innitely many primes
Dene the prime natural numbers as P = fp P N j p has exactly two distinct divisors in Ng. How do you prove: S : Vn P N; jP j > n It would be nice to have some result R that leads to S . If you could show R A S , and that R is true, then you'd be done. But, out of many elementary results, how do you choose an R? Contradiction will often lead you there. slide 4 nonboolean functions
Take care when expressing a proof about a function that returns a nonboolean value, such as a number: Now prove the following statement (notice that we quantify over x P R, not x P R: is the largest integer
x x . V PR x ; x < x +1 slide 6 ...
View
Full
Document
This note was uploaded on 10/13/2011 for the course COMPUTER S CSC 165 taught by Professor Dannyheap during the Fall '10 term at University of Toronto Toronto.
 Fall '10
 DannyHeap
 Computer Science

Click to edit the document details