Number theory Diophantine equations Theorem
Sum of two squares theorem
Builds on Fermat's theorem on sums of two squaresBrahmagupta–Fibonacci identityP-adic valuation
Statement
Let be a positive integer. Then for some integers and if and only if is even for each prime . Here is the p-adic valuation.
Remarks
For example, , but is not a sum of two squares. The "if" part follows from Fermat's theorem on sums of two squares and the Brahmagupta–Fibonacci identity. Zero squares are allowed, so each square and each double of a square is a sum of two squares.
Reading path
To understand this page from the ground up, read these 13 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Brahmagupta–Fibonacci identity statement
- Divisibility definition
- Congruence modulo n definition
- Prime number definition
- Quadratic residue definition
- Fermat's little theorem statement
- P-adic valuation definition
- Legendre symbol definition
- Euler's criterion statement
- First supplement to quadratic reciprocity statement
- −1 is a square modulo p if and only if p is not 3 modulo 4 statement
- Fermat's theorem on sums of two squares statement
- Sum of two squares theorem statement
Further reading
About this page
| Tag | 04NPWJMA6H |
|---|---|
| URI | m2://04NPWJMA6H |
| Kind | statement, theorem |
| Writing | W1 stated |
| MSC | 11E25 |
| Status | This copy of the site has no build data. Run m2 status 04NPWJMA6H. |
| Uses | Fermat's theorem on sums of two squares, Brahmagupta–Fibonacci identity, P-adic valuation |
| Same as |
Markdown · JSON · Edit on GitHub
What this page needs for W2
- edge about out: the concepts that the statement is about (0 of 1)
- edge proves in: at least one proof node (0 of 1)
- edge instance_of or illustrates in: one example that shows the statement at work (0 of 1)
- explanation L2 (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.