( ! ) Notice: session_start() [function.session-start]: Server (tcp 21201) failed with: Failed reading line from stream (0) in /var/www/html/common-trunk/SWAT/SWAT.php5 on line 108
Call Stack
10.0010171192{main}( )../viewChallenge.php5:0
20.0017283896include_once( '/var/www/html/hpcu/config/standardIncludes.php5' )../viewChallenge.php5:20
30.086711488928SWAT->startSession( )../standardIncludes.php5:138
40.086811488952session_start ( )../SWAT.php5:108
HPC University: TamreF
Sunday April 26, 2009
This problem asks you to work with arithmetic sequences.
Given that the positive integers, x, y, and z, are consecutive terms of an arithmetic progression, the least value of the positive integer n, such that the equation x^2 - y^2 - z^2 = n has exactly two solutions, is n = 27:

34^2 - 27^2 - 20^2 = 12^2 - 9^2 - 6^2 = 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?

The Number Theory Library (NTL) may be useful for mapping out a brute-force solution; however, your final solution should be a bit more elegant, as a brute-force approach would be highly inefficient.

(This problem came from Project Euler).
Show solution
©1994-2017   |   Shodor   |   Privacy Policy   |   NSDL   |   XSEDE   |   Blue Waters   |   ACM SIGHPC   |   feedback  |   facebook   |   twitter   |   rss   |   youtube Not Logged In. Login