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
wait a second... by Josh70679)
Josh, in my comment to owl, I pointed this out, and I assumed that "if we pick two numbers", means two at one time, not with a reposition.
Because of this my solution was n(2n+1).
|
Posted by pcbouhid
on 2005-08-17 21:43:24 |