Lecture 16(Friday)

# Lecture 16(Friday) - in nitely many primes De ne the prime...

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
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: in nitely many primes De ne 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 non-boolean functions Take care when expressing a proof about a function that returns a non-boolean 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.

### Page1 / 2

Lecture 16(Friday) - in nitely many primes De ne the prime...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online