(3 votes, average: 4.67 out of 5)
Loading...
Project Euler 135: Same differences
Problem Description
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, x2 − y2 − z2 = n, has exactly two solutions is n = 27:
342 − 272 − 202 = 122 − 92 − 62 = 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?
Analysis
Concept code. More later.
Project Euler 135 Solution
Runs < 1 seconds in Python 2.7.
Use this link to get the Project Euler 135 Solution Python 2.7 source.
Afterthoughts
-
No afterthoughts yet.
Project Euler 135 Solution last updated
When the concept code ?
Posted by Mellatora | March 20, 2012, 11:19 AM