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

Home > Numbers
Start as you wish (Posted on 2011-01-29) Difficulty: 4 of 5
For any k-digit number M there exist a number n such that the string of first k digits of 2^n equals M .

Prove it.

No Solution Yet Submitted by Ady TZIDON    
No Rating

Comments: ( Back to comment list | You must be logged in to post comments.)
re: Old-fogey logic Comment 3 of 3 |
(In reply to Old-fogey logic by Steve Herman)

Quite brilliant. Congratulations!


  Posted by broll on 2011-01-30 12:57:50
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 (10)
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