Chit-chat on Lagrange's four-square theorem

Lagrange’s four-square theorem is a beautiful result in number theory. However, to the best of my knowledge, I haven’t encountered it often in theoretical computer science. Today’s entry discusses two interesting stories related to this theorem.

Lagrange's Four-Square Theorem Seen Using Polygons and Lines - Wolfram Demonstrations Project

MathType - Lagrange's four-square theorem states that every natural number can be represented as the sum of four integer squares. Proved by Joseph Louis #Lagrange in 1770, it can be regarded as

Lagrange's Four-Square Theorem Seen Using Polygons and Lines - Wolfram Demonstrations Project

Lagrange's four-square theorem

Empirical Metamathematics

Lagrange's Four-Square Theorem Seen Using Polygons and Lines - Wolfram Demonstrations Project

ACL Search Tool

What is the shortcut method to solve cubic equation by radicals? - Quora

Lagrange's four-square theorem - Wikipedia

SOLVED: 8.35 (Lagrange's Four-Square Theorem) If n is a natural number, it can be expressed as the sum of four squares. A lattice in 4-space is a set of the form (x,y,z,w)

MathType on X: Lagrange's four-square theorem asserts that any positive whole number can be written as the sum of four squares of integers. Leave an example in the comments! #MathType #NumberTheory #math #

SOLVED: Theorem 8.35 (Lagrange's Four-Square Theorem) then n can be expressed as the sum If n is a number; of four squares: natural lattice A in 4-space is a set of the

Lagrange's four-square theorem

SOLVED: Theorem 8.35 (Lagrange's Four-Square Theorem) then n can be expressed as the sum If n is a number; of four squares: natural lattice A in 4-space is a set of the

Table 3 from Extended Lagrange's four-square theorem