← Complete problem index

PROJECT EULER · #0142

Perfect Square Collection

Statement only · SolvedOriginal problem ↗

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

Write-up coming later

The complete problem is available here. An approach, code, and answer will be added later.