Lagrange's four-square theorem
Theorem
Lagrange's four-square theorem, also known as Bachet's conjecture, states that every nonnegative integer can be represented as a sum of four non-negative integer squares. That is, the squares form an additive basis of order four: p = a 2 + b 2 + c 2 + d 2 , {\displaystyle p=a^{2}+b^{2}+c^{2}+d^{2},} where the four numbers a , b , c , d {\displaystyle a,b,c,d} are integers.
Nº Q756946 ★★
Uncommon · Knowledge
Lagrange's four-square theorem
Theorem
Lagrange's four-square theorem, also known as Bachet's conjecture, states that every nonnegative integer can be represented as a sum of four non-negative integer squares. That is, the squares form an additive basis of order four: p = a 2 + b 2 + c 2 + d 2 , {\displaystyle p=a^{2}+b^{2}+c^{2}+d^{2},} where the four numbers a , b , c , d {\displaystyle a,b,c,d} are integers.
Last price
—
Floor price
—
7-day median
—
30-day sales
0
30-day range
—
In circulation
0
Price history
median
low – high
sales
No sales in this period
Show table
| Date | median | Low | High | sales |
|---|
Sales history
- Last sale
- —
- 30-day average
- —
- 30-day low
- —
- 30-day high
- —
- Sales 7d
- 0
- Sales 30d
- 0
No sales yet.
Anonymous sales: no buyer or seller shown. Figures count player-to-player sales only.
From Wikipedia
Lagrange's four-square theorem, also known as Bachet's conjecture, states that every nonnegative integer can be represented as a sum of four non-negative integer squares. That is, the squares form an additive basis of order four: p = a 2 + b 2 + c 2 + d 2 , {\displaystyle p=a^{2}+b^{2}+c^{2}+d^{2},} where the four numbers a , b , c , d {\displaystyle a,b,c,d} are integers. For illustration, 3, 31, and 310 can be represented as the sum of four squares as follows: 3 = 1 2 + 1 2 + 1 2 + 0 2 31 = 5 2 + 2 2 + 1 2 + 1 2 310 = 17 2 + 4 2 + 2 2 + 1 2 = 16 2 + 7 2 + 2 2 + 1 2 = 15 2 + 9 2 + 2 2 + 0 2 = 12 2 + 11 2 + 6 2 + 3 2 . {\displaystyle {\begin{aligned}3&=1^{2}+1^{2}+1^{2}+0^{2}\\[3pt]31&=5^{2}+2^{2}+1^{2}+1^{2}\\[3pt]310&=17^{2}+4^{2}+2^{2}+1^{2}\\[3pt]&=16^{2}+7^{2}+2^{2}+1^{2}\\[3pt]&=15^{2}+9^{2}+2^{2}+0^{2}\\[3pt]&=12^{2}+11^{2}+6^{2}+3^{2}.\end{aligned}}} This theorem was proven by Joseph-Louis Lagrange in 1770. It is a special case of the Fermat polygonal number theorem.
Text: Wikipédia, CC BY-SA 4.0. · Image: Cmglee (CC BY-SA 4.0) ·
Related cards
Euler's sum of powers conjecture
Disproved mathematical conjecture
Nº Q1096450 ★★
Intersection (set theory)
Concept in set theory (for the term in geometry, see Q1364910)
Nº Q185837 ★★★
Perron–Frobenius theorem
Theorem
Nº Q1564541 ★★
Goodstein's theorem
Theorem
Nº Q1149185 ★★
Pythagorean theorem
Relation in Euclidean geometry among the three sides of a right triangle
Nº Q11518 ★★★★
History of logarithms
Aspect of history
Nº Q22615167 ★★