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
ratings - to owl by pcbouhid)
I thought about that problem for a bit; an interesting "hunt" puzzle
with possibilities for generalization and/or computerization.
Lots of people love these kinds of puzzles!
But given any problem, I can see someone coming along and thinking the
worst of it. And if they feel this way, than voting a "1" is their
perogative. Or perhaps it was given without fair thought or
consideration.
But I wouldn't waste one single, solitary second of angst,
worrying about it. No one really cares about the ranking, do they?
|
Posted by owl
on 2005-08-16 21:49:34 |