← Complete problem index

PROJECT EULER · #0135

Same Differences

Statement only · SolvedOriginal problem ↗

Given the positive integers, x, y, and z, are consecutive terms of an arithmetic progression, the least value of the positive integer, n, for which the equation, x2y2z2=n, has exactly two solutions is n=27: 342272202=1229262=27.

It turns out that n=1155 is the least value which has exactly ten solutions.

How many values of n less than one million have exactly ten distinct solutions?

Write-up coming later

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