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 Where's the proof? by Richard)

I outlined a proof for this in an earlier post re(2): what am I missing?, unless I missed something.  A few steps were omitted, but I could flesh them out if you want.

Posted by Josh70679 on 2005-08-20 06:18:59