Fermat's Last Theorem

Part of the TechTarget Network of Enterprise IT Web Sites
Home Look It Up ITKnowledge Exchange Fast References Products White Papers Blogs

Search our IT-specific encyclopedia for:
 
OR Jump to a topic:
 
Advanced Search
Browse alphabetically:
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z #
All Categories Computing Fundamentals

Fermat's Last Theorem

Fermat's Last Theorem (FLT), a significant hypothesis in number theory , was first stated by Pierre de Fermat, a 17th-Century laywer and amateur mathematician. The proposition was discovered by his son Samuel while collecting and organizing the elder Fermat's papers and letters posthumously.

The proposition is as follows. Suppose we have the following equation:

x n + y n = z n

where x , y , and z are nonzero integer s. Then the equation has no solution for integers n larger than 2.

Fermat did not state a proof of this hypothesis, although he said that he had found a remarkable demonstration but did not have space in the margin of his text to write it down. Mathematicians immediately began seeking a proof. (Many mathematicians today doubt that Fermat had actually found a valid proof.) The hypothesis was demonstrated true for increasingly large values of n , but proving the theorem in general, for all integers n greater than 2, remained elusive for centuries. Over the next three hundred years, mathematicians from all over the world sought to prove Fermat's Last Theorem; it was considered by many to be the Holy Grail of mathematics.

Two strategies of proof can reasonably be tried. First, one can assume that the equation has a solution for some nonzero integers x , y , and z , and for some n greater than 2, and then derive a contradiction from this assumption. This tactic is formally known as reductio ad absurdum. Second, one might prove that the equation has no solution for n = 3, and then demonstrate that if the equation has no solution for n = k , where k is an unspecified integer, then there exists no solution for n = k + 1. This is the technique of mathematical induction.

In the 1990s, the British mathematician Andrew Wiles produced a proof of FLT that, after some refinements, has withstood all challenges to date.













Read more about it at:
> PBS's Web site includes an interview with Andrew Wiles about his proof.
Last updated on: Oct 17, 2006

>  Enterprise Software related Research & News
>  White Papers for the Retail Industry

Are you a Know-IT-All?
What year was the first version of Windows released?
Answer

WORD OF THE DAY...
Platform as a Service (PaaS)
LEARN MORE ABOUT...
Email security
Buzzword Alert: MoSoSo
Our Favorite Cheat Sheets
Our Latest Discovery
Our 60 tech-specific sites
WhatIs.com RSS Feeds
Home Look It Up ITKnowledge Exchange Fast References Products White Papers Blogs
About Us   |   Contact Us   |   For Advertisers   |   For Business Partners   |   Reprints   |   RSS   |   Awards
TechTarget provides enterprise IT professionals with the information they need to perform their jobs - from developing strategy, to making cost-effective IT purchase decisions and managing their organizations' IT projects - with its network of technology-specific Web sites, events and magazines.

TechTarget Corporate Web Site  |  Media Kits  |  Reprints  |  Site Map




All Rights Reserved, Copyright 2008, TechTarget | Read our Privacy Policy
  TechTarget - The IT Media ROI Experts