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

Home > Numbers
Ring in 2013 (Posted on 2012-12-31) Difficulty: 3 of 5
Start as you wish had you prove that for any k-digit number M there exists a number n such that the string of first k digits of 2n equals M.

Find a power of 2 whose decimal expansion begins with the 12-digit string "201320132013". It need not be the smallest such number.

Bonus: Find the smallest such number and prove it to be the smallest.

See The Solution Submitted by Charlie    
Rating: 4.0000 (1 votes)

Comments: ( Back to comment list | You must be logged in to post comments.)
Hints/Tips Hint Comment 5 of 5 |
It's expected that n would be a 12- or 13-digit number so that the number of possibilities (pigeonholes) would be large enough that there's a high enough probability of one or more satisfying the requirement.
  Posted by Charlie on 2013-01-05 12:18:21
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 (8)
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