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

 Self-Descriptor part 2 (Posted on 2002-10-11)

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)

 Subject Author Date answer K Sengupta 2007-03-08 12:17:48 re(2): Solution part 2 Happy 2002-10-14 05:39:14 re: Solution part 1 (Definitions and rules) TomM 2002-10-12 06:35:35 re: Solution part 2 TomM 2002-10-12 06:28:04 Solution part 1 (Definitions and rules) TomM 2002-10-12 06:26:19 re(2): Is this right? Nick Reed 2002-10-12 05:26:03 re: Is this right? levik 2002-10-12 05:12:42 Is this right? Aeternus 2002-10-11 21:47:18

 Search: Search body:
Forums (0)