All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars    
perplexus dot info

Home > Just Math
Cubeless? (Posted on 2004-08-29) Difficulty: 3 of 5
Prove that for any positive integer n, there exists at least one multiple of 5^n that doesn't have any perfect cube digits (0, 1, or 8) in its decimal representation.

See The Solution Submitted by Federico Kereki    
Rating: 3.4000 (5 votes)

Comments: ( Back to comment list | You must be logged in to post comments.)
Solution Similar solution | Comment 2 of 7 |
This can be solved in a similar fashion as "Spirit of '76 with no products". As an algorithm:

Set K=5^N
Set L=K
Set I=1
while I isn't greater than N
if the I-th digit from the right of K is 0, 1, 8
add L to K
add 1 to I
multiply L by 10
the answer is the N rightmost digits of K

  Posted by e.g. on 2004-08-30 08:35:32
Please log in:
Login:
Password:
Remember me:
Sign up! | Forgot password


Search:
Search body:
Forums (0)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (0)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Chatterbox:
Copyright © 2002 - 2018 by Animus Pactum Consulting. All rights reserved. Privacy Information