<?xml version="1.0" encoding="UTF-8"?>

<record version="7" id="2838">
 <title>Lagrange's four-square theorem</title>
 <name>LagrangesFourSquareTheorem</name>
 <created>2002-04-16 18:07:38</created>
 <modified>2005-02-13 15:17:48</modified>
 <type>Theorem</type>
 <creator id="348" name="bbukh"/>
 <author id="348" name="bbukh"/>
 <author id="148" name="vitriol"/>
 <classification>
	<category scheme="msc" code="11P05"/>
 </classification>
 <related>
	<object name="WaringsProblem"/>
	<object name="EulerFourSquareIdentity"/>
 </related>
 <preamble>\usepackage{amssymb}
\usepackage{amsmath}
\usepackage{amsfonts}</preamble>
 <content>\PMlinkescapeword{states}

Lagrange's four-square theorem states that every non-negative integer may be expressed as the sum of at most four squares. By the Euler four-square identity, it is enough to show that every prime is expressible by at most four squares. It was later proved that only the numbers of the form $4^n(8m + 7)$ require four squares.

This shows that $g(2) = G(2) = 4$, where $g$ and $G$ are the \PMlinkname{Waring functions}{WaringsProblem}.</content>
</record>
