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
re: Need some math theory help over here by Cory Taylor)
Another reason the problem excludes 2 and 5 is you can prove that the any number of 9s is NOT divisible by 2 or 5. Since n+1 is divisible by 2 and 5, n must not be.
|
|
Posted by Gamer
on 2003-05-03 16:44:52 |
re(2): Need some math theory help over here
