what's the demonstration of Fermat's last theorem??
454639
No -one knows what his demonsration was, that was the whole point.\nBut it has been proved subsequentally. See the second link
176676
check this site\n\nhttp://scienceworld.wolfram.com/biography/Fermat.html
38659
Euclid has proven that there are an infinite number of prime numbers and did so rather elegantly in what many mathematicians believe is one of the best proofs ever. \n\nYou can see the worked theorem here...\n\nhttp://primes.utm.edu/notes/proofs/infinite/euclids.html\n\n... and of course just in case, here is a more plain english explanation...\n\nhttp://aleph0.clarku.edu/%7Edjoyce/java/elements/bookIX/propIX20.html
740336
1. 101\n2.  There are 2 ones.  The first and last entries of the row.\n3.  Each entry is the sum of the 2 entries above and to     each side of it.\n4.  If the 2'nd entry in a row is a prime, it divides each of the other entries in the row (except for the last entry in the row which is always a 1)\n\nCheck out http://ptri1.tripod.com/ for all manner of kewl sh|t about Pascal's Triangle.  Also Fibonacci Series and other fun things ☺\n\n\nDoug\n\nEDIT:  Give Peter D the points.  He needs 'em worse than I do ☺
175889
Proving irreducibility over Q is rather straightforward based on what the form of a nontrivial factorization would have to look like.\n\nReduction modulo every prime follows from X^4 - 10x^2 + 1 being equal to all three of the following:\n\nx^4 - 2x^2 + 1 - 8x^2 = (x^2 - 1)^2 - 2(2x)^2\nx^4 + 2x^2 + 1 - 12x^2 = (x^2 + 1)^2 - 3(2x)^2\nx^4 - 10x^2 + 25 - 24 = (x^2 - 5)^2 - 6(2^2)\n\nIf 2 is a quadratic residue modulo p, then the first is a difference of two squares.\n\nIf 3 is a quadratic residue modulo p, then the second is a difference of two squares.\n\nIf neither 2 nor 3 is a quadratic residue modulo p, then their product 6 is a quadratic residue modulo p, and so the third is a difference of two squares.
55179
hold on let me look at that for a minute....(dya hate math like this as much as i do?)\n\n(1,4) is one for sure\nyea thats' the only one!!!
525104
Fermat, I think.  He wrote he had found a proof for this, but put a note in the margin that there wasn't enough room there for the proof.  And no-one could find the proof anywhere else in his notes and he died.  A fellow named Andrew Wiles worked for a long time to find the proof, and after some ill-fated public announcements I think the proof was finally completed.\n\nI hope this helps.
406361
well the theorem says that a^p ≡ a(modp) where p is prime.\nequivalent to this is a^(p-1) ≡ 1(modp) by just taking the a to the other side. \n\nso we know 5^6≡1(mod7)\n\nso\n5^74 = (5^6)^12 x 5^2 ≡ 1 x 5^2 ≡ 25 ≡ 4 (mod 7)
826199
Pierre de fermat because of his intelligent works including his last theorem.
652164
This theorem has an amazing number of proofs but this theorem(like many other mathematical concepts) as you said was known way before pythogorean times but only to INDIANS who didnt share it on the global scale!!
897560
There are at least 3 different Fermat theorems that I can think of.  One is in calculus.  Another known as Fermat's little theorem is in Number theory and abstract algebra.  The most famous one Fermat's last theorem is in number theory.  There are Euler's theorms in number theory and abstract algebra.  The Chinese Remainder theorem is in Abstract algebra and number theory.  \n\nI own a number theory book by Andrews, it is a dover book (so it is cheap) and it is good.  \n\nAs for abstract algebra, I like Dummit and Foote.  It is a graduate level book.  For undergrad, Gallian's Contemporary Abstract Alg is good.\n\nHope this helps.
1065017
I'm writing up a proof right now that this is not possible.\n\nCheck out the pdf at:\nhttp://www.geocities.com/euleratuo/
55082
No no solution since n>2\n\nPierre de Fermat died in 1665. Today we think of Fermat as a number theorist, in fact as perhaps the most famous number theorist who ever lived. It is therefore surprising to find that Fermat was in fact a lawyer and only an amateur mathematician. Also surprising is the fact that he published only one mathematical paper in his life, and that was an anonymous article written as an appendix to a colleague's book.\n\nThere is a statue of Fermat and his muse in his home town of Toulouse:\n(Click it to see a larger version)\n\n\nBecause Fermat refused to publish his work, his friends feared that it would soon be forgotten unless something was done about it. His son, Samuel undertook the task of collecting Fermat's letters and other mathematical papers, comments written in books, etc. with the object of publishing his father's mathematical ideas. In this way the famous 'Last theorem' came to be published. It was found by Samuel written as a marginal note in his father's copy of Diophantus's Arithmetica. \n\nFermat's Last Theorem states that \n\nxn + yn = zn \n\nhas no non-zero integer solutions for x, y and z when n > 2. Fermat wrote \n\nI have discovered a truly remarkable proof which this margin is too small to contain.
1043613
This lesson will allow you to figure out the Pythagorean Theorem all by yourself.  Go ahead and click on the preface link.\n\nhttp://www.arcytech.org/java/pythagoras/index.html
467967
this is probably not a perfect answer but this site may give you some clues.\n\nhttp://www.gomath.com/Questions/question.php?question=4751\n\naltrnatively type 'prove v*v = 2gr*r/s+v0*v0-2gr' into a search engine and see what comes up.
862280
There are quite a few method for proving pythagoras theorem. I feel that easiest and neatest is by similarity of triagles ..\n\nproof 6 of the link
379145
Look up Gauss. Story is he added up 1..100 in grade school and invented the n*(N+1)/2.