statement theorem
Sum of two squares theorem
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.
Explanations
L1 human
To decide whether is a sum of two squares, factor into primes. Look only at the primes that leave remainder on division by . Each of them must appear an even number of times.
What this node 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 node is. They do not measure its truth.
What this needs
To read this node, read these 13 nodes in this order. The foundations come first, and the list ends with this node.
- 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
Sources
What links here
No node links to this node yet.