This website is a semi-functional mirror of the original Project Euler. More information is available on GitHub.
projecteuler.net

Perfect Square Collection

Problem 142

Published on 24 February 2007 at 01:00 am [Server Time]

Find the smallest x + y + z with integers x > y > z > 0 such that x + y, x − y, x + z, x − z, y + z, y − z are all perfect squares.


Answer:
Go to back to Problems