August 2005
<<July August September>>
Puzzle for August 2005.
This month's puzzle was sent in by Rajesh.
It has appeared elsewhere; attributions will be given with the solution.
We are not asking for solutions this month.
For K as large as possible, produce a K-digit integer M such that for each N=1,2,...,K, the integer given by the first N digits of M is divisible by N.
An example is K=4, M=7084, because 7 is divisible by 1; 70 is divisible by 2; 708 is divisible by 3; and 7084 is divisible by 4.
We invite visitors to our website to submit an elegant solution. Send your submission to the ponder@il.ibm.com.
If you have any problems you think we might enjoy, please send them in. All replies should be sent to: ponder@il.ibm.com
Challenge:
08/01/2005 @ 08:00 AM EST
Solution:
09/01/2005 @ 08:30 AM EST
List Updated:
08/01/2005 @ 08:00 AM EST
(No "correct responses" list this month)
Attention: If your name is posted here and you wish it removed please send email to the ponder@il.ibm.com.