Programming C, C++, Java, PHP, Ruby, Turing, VB
Computer Science Canada 
Programming C, C++, Java, PHP, Ruby, Turing, VB  

Username:   Password: 
 RegisterRegister   
 Quick math question...for 500 bits
Index -> Contests
Goto page Previous  1, 2, 3
View previous topic Printable versionDownload TopicSubscribe to this topicPrivate MessagesRefresh page View next topic
Author Message
SilverSprite




PostPosted: Mon Jul 28, 2003 4:56 pm   Post subject: Re: Quick math question...for 500 bits

Darkness wrote:
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.
Sponsor
Sponsor
Sponsor
sponsor
thegoose




PostPosted: Fri Jun 18, 2004 5:29 am   Post subject: (No subject)

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




PostPosted: Fri Jun 18, 2004 8:35 pm   Post subject: (No subject)

i dont understand what you mean...
Quote:

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
Display posts from previous:   
   Index -> Contests
View previous topic Tell A FriendPrintable versionDownload TopicSubscribe to this topicPrivate MessagesRefresh page View next topic

Page 3 of 3  [ 33 Posts ]
Goto page Previous  1, 2, 3
Jump to:   


Style:  
Search: