Given positive integer n, consider the set of numbers {n²+1, n²+2, ... (n+1)²}. If we pick two numbers x and y out of that set, how many different values can the product xy take?

(In reply to re(3): Where's the proof? by Richard)

you're right, the fact that they are gcd's has no bearing on the proof itself.

Posted by Josh70679 on 2005-08-20 21:06:55