----------------------------------- Martin Thu Jun 26, 2003 7:56 pm Quick math question...for 500 bits ----------------------------------- X^n + Y^n = Z^n Find one case, with X,Y,Z and n integers, and n greater than 2 for which this is true. ----------------------------------- Homer_simpson Thu Jun 26, 2003 8:01 pm ----------------------------------- i guess if x,y and z were 0 and n was bigger than 2 it would be true... :roll: ----------------------------------- Catalyst Thu Jun 26, 2003 8:23 pm ----------------------------------- first off this is Fermat's last theorem and it has been proven to that is is not true second of all, homer since it is X,Y, and Z you should assume they are different numbers ----------------------------------- AsianSensation Thu Jun 26, 2003 8:49 pm ----------------------------------- aww....come on now martin, Fermat's Last Theorem? I would've expected something less conspicuous.....(doesn't really matter though, Catalyst or Bugz would probably get it anyways if it were a different question) ----------------------------------- Homer_simpson Thu Jun 26, 2003 9:27 pm ----------------------------------- oh ic... well in that case it is impossible i think :? ----------------------------------- Andy Fri Jun 27, 2003 9:34 am ----------------------------------- martin, quick my ass... ----------------------------------- AsianSensation Fri Jun 27, 2003 9:49 am ----------------------------------- yeah, didn't it take that guy(was it Andrew Wales?) like 8 years to come up with the 130 something pages proof for Fermat's Last Theorem? ----------------------------------- Andy Fri Jun 27, 2003 12:18 pm ----------------------------------- is it was actually proved? ----------------------------------- Martin Fri Jun 27, 2003 1:18 pm ----------------------------------- heh, some people have too much time ----------------------------------- SilverSprite Fri Jun 27, 2003 2:35 pm ----------------------------------- Andrew Wiles asian.... didnt mr white talk to you about him? he gave us a story last year about one of his students going crazy cuz he thought he had the proof.. ----------------------------------- AsianSensation Fri Jun 27, 2003 2:40 pm ----------------------------------- i never heard Mr.White talk about him, cause im not in his class. lol, and to go crazy over some math proof.....i can only imagine two people right now, that would do that(SW and TTL), but then again, proving fermat's last theoreom guarentees $50,000(or was it $500,000?) ----------------------------------- Andy Fri Jun 27, 2003 5:22 pm ----------------------------------- i think TTL would juss jump of a bridge if she proved it ----------------------------------- Crono Sat Jun 28, 2003 7:37 pm ----------------------------------- would u give me 5000 bits if i proved fermat's last theorem rite here? ----------------------------------- Andy Sun Jun 29, 2003 1:37 pm ----------------------------------- lol ya he can prolly prove it too ----------------------------------- SilverSprite Sun Jun 29, 2003 2:10 pm ----------------------------------- yeah.. pshaaw what? like its hard?? ----------------------------------- bugzpodder Thu Jul 03, 2003 11:19 am ----------------------------------- (-1)^3+(1)^3=0^3 so (-1,1,0) is a solution to x^3+y^3=z^3 did somebody say 500 BITS?!?! ----------------------------------- bugzpodder Thu Jul 03, 2003 11:22 am ----------------------------------- btw, no sneaking and changing the question!! ----------------------------------- SilverSprite Thu Jul 03, 2003 1:25 pm ----------------------------------- LMAO... ahahaha but i havent seen darkness around lately.. ----------------------------------- AsianSensation Thu Jul 03, 2003 1:26 pm ----------------------------------- lol, good one Bugz, that's funny :lol: ----------------------------------- bugzpodder Thu Jul 03, 2003 1:34 pm ----------------------------------- yeah if anyone one is interested, pick any integer k and any positive p, (-k,k,0,2p+1) or (k,-k,0,2p+1) would work that is (a,b,c,n) ----------------------------------- bugzpodder Thu Jul 03, 2003 5:58 pm ----------------------------------- Its about time i get some bits! 500 sounds nice :D ----------------------------------- SilverSprite Thu Jul 03, 2003 6:19 pm ----------------------------------- yeah if anyone one is interested, pick any integer k and any positive p, (-k,k,0,2p+1) or (k,-k,0,2p+1) would work that is (a,b,c,n) well yeah thast sortof obvious.. the exponent is odd and so the two terms cancel each other out and give you 0. ----------------------------------- bugzpodder Thu Jul 03, 2003 7:42 pm ----------------------------------- so? your point being? i am simply stating the obvious! -|:o) ----------------------------------- SilverSprite Thu Jul 03, 2003 9:54 pm ----------------------------------- exactly you made it seem so complicated.. ----------------------------------- bugzpodder Fri Jul 04, 2003 11:22 am ----------------------------------- we all know you are very bright silversprite. ----------------------------------- SilverSprite Fri Jul 04, 2003 1:58 pm ----------------------------------- akh.. meanie ----------------------------------- Archi Mon Jul 28, 2003 11:32 am ----------------------------------- 3^2+4^2=5^2 9+16=25 There we go... ----------------------------------- bugzpodder Mon Jul 28, 2003 1:12 pm ----------------------------------- n is greater than 2 ----------------------------------- SilverSprite Mon Jul 28, 2003 2:21 pm ----------------------------------- lol ----------------------------------- Archi Mon Jul 28, 2003 4:54 pm ----------------------------------- He didn't say that it couldn't be 2. ----------------------------------- SilverSprite Mon Jul 28, 2003 4:56 pm Re: Quick math question...for 500 bits ----------------------------------- X^n + Y^n = Z^n Find one case, with X,Y,Z and n integers, and n greater than 2 for which this is true. ----------------------------------- thegoose Fri Jun 18, 2004 5:29 am ----------------------------------- It's funny that if you make X,Y,Z polynominals of degree greater than 1, the proof becomes about a page in length. I'll post it for 200 bits. ----------------------------------- bugzpodder Fri Jun 18, 2004 8:35 pm ----------------------------------- i dont understand what you mean... X,Y,Z polynominals of degree greater than 1 are you saying that there exists no polynomials f,g,h of degree greater than 1 such that (f(x))^n + (g(x))^n = (h(x))^n where n is an integer greater than 2? and let me ask if it is your own proof