About: Proof of Fermat's Last Theorem for specific exponents     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : yago:WikicatDiophantineEquations, within Data Space : dbpedia.org associated with source document(s)
QRcode icon
http://dbpedia.org/describe/?url=http%3A%2F%2Fdbpedia.org%2Fresource%2FProof_of_Fermat%27s_Last_Theorem_for_specific_exponents

Fermat's Last Theorem is a theorem in number theory, originally stated by Pierre de Fermat in 1637 and proved by Andrew Wiles in 1995. The statement of the theorem involves an integer exponent n larger than 2. In the centuries following the initial statement of the result and before its general proof, various proofs were devised for particular values of the exponent n. Several of these proofs are described below, including Fermat's proof in the case n = 4, which is an early example of the method of infinite descent.

AttributesValues
rdf:type
rdfs:label
  • برهان مبرهنة فيرما الأخيرة بالنسبة لحالات خاصة للأس (ar)
  • Demostració de l'últim teorema de Fermat (ca)
  • Démonstration du dernier théorème de Fermat pour les exposants 3, 4 et 5 (fr)
  • Proof of Fermat's Last Theorem for specific exponents (en)
  • 特定指数的费马大定理的证明 (zh)
rdfs:comment
  • برهنت مبرهنة فيرما الأخيرة بالنسبة لعدة قيم خاصة للأس. (ar)
  • Fermat's Last Theorem is a theorem in number theory, originally stated by Pierre de Fermat in 1637 and proved by Andrew Wiles in 1995. The statement of the theorem involves an integer exponent n larger than 2. In the centuries following the initial statement of the result and before its general proof, various proofs were devised for particular values of the exponent n. Several of these proofs are described below, including Fermat's proof in the case n = 4, which is an early example of the method of infinite descent. (en)
  • 费马大定理的完整证明是一个艰深的过程,但是,对于某些特定的指數n,其证明并不算十分复杂,因此在此展示费马大定理的特例证明。 (zh)
  • En matemàtiques, més concretament en aritmètica modular, el darrer teorema de Fermat tracta de les arrels de l'equació diofàntica següent, amb x, y i z desconeguts :Afirma que no existeix cap solució no trivial si el paràmetre n és estrictament superior a 2. Una equació diofàntica és una equació de coeficients enters en què les solucions són nombres enters. Si, com en aquest exemple, l'expressió és sovint simple, la solució resulta difícil en general. (ca)
  • En mathématiques, plus précisément en arithmétique modulaire, le dernier théorème de Fermat traite des racines de l'équation diophantienne suivante, d'inconnues , et : Il affirme qu'il n'existe aucune solution non triviale si le paramètre n est strictement supérieur à 2. Une équation diophantienne est une équation à coefficients entiers dont les solutions recherchées sont entières. Si, comme dans l'exemple ci-dessus, l'expression est souvent simple, la résolution s'avère en général ardue. (fr)
foaf:depiction
  • http://commons.wikimedia.org/wiki/Special:FilePath/Leonhard_Euler.jpg
  • http://commons.wikimedia.org/wiki/Special:FilePath/Peter_Gustav_Lejeune_Dirichlet.jpg
  • http://commons.wikimedia.org/wiki/Special:FilePath/Pierre_de_Fermat.png
  • http://commons.wikimedia.org/wiki/Special:FilePath/Legendre.jpg
dcterms:subject
Wikipage page ID
Wikipage revision ID
Link from a Wikipage to another Wikipage
Link from a Wikipage to an external page
Faceted Search & Find service v1.17_git139 as of Feb 29 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 08.03.3330 as of Mar 19 2024, on Linux (x86_64-generic-linux-glibc212), Single-Server Edition (61 GB total memory, 51 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software