A: Proof Flashcards
(5 cards)
1
Q
Proof by deduction
A
Use algebra to come to a conclusion
2
Q
Proof by exhaustion
A
Check every possible case
3
Q
Disproof by counter example
A
Find just one case where the conjecture is invalid
4
Q
Proof by condtradiction
A
Assume the opposite of the conjecture
5
Q
Proof of infinity of primes
A
- Assume finite set of primes
- Let the set be P = P1 x P2 x P3 … x Pn where P is the product of all primes
- Consider N where N = P + 1
- Case 1: N is prime
- N has a factor that is a prime that is bigger than any other prime and not in the set which contradicts the assumption that P is the product of all primes
- Case 2: N is not prime
- N has prime factors as it is not prime
- N does not have any primes in the set P as they will all divide with remainder 1
- N must be divisible by some other prime which contradicts the assumption that P is the product of all primes
- CONTRADICTION therefore assumption is wrong and there are an infinite number of primes