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 Puzzle Solution Comment 7 of 7 |

At the outset, we proceed to determine a multiple of 5^n which does not possess any cube digit in the last n digits.  Suppose that, we have a multiple of p*(5^n) whose last cube digit is in the rth place from the right.

Then,  p*(10^r + 1) has the same digits in places 0 to r-1 and a
non-cube digit in place r, and hence no zeros in places 0 to r.
Repeating the above procedure, we find a multiple of  p*(5^n)  with no cube digits in the last n digits.

Now, let d be the remainder when p is divided by 2^n,  and therefore:

p = s*.2^n  + d, and hence:

d*(.5^n)  = p*(5^n)  - s*(10^n)

Accordingly, d*(5^n)   has the same last  n digits as p*(5^n). But it  has less than (n+1) digits  and  consequently, it possesses exactly n digits with no cube digits.


  Posted by K Sengupta on 2007-06-12 11:13:15
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 (4)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

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