I was looking at the in Internet now and found in this site a different proof of this fact:
"Another elegant proof:
In 1952, Robert Gauntt, then a freshman at Purdue University, gave the following proof[2].
a 2 = 2b2 cannot have a non-zero solution in integers because the last non-zero digit of a square, written in base 3, must be 1, whereas the last non-zero digit of twice a square is 2."
Interesting! note the "last non-zero digit" part.
This proof would be obvious if we were used to base 3.
Here at cut the knot there is a list of different proofs. Proofs number 4 and 3 (in that order) are the ones I like most. The proofs at cut the knot are also reproduced below:
Proof 4
Following is yet another illuminating proof. As in the standard proof, assume p and q are mutually prime (numbers with no common factors). Their squares are still mutually prime for they are built from the same factors. Therefore, the fraction p 2 /q2 cannot cancel out. In particular, p2 /q2 cannot cancel down to equal 2. Therefore, p2 /q 2 .
Proof 3
Following is another intuitive one [Lasckovich, p. 4]. This one is based on the assertion that every number is uniquely (up to the order of factors) representable as a product of primes. (A prime is a number divisible only by itself and 1.) The fact which is known as The Fundamental Theorem of Arithmetic. Assuming it as an axiom (or a given fact), let (p/q)2 = 2 for some integers p and q. Then p2 = 2q2 . Factor both p and q into a product of primes. p2 is factored into a product of the very same primes as p each taken twice. Therefore, p2 has an even number of prime factors. So does q2 . Therefore, 2q2 has an odd number of prime factors. Contradiction.
Subscribe to:
Post Comments (Atom)
1 comment:
Download The DHE HP PGT Exam Admit Card
National Fertilizers Limited Management Trainee Admit Card 2017
Post a Comment