Jump to content

Fermat's Enigma

Featured Replies

[math]x^n+y^n=z^n[/math] This is fermat's enigma, where n>2. However, [math]\sqrt3^4+2^4=\sqrt5^4[/math] is true. Huh??? :confused:

The link he posted did state that x, y and z had to be non-zero integers.

It's not Fermat's Enigma, it's Fermat's Last Theorem, which was solved (proved) a decade ago by Andrew Wiles.

with someone called Taylor, but most of the credit goes to Wiles. wasn't he from england?

with someone called Taylor, but most of the credit goes to Wiles. wasn't he from england?

 

He was from England, and Taylor only helped Wiles in fixing one minor flaw in the proof. Almost all of it was Wiles.

u talk of "fixing one minor flaw" as such a small thing. thats what makes or breaks a proof.

u talk of "fixing one minor flaw" as such a small thing. thats what makes or breaks a proof.

 

It is a small thing.

 

Insignificant it is not, but the amount of work required was miniscule compared to that Wiles put in.

It is still an important piece of work. I 'm sure Wiles could have fixed the flaw himself.

Wiles was very poor, he needs to think himself wothout revealing this secret to other person for over many years

in fact , if u ever bother to read the book called appropriately "Fermat's Last theorem" dont know who its by, it says that wiles isolated himself for several years from the outside world. devoting his time to the proof.

in fact , if u ever bother to read the book called appropriately "Fermat's Last theorem" dont know who its by, it says that wiles isolated himself for several years from the outside world. devoting his time to the proof.

 

Well, sort of. He just worked on his own for 7 years on campus. He didn't go and live in the hills or anything similar.

hehe. well obviously he not going to do that.

 

anyway back to the topic. the equation in discussion is one example of Diophantine equations. Diophantine equations are just equations in one or more variables for which integer solutions are sought.

 

one other example

 

let p be a prime. Then [math]p=x^2+y^2[/math] has a solution with [math]x,y \in \mathbb{Z}[/math] if and only if p = 2 or p is equivalent to 1 (mod4) [saw this in lecture notes for number theory]

Archived

This topic is now archived and is closed to further replies.

Important Information

We have placed cookies on your device to help make this website better. You can adjust your cookie settings, otherwise we'll assume you're okay to continue.

Configure browser push notifications

Chrome (Android)
  1. Tap the lock icon next to the address bar.
  2. Tap Permissions → Notifications.
  3. Adjust your preference.
Chrome (Desktop)
  1. Click the padlock icon in the address bar.
  2. Select Site settings.
  3. Find Notifications and adjust your preference.