Take the 2-minute tour ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

So I was watching a video on Leonhard Euler about how he amazingly solved so many difficult problems and one of the many problems that he solved was this:

Find four whole numbers, the sum of any two of which add up to a perfect square.

The numbers he found were: $$18530,~~~ 38114,~~~ 45986,~~~ 65570$$

I've searched everywhere on the net but I can't find how he solved this. Does anyone here know how he did it?


share|improve this question
I suspect the first thing to try is to find three whole numbers, the sum of any two of which add up to a perfect square. See if you can find any pattern to the set of such triples. –  Thomas Andrews Dec 4 '12 at 21:40
add comment

1 Answer 1

up vote 5 down vote accepted

See page 129 and next of Yiu's book The Elementary Mathematical Works of Leonhard Euler (1707 – 1783) (Dunham's comment appears here).

Concerning the referenced Euler paper "Recherches sur le problème de trois nombres carrés tels que la somme de deux quelconques moins le troisième fasse un nombre carré" you may find the french, english and a synopsis here (from the excellent 'The works of Leonhard Euler online').

share|improve this answer
add comment

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.