ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let nn be an odd positive integer. A representation of nn as four integer squares is an expression

n=a2+b2+c2+d2n=a^2+b^2+c^2+d^2

with a,b,c,d∈Za,b,c,d\in\mathbb Z.

Euler's refinement. Every odd positive integer nn has a representation as four integer squares satisfying

a+b+c+d=1.a+b+c+d=1.

This refinement strengthens Lagrange's four-square theorem by imposing a linear condition on the summands. The supplied text presents it as a conjecture Euler had made in 1750; no resolution status is given here.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.