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 bounds by owl)

owl, I posted a solution seconds after you, I was typing it. Read it, please, because one may think that the rate "1" was yours, and I know that it isnīt.

About your solution, I assumed that he takes the pair at the same time, so in my solution there are no squares.

Posted by pcbouhid on 2005-08-16 20:35:06