The set of numbers {9, 99, 999, 9999, ...} has some interesting properties. One of these has to do with factorization. Take any number n that isn't divisible by 2 or by 5. You will be able to find at least one number in the set that is divisible by n. Furthermore, you won't need to look beyond the first n numbers in the set.

Prove it.

(from http://www.ocf.berkeley.edu/~wwu/riddles/)

(In reply to Here is my proof by Brian Smith)

Brilliant!

Posted by spinoza on 2003-06-01 03:10:02