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

Home > Numbers
Self-Descriptor part 2 (Posted on 2002-10-11) Difficulty: 3 of 5

In Self-Descriptor, we found a number ABCDEFGHIJ such that A is the count of how many 0's are in the number, B is the number of 1's, and so on.

I wonder... what if the number didn't have to be 10 digits long?

Find the smallest whole number such that the left-most digit describes the number of 0s in the number, the next digit describes the 1s, etc. Prove that it's the smallest.

See The Solution Submitted by Happy    
Rating: 3.3333 (6 votes)

Comments: ( Back to comment list | You must be logged in to post comments.)
answer Comment 8 of 8 |
The minimum number satisfying all the provisions inclusive of the problem under reference is 1210.
  Posted by K Sengupta on 2007-03-08 12:17:48
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 (4)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

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