4 ms·
Do you really believe that: (a) This constitutes a proof; (b) This is the "proof" that Fermat had; (c) Mathematicians missed this for over 350 year? I'm not
by ColinWright 8y ago
Do you really believe that:
(a) This constitutes a proof;
(b) This is the "proof" that Fermat had;
(c) Mathematicians missed this for over 350 year?
I'm not quite sure exactly what you are claiming.
- ox_n 8y agoIt's completely arrogant to assume that because it hasn't been solved by "better" people that I couldn't solve it.
- ColinWright 8y agoOK, so I'm taking it from your comment that you really do believe this constitutes a proof. Thanks for the reply.
- ox_n 8y agoI see it more like walking away knowing that I have checkmate whether the other person can see it or not. If you pay attention to the conditions that must necessarily exist, like the that the difference between two whole squares can be represented as EITHER an integer base taken to a power higher than two, or the sum of a series of consecutive odd numbers, the number of terms equaling the original base number of the higher power equation.
- andrepd 8y ago>about: Fuck you, hater. Oh, you're that guy.
- ox_n 8y agoI got to call them like I see them. Thanks for announcing that you stepped on that land mine.
- ColinWright 8y agoIt looks like you edited this comment, but I'm serious. I'm trying to understand your proof, but I'm having trouble seeing what the steps are for higher powers than 3 or 4. I already know the proofs for then cases n=3 and n=4, but I can't see how what you say works in the case, say, n=5, or n=13. Seriously, can you walk us through the steps of why x^5+y^5=z^5 has no (non-trivial) solutions? And to be fair, there are cases where, say, undergrads have proven significant results that had been outstanding for a long time. Proving that prime recognition is in P is one such case. but in that case they published a complete, clear paper. In this case I can't really see what you're saying you've done, or why it's true, which is why a walk-through of the case n=5 would be so helpful. Thanks. ======== For anyone interested, this is what the comment used to say ... The series of odd numbers must be consecutive and they simply are not when you add two different series together for all powers greater than two. It's okay. You'll get it. 1) a whole number, n, taken to a power greater than two 2) can be represented as a consecutive series of odd numbers 3) where there will always be a gap in the series between consecutive base numbers, for all p and p+1 4) therefore there will be a gap for all p and p+n, n>=1 combinations
- ox_n 8y agoCopy this into wolfram alpha: p=2, n=5, x=1/2(p+1)p^((n-1)/2), y=1/2(p-1)p^((n-1)/2) Try changing the values and playing with it until you understand that there will always be x^2 - y^2 for all p^n, n>2.