"Logic and Proofs" Please respond to the following:

Mathematics
Tutor: None Selected Time limit: 1 Day

Choose one type of proof  and describe how it is used to prove a theorem. Provide an example with your response.

Apr 19th, 2015

We are going to use proof by contradiction to show that there are infinitely many primes. Proof by contradiction assumes a theorem is false and then derives something false from it. Thus the theorem must be true. 

Assume there are finitely many primes. Multiply them together and add 1. The result, by the division algorithm, does not have any lesser prime factors. Thus it is prime, but is strictly larger than every prime number. This is a contradiction.

Apr 19th, 2015

Are you studying on the go? Check out our FREE app and post questions on the fly!
Download on the
App Store
...
Apr 19th, 2015
...
Apr 19th, 2015
Dec 5th, 2016
check_circle
Mark as Final Answer
check_circle
Unmark as Final Answer
check_circle
Final Answer

Secure Information

Content will be erased after question is completed.

check_circle
Final Answer