This sentence is just so tricky it deserves a post of its own. Can you solve it? There are apparently two valid solutions.
In this sentence, the number of occurrences of '0' is __; of '1' is __; of '2' is __; of '3' is __; of '4' is __; of '5' is __; of '6' is __; of '7' is __; of '8' is __; and of '9' is __.
Wednesday, 22 September 2004
Subscribe to:
Post Comments (Atom)
1 comment:
Brett cheated and spoiled our fun!
Post a Comment