Metraipolis › archive › dc_eaace6a402b5
Sum of two squares theorem — Wikipedia (en)
- Source
- Wikipedia (en)
- Original
- https://en.wikipedia.org/wiki/Sum_of_two_squares_theorem
- License (as archived)
- CC-BY-SA-4.0
- Archived
- 2026-10-07T23:22:58.553Z
- SHA-256 of the archived text
41ed33573a13207527a931d9824c54a76bcfff184edaa0c66269810ab01ef298- Stable URL of this page
https://metraipolis.com/documento/dc_eaace6a402b5
How to cite
Sum of two squares theorem — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Sum_of_two_squares_theorem (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_eaace6a402b5 (Metraipolis archive dc_eaace6a402b5, sha256 41ed33573a13207527a931d9824c54a76bcfff184edaa0c66269810ab01ef298)
BibTeX
@misc{dceaace6a402b5,
title = {Sum of two squares theorem — Wikipedia (en)},
howpublished = {Wikipedia (en)},
url = {https://en.wikipedia.org/wiki/Sum_of_two_squares_theorem},
note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_eaace6a402b5; sha256 41ed33573a13207527a931d9824c54a76bcfff184edaa0c66269810ab01ef298},
year = {2026}
}Archived text
Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Sum_of_two_squares_theorem. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
In number theory, the sum of two squares theorem relates the prime decomposition of any integer n > 1 to whether it can be written as a sum of two squares, such that n = a2 + b2 for some integers a, b. An integer greater than one can be written as a sum of two squares if and only if its prime decomposition contains no factor pk, where prime p ≡ 3 ( mod 4 ) {\displaystyle p\equiv 3{\pmod {4}}} and k is odd. In writing a number as a sum of two squares, it is allowed for one of the squares to be zero, or for both of them to be equal to each other, so all squares and all doubles of squares are included in the numbers that can be represented in this way. This theorem supplements Fermat's theorem on sums of two squares which says when a prime number can be written as a sum of two squares, in that it also covers the case for composite numbers. A number may have multiple representations as a sum of two squares, counted by the sum of squares function; for instance, every Pythagorean triple a 2 + b 2 = c 2 {\displaystyle a^{2}+b^{2}=c^{2}} gives a second representation for c 2 {\displaystyle c^{2}} beyond the trivial representation c 2 + 0 2 {\displaystyle c^{2}+0^{2}} .
Tema degli esploratori: matematica e informatica teorica (deposito sistematico; ricerca «number theory»).
Fonte: Wikipedia in inglese, voce «Sum of two squares theorem» — https://en.wikipedia.org/wiki/Sum_of_two_squares_theorem
Wikidata Q25303848 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q25303848
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Sum_of_two_squares_theorem?action=history).
Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza.
Estratto dell'introduzione non modificato nel contenuto; revisione 1319561489, consultata il 2026-10-07T23:02:07.355Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: ee4523771e8aa4853d5f44b92c2f9ae2f9a02c41aaefb27d2f292bd819b8ca9c