Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Proofs_of_Fermat's_theorem_on_sums_of_two_squares> ?p ?o. }
Showing items 1 to 31 of
31
with 100 items per page.
- Proofs_of_Fermat's_theorem_on_sums_of_two_squares abstract "Fermat's theorem on sums of two squares asserts that an odd prime number p can be expressed as with integer x and y if and only if p is congruent to 1 (mod 4). The statement was announced by Fermat in 1640, but he supplied no proof.The "only if" clause is easy: a perfect square is congruent to 0 or 1 modulo 4, hence a sum of two squares is congruent to 0, 1, or 2. An odd prime number is congruent to either 1 or 3 modulo 4, and the second possibility has just been ruled out. The first proof that such a representation exists was given by Leonhard Euler in 1747 and was quite complicated. Since then, many different proofs have been found. Among them, the proof using Minkowski's theorem about convex sets and Don Zagier's stunningly short proof based on involutions especially stand out.".
- Proofs_of_Fermat's_theorem_on_sums_of_two_squares wikiPageExternalLink 677.
- Proofs_of_Fermat's_theorem_on_sums_of_two_squares wikiPageExternalLink ProofOfThuesLemma.html.
- Proofs_of_Fermat's_theorem_on_sums_of_two_squares wikiPageID "1882815".
- Proofs_of_Fermat's_theorem_on_sums_of_two_squares wikiPageRevisionID "596268689".
- Proofs_of_Fermat's_theorem_on_sums_of_two_squares hasPhotoCollection Proofs_of_Fermat's_theorem_on_sums_of_two_squares.
- Proofs_of_Fermat's_theorem_on_sums_of_two_squares subject Category:Additive_number_theory.
- Proofs_of_Fermat's_theorem_on_sums_of_two_squares subject Category:Algebraic_number_theory.
- Proofs_of_Fermat's_theorem_on_sums_of_two_squares subject Category:Article_proofs.
- Proofs_of_Fermat's_theorem_on_sums_of_two_squares subject Category:Quadratic_forms.
- Proofs_of_Fermat's_theorem_on_sums_of_two_squares type Abstraction100002137.
- Proofs_of_Fermat's_theorem_on_sums_of_two_squares type ArticleProofs.
- Proofs_of_Fermat's_theorem_on_sums_of_two_squares type Cognition100023271.
- Proofs_of_Fermat's_theorem_on_sums_of_two_squares type Evidence105823932.
- Proofs_of_Fermat's_theorem_on_sums_of_two_squares type Form106290637.
- Proofs_of_Fermat's_theorem_on_sums_of_two_squares type Information105816287.
- Proofs_of_Fermat's_theorem_on_sums_of_two_squares type LanguageUnit106284225.
- Proofs_of_Fermat's_theorem_on_sums_of_two_squares type Part113809207.
- Proofs_of_Fermat's_theorem_on_sums_of_two_squares type Proof105824739.
- Proofs_of_Fermat's_theorem_on_sums_of_two_squares type PsychologicalFeature100023100.
- Proofs_of_Fermat's_theorem_on_sums_of_two_squares type QuadraticForms.
- Proofs_of_Fermat's_theorem_on_sums_of_two_squares type Relation100031921.
- Proofs_of_Fermat's_theorem_on_sums_of_two_squares type Word106286395.
- Proofs_of_Fermat's_theorem_on_sums_of_two_squares comment "Fermat's theorem on sums of two squares asserts that an odd prime number p can be expressed as with integer x and y if and only if p is congruent to 1 (mod 4). The statement was announced by Fermat in 1640, but he supplied no proof.The "only if" clause is easy: a perfect square is congruent to 0 or 1 modulo 4, hence a sum of two squares is congruent to 0, 1, or 2. An odd prime number is congruent to either 1 or 3 modulo 4, and the second possibility has just been ruled out.".
- Proofs_of_Fermat's_theorem_on_sums_of_two_squares label "Proofs of Fermat's theorem on sums of two squares".
- Proofs_of_Fermat's_theorem_on_sums_of_two_squares sameAs m.063gyp.
- Proofs_of_Fermat's_theorem_on_sums_of_two_squares sameAs Q16249614.
- Proofs_of_Fermat's_theorem_on_sums_of_two_squares sameAs Q16249614.
- Proofs_of_Fermat's_theorem_on_sums_of_two_squares sameAs Proofs_of_Fermat's_theorem_on_sums_of_two_squares.
- Proofs_of_Fermat's_theorem_on_sums_of_two_squares wasDerivedFrom Proofs_of_Fermat's_theorem_on_sums_of_two_squares?oldid=596268689.
- Proofs_of_Fermat's_theorem_on_sums_of_two_squares isPrimaryTopicOf Proofs_of_Fermat's_theorem_on_sums_of_two_squares.