proof that √2 is irrational
Assume that the square root of 2 (http://planetmath.org/SquareRootOf2) is rational. Then we can write
√2=ab, |
where a,b∈ℕ and a and b are relatively prime. Then 2=(√2)2=(ab)2=a2b2. Thus, a2=2b2. Therefore, 2∣a2. Since 2 is prime, it must divide a. Then a=2c for some c∈ℕ. Thus, 2b2=a2=(2c)2=4c2, yielding that b2=2c2. Therefore, 2∣b2. Since 2 is prime, it must divide b.
Since 2∣a and 2∣b, we have that a and b are not relatively prime, which contradicts the hypothesis. Hence, the initial assumption
is false. It follows √2 is irrational.
With a little bit of work, this argument can be generalized to any positive integer that is not a square. Let n be such an integer. Then there must exist a prime p and k,m∈ℕ such that n=pkm, where p∤ and is odd. Assume that , where and are relatively prime. Then . Thus, . From the fundamental theorem of arithmetic, it is clear that the maximum powers of that divides and are even. Since is odd and does not divide , the maximum power of that divides is also odd. Thus, the same should be true for . Hence, we have reached a contradiction
and must be irrational.
The same argument can be generalized even more, for example to the case of nonsquare irreducible fractions and to higher order roots.
Title | proof that is irrational |
---|---|
Canonical name | ProofThatsqrt2IsIrrational |
Date of creation | 2013-03-22 12:39:13 |
Last modified on | 2013-03-22 12:39:13 |
Owner | Wkbj79 (1863) |
Last modified by | Wkbj79 (1863) |
Numerical id | 11 |
Author | Wkbj79 (1863) |
Entry type | Proof |
Classification | msc 11J72 |
Related topic | Irrational |
Related topic | Surd |