Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Path: utzoo!linus!decvax!harpo!seismo!hao!hplabs!sri-unix!Foonberg@AEROSPACE
From: Foonberg@AEROSPACE@sri-unix.UUCP
Newsgroups: net.ai
Subject: Another Puzzle
Message-ID: <5423@sri-arpa.UUCP>
Date: Wed, 24-Aug-83 18:36:00 EDT
Article-I.D.: sri-arpa.5423
Posted: Wed Aug 24 18:36:00 1983
Date-Received: Sun, 18-Sep-83 23:51:11 EDT
Lines: 18

From:  Foonberg at AEROSPACE (Alan Foonberg)

                 [Reprinted from the Prolog Digest.]

I was glancing at an old copy of Games magazine and came across the 
following puzzle:

Can you find a ten digit number such that its left-most digit tells 
how many zeroes there are in the number, its second digit tells how 
many ones there are, etc.?

For example, 6210001000.  There are 6 zeroes, 2 ones, 1 two, no 
threes, etc. I'd be interested to see any efficient solutions to this
fairly simple problem. Can you derive all such numbers, not only
ten-digit numbers?  Feel free to make your own extensions to this
problem.

Alan