User Name Remember Me? Password

 Math Events Math Events, Competitions, Meetups - Local, Regional, State, National, International

 March 3rd, 2012, 02:16 PM #1 Senior Member   Joined: Feb 2012 Posts: 628 Thanks: 1 A Fermat-esque challenge A little background for those of you who don't know: Fermat's Last Theorem (which has been proven, though the proof is extremely long and complicated) says that there are no integer solutions to the equation if . The challenge: Give an elementary proof that there are no integer solutions to the equation if and is prime. March 7th, 2012, 11:42 AM #2 Senior Member   Joined: Feb 2012 Posts: 628 Thanks: 1 Re: A Fermat-esque challenge A brief summary of my work thus far on the problem: Consider the equation mod p. It is clear that each of the numbers is congruent to either 0 or 1. The only possible combinations that will yield solutions are . However, if the equation is of the form , then we may divide each of the numbers by to produce an equivalent equation and continue the process until at least one of the numbers has no multiples of p left. Thus, we may focus our attention on the case , since the other remaining case is identical without loss of generality. Thus, we may write for some integer k such that y is not divisible by p, and the equation becomes (1) . Observing that either exactly one of is even or all of them are even, we may focus our attention on cases such that exactly one is even, since if all of them are even, we may divide the equation by a factor of to produce an equivalent equation and continue the process until at least one of the numbers is odd. We also notice that the equation is equivalent to a Pythagorean triple since n is even. Since all primitive Pythagorean triples may be written as , where , and u and v are relatively prime and of opposite parity, we note that the equation must be a multiple of a Pythagorean triple. It cannot be an even multiple, because then all of the numbers would be even and we have eliminated this case. Therefore, the hypotenuse must be odd; therefore c is odd. March 8th, 2012, 05:20 PM #3 Senior Member   Joined: Feb 2012 Posts: 628 Thanks: 1 Re: A Fermat-esque challenge Some additional directions to take: Since n is even, we may write . . and March 9th, 2012, 03:18 PM #4 Senior Member   Joined: Feb 2012 Posts: 628 Thanks: 1 Re: A Fermat-esque challenge I actually discovered a new avenue for the case which I had not previously considered. If you look at the equation mod 7, and observe that mod 7 is either -1, 0, or 1, then you come to the conclusion that either (1) all of the numbers are divisible by 7; (2) c is divisible by 7 but a and b are not; (3) c is not divisible by 7 but exactly one of a and b is. In the first case, we may reduce the equation by dividing it by repeatedly until at least one of the numbers is not divisible by 7. In the third case, we will consider the equation (1) , where b is not divisible by 7. We may rearrange the equation to show . Now, 7 cannot divide both and , because then c would be congruent to a, and the second equation would become mod 7, or mod 7, which is absurd. Therefore, divides one of and . If it divides , we have that is an integer. If it divides , we have that is an integer. Assuming the latter, then for some integer m. Hence equation (1) may be written: . Now let us consider the function , which equals 0 at 0 and when , or . The function is decreasing for positive values of x until , or . Then it increases to infinity. Thus, in order to find 2 different values of x (a and c) such that , it must be the case that , and . March 12th, 2012, 09:57 AM #5 Senior Member   Joined: Feb 2012 Posts: 628 Thanks: 1 Re: A Fermat-esque challenge If you can prove that no Pythagorean triple consists of three nth powers, then you will have shown that has no solutions in integers, since we have , which means must be a Pythagorean triple. Tags challenge, fermatesque Thread Tools Show Printable Version Email this Page Display Modes Linear Mode Switch to Hybrid Mode Switch to Threaded Mode Similar Threads Thread Thread Starter Forum Replies Last Post fafa Number Theory 4 July 10th, 2013 11:25 AM victorsorokin Number Theory 84 May 23rd, 2012 03:23 PM xfaisalx Number Theory 2 July 25th, 2010 04:59 AM fakesmile Calculus 0 June 2nd, 2009 05:36 AM circum Number Theory 1 June 15th, 2008 05:20 PM

 Contact - Home - Forums - Cryptocurrency Forum - Top

Copyright © 2019 My Math Forum. All rights reserved.      