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: ( You must be logged in to post comments.)
  Subject Author Date
re: Old-fogey logicbroll2011-01-30 12:57:50
SolutionOld-fogey logicSteve Herman2011-01-30 11:24:05
Some ThoughtsPossible solutionbroll2011-01-30 03:59:41
Please log in:
Remember me:
Sign up! | Forgot password

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

Copyright © 2002 - 2019 by Animus Pactum Consulting. All rights reserved. Privacy Information