In proof by contradiction, you assume your statement is not true, and then. A prime number or a prime is a natural number greater than 1 that cannot be formed by multiplying two smaller natural numbers. We proceed by contradiction, and so we assume that there are finitely many primes. There are no natural number solutions to the equation x2 y2 1. However, since n2 must also have an even number of prime factors, and 2 is a prime number, 2n2 must have an odd number of prime factors. Negating the two propositions, the statement we want to prove has the form. Proposition there are infinitely many prime numbers. We now introduce a third method of proof, called proof by contra diction. This conditional statement being false means there exist numbers a and b for which a,b. The difference of any rational number and any irrational number is irrational. A prime number is a positive integer which has no positive integer factors other than 1 and itself. If p is nite, then by the proposition, p is not the set of all primes. Now any square number x2 must have an even number of prime factors. Proof of the prime number theorem joel spencer and ronald graham p rime numbers are the atoms of our mathematical universe.
Chapter 17 proof by contradiction this chapter covers proofby contradiction. If p is a prime number bigger than 2, then p is odd. A level maths new specification proof by contradiction answers. The proof well give dates back to euclid, and our version of his proof uses one of the oldest tricks in the book and the book. In this paper, i will demonstrate an important fact about the zeros of the zeta function, and how it relates to the prime number theorem. Mat231 transition to higher math proof by contradiction fall 2014 9 12. Letting pn denote the number of primes p b n, gauss conjectured in the early.
This proof does not require any deep knowledge of the prime numbers, and it does not require any di. Notes for lecture 3 1 there are infinitely many primes people. Simple proof of the prime number theorem january 20, 2015 2. This is euclids proof that there are infinitely many prime numbers, and does indeed work by contradiction. This statement is a good candidate for proof by contradiction since we could not check all possible rational numbers to demonstrate that none has a square root. Proof by contradiction also known as indirect proof or the method of reductio ad absurdum is a common proof technique that is based on a very simple principle. Every positive integer can be written as a product of primes possibly with repetition and any such expression is unique up to a permutation of the prime factors. Zagier dedicated to the prime number theorem on the occasion of its 100th birthday the prime number theorem, that the number of primes 1 that is not prime factors in a unique way into a nondecreasing product of primes. Prime numbers number theory is the mathematical study of the natural numbers, the positive whole numbers such as 2, 17, and 123. The distribution of prime numbers andrew granville. These are often particularly well suited to proof by contradiction as the negation of the statement is 9xpx so all that is necessary to complete the proof is to assume there is an x that makes.
Since 2 is a prime number, the list of p is is nonempty. Therefore, a can be represented as the ratio of two integers. Assume there are a finite number of prime numbers, that we write as. The hypothesis is false, therefore the statement is vacuously true even though the conclusion is also false. Shorser the following proof is attributed to eulclid c. Infinitely many primes one of the first proofs by contradiction is the following gem attributed to euclid. If n were prime, it would have an obvious prime factorization n n. I need to prove there are infinite many prime number by contradiction. Maybe i wrote the contradiction wrong, but i thought it came out to. Version 1 suppose that c nis a bounded sequence of. A prime number is a number that has exactly two divisors. We take the negation of the theorem and suppose it to be true.
Recall that a positive integer is said to be prime if it has precisely two positive divisors which are necessarily 1 and the number itself an integer greater than 1. In a previous video, we used a proof by contradiction to show that the square root of 2 is irrational. In such a proof, we assume the opposite of what we. Read the proof of the irrationality of the square root of 2 in the introduction for an example. So this is a good situation for applying proof by contradiction. Assume that there is an integer that does not have a prime factorization. In the 17th century, proofs by contradiction became the focus of attention. Hardy described proof by contradiction as one of a mathematicians finest weapons, saying it is a far finer gambit than any. This proof, and consequently knowledge of the existence of irrational numbers, apparently dates back to the greek philosopher hippasus in the 5th century bc. A prime number is a natural number with exactly two distinct divisors.
If you are trying to factor a number n, you do not need to try dividing by all the numbers from 1 to n. This is a proof by contradiction, and it is based on the prime factorization of a. The zeta function and its relation to the prime number theorem ben rifferreinert abstract. Proof by contradiction is also known as indirect proof, proof by assuming the opposite, and reductio ad impossibile.
Euclid described in his elements, an ancient greek proof that. Proof by contradiction means that you take a statements negation as a starting point, and find a contradiction. This new method is not limited to proving just conditional statements it can be used to prove any kind of statement whatsoever. Here is an example of a simple theorem and a simple direct proof. Proof that there are infinitely many prime numbers euclid. This contradicts the assumption that q is the smallest positive rational number. Its a principle that is reminiscent of the philosophy of a certain fictional detective. Proof by contradiction is often the most natural way to prove the converse of an already proved theorem. This method of proof was so well established in greek mathematics that many of euclids theorems and most of archimedes important results were proved by contradiction. As far as this proof is concerned, for all we know, both composite and prime numbers could be.
One of the oldest mathematical proofs, which goes all the way back to euclid, is a proof by contradiction. Whenever we have assumptions stating the existence. The volume opens with perhaps the most famous proof in mathematics. Let p be a finite set whose elements are prime numbers. The theorem could be restated as there is no largest prime or there is no finite list of all primes. The converse of the pythagorean theorem the pythagorean theorem tells us that in a right triangle, there is a simple relation between the two leg lengths a and b and the hypotenuse length, c, of a right triangle. Assume that there is an integer that does not have a prime fac torization. If a friend says the primes are not infinite theres the contradiction, then you could say. Proof by contradiction we now introduce a third method of proof, called proof by contra. Assume we have a set of finitely many primes of the form. Pdf we present a new simple proof of the infinitude of primes. Basic proof techniques washington university in st. This video proves that there are infinitely many prime numbers, using proof by contradiction. For the sake of contradiction, suppose there are only.
Proof by contradiction often works well in proving statements of the form. This is a contradiction, since we claimed that m 2 2n, and no number can have both an even number of prime factors and an odd number of prime factors. The idea of proof by contradiction is quite ancient, and goes back at least as far as. A natural number greater than 1 that is not prime is called a composite number. I also dont really understand how to do these cases using contradiction. What i want to do in this video is essentially use the same argument but do it in a more general way to show that the square root of any prime number is irrational. On the analysis of indirect proofs example 1 let x be an integer. Recall that a prime number is an integer n, greater than 1, such that the only positive integers that evenly divide n are 1 and n.
A primary focus of number theory is the study of prime numbers, which can be. Helena mcgahagan lemma every integer n 1 has a prime factorization. Proof by contradiction california state university, fresno. One of the best known examples of proof by contradiction is the provof that 2 is irrational. But the previous lemma says that every number greater than 1 is divisible by a prime. In proof by contradiction, we show that a claim p is true by showing that its negation p. Convergence theorems the rst theorem below has more obvious relevance to dirichlet series, but the second version is what we will use to prove the prime number theorem. It is a particular kind of the more general form of argument known as reductio ad absurdum. This is the simplest and easiest method of proof available to us. Proof techniques stanford university computer science. Chapter 6 proof by contradiction mcgill university.
1006 430 898 29 705 1269 203 1487 107 733 59 584 1300 826 1495 1517 907 296 671 344 758 1267 596 709 207 499 691 1271 592 1481 586 751