
#1
Aug707, 01:44 PM

P: 291

Consider the Diophantine equation:
[tex]y^3 = x^2 + 2[/tex] Without using rational elliptic curves and unique factorization in [tex]\mathbb{Z}[\sqrt{2}][/tex] how many different ways can you show that this equation has only a single solution. Historical question: Who was the mathematician who created the concept of UFD? I think it was Leopold Kroneckor, am I correct? 



#3
Aug907, 07:04 AM

P: 891

I narrowed it down to proving that the equation [tex]y^327 = x^2 25[/tex] has only two solutions in integers which is y = 3 and x = +/5. Both sides can be factored but I dont know how to proceed after that. Perhaps mod 25 



#4
Aug907, 07:15 AM

HW Helper
P: 3,353

Fermat's equation.
I don't understand, if you narrowed it down to proving the equation you posted has only 2 solutions in integers, and you found 2 solutions, aren't you done?
How did you narrow it down By the Way? 



#5
Aug907, 03:12 PM

P: 891





#6
Aug907, 04:30 PM

P: 891

[tex](3+m)^{3} = (5+n)^{2} + 2[/tex] expands to [tex] 27+27m + 9m^{2} + m^{3} = 25 + 10n + n^{2} + 2[/tex] [tex]27m + 9m^{2} + {m}^3 = 10n + n^{2}[/tex] [tex]m(27+9m + m^{2}) = n(10+n)[/tex] So we have to prove that m=0 and n=0 or 10 are the only solution in integers to the equation immediately above lets consider it mod 4 with m = 0,1,2,3 mod 4 respectively to see if the left side is either 0 or 3 which are the only right side choices. If m = 0 mod 4 is the only fit then I think we made progress. 



#7
Aug907, 05:36 PM

P: 291

The approaches that you are using are called Elementary solutions to diophantine equations. They are the best ones but often the most difficult methods. According to E.T. Bell, Euler has spend 7 years solving this equation with elementary techinques. This shows how difficult it is without advanced methods in number theory.
But I was not asking for an elementary approach, for I belive it is too long. I was asking for other approaches I have never seen before. 



#8
Aug1107, 09:52 PM

PF Gold
P: 1,059

Kummer: Historical question: Who was the mathematician who created the concept of UFD? I think it was Leopold Kroneckor, am I correct?
I am surprised you would ask that! Wasn't it Kummer who thought he had solved Fermat's Last Theorem, until he discoverd the bit about unique factorization? However, Wikipedia adds: "The extension of Kummer's ideas to the general case was accomplished independently by Kronecker and Dedekind during the next forty years." http://en.wikipedia.org/wiki/Ideal_number And here is another tidbit from the same source: "It is widely believed that Kummer was led to his "ideal complex numbers" by his interest in Fermat's Last Theorem; there is even a story often told that Kummer, like Lamé, believed he had proven Fermat's Last Theorem until Dirichlet told him his argument relied on unique factorization; but the story was first told by Kurt Hensel in 1910 and the evidence indicates it likely derives from a confusion by one of Hensel's sources. Harold Edwards says the belief that Kummer was mainly interested in Fermat's Last Theorem "is surely mistaken" 



#9
Aug1107, 10:24 PM

P: 291





#10
Aug2207, 10:19 AM

P: 9




#11
Aug2207, 11:40 AM

P: 291





#12
Aug2407, 07:38 AM

P: 9

Sorry, I don't have a proof, there's a simple error in it. My bad.




#13
Aug2507, 02:06 PM

P: 891

You showed that if [tex] y^3[/tex] is an new candidate for Fermat's equation where [tex]y > 3[/tex] then there is an integer [tex]n> 0[/tex]solving [tex]n^{2} + 10n +27 y^{3} = 0[/tex] [3] You futher said [3] is a quadratic equation, and its coefficients can be labelled a, b, and c. Further, you noted that "In order for n to be an integer, b2  4ac must be a perfect square, k" which reduces to [tex]k^{2} = 4(y^{3}2)[/tex] Now [tex]y^{3}2[/tex] is a square, call that square [tex]c^{2}  c>5[/tex] Then [tex] n = 5 + c  n>0[/tex] by the quadratic formula. Pluging that back into your equation we get [tex]2510c +c^{2} 50+10c +27 y^{3}[/tex] = 0 [tex]c^{2} = y^{3}2[/tex] So your equation does check out but where to go after that I don't know 



#14
Aug2607, 10:06 PM

PF Gold
P: 1,059

The matter of unique factorization in [tex]\sqrt2[/tex] can be side stepped to a certain extent. But it involves some difficulity.
X==2 Mod p is true for p =8k+1, and p=8k+3. The next matter is to show that those primes can be expressed in the form p=a^2+2b^2, and, hopefully, uniquely so. (Maybe that can be assumed to be written up somewhere.) Then it is no trouble to show that numbers in the form of s^2+2t^2 are closed under multiplication. Thus we arrive at the fact that Y^3 is in the form of (a^2+2b^2)^3. The next problem to discover is just how many different ways can this be resolved. For example even though 5 in the form a^2+b^2 can only be expresssed as 2^2 +1^2, 5^3 = 11^2+2^2, and 10^2+5^2. Now if we find (a^2+2b^2)^3 = (a^3+2ab^2)^2 + 2[(a^2)b+2b^3]^2, this will NOT give the answer, but its fine if a=1, b=1 to find 3^3=3^2+2(3^2)should that be of some use now and then. BUT, if we can get (a^36ab^2)^2 + 2[3(a^2)b2b^3]^2. THIS WILL WORK for a=b=1. And...less I forget to say, it is an easy matter to see that the form: 2b^2[3a^22b^2] =2. can only be resolved for the case a, b = [tex]\pm1[/tex]. (b doesn't matter and the answer for x is either [tex]\pm5[/tex]. 



#15
Aug2707, 07:10 AM

P: 891

[tex]\frac{D_{(b,n,m)}}{2bb^2(2n1)} = b^32[/tex] so the left hand side should be a square (25) only for b = 3 for all integer n. 


Register to reply 
Related Discussions  
Fermat's last theorem  General Math  5  
Fermat's little theorem  Calculus & Beyond Homework  7  
Fermat's Last theorem  Linear & Abstract Algebra  52  
Fermat's last theorem.  Linear & Abstract Algebra  2  
Fermat's Last Theorem  General Math  53 