The Math Forum

Search All of the Math Forum:

Views expressed in these public forums are not endorsed by NCTM or The Math Forum.

Math Forum » Discussions » sci.math.* » sci.math

Notice: We are no longer accepting new posts, but the forums will continue to be readable.

Topic: "Impossible Problem"
Replies: 1   Last Post: Jun 14, 1996 4:03 AM

Advanced Search

Back to Topic List Back to Topic List Jump to Tree View Jump to Tree View  
Joel Neely

Posts: 1
Registered: 12/12/04
Re: "Impossible Problem"
Posted: Jun 14, 1996 4:03 AM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic Reply

Brian Raiter wrote:
> A similar problem
> Fill in the blanks so as to make this whole page logically
> self-consistent.
> On this page, the digit zero appears times.

> " nine " times.
> Clifford Pickover describes this problem, and mentions that Martin
> Gardner has shown that there is only one solution.

And an interesting approach (described, I think, in a Sci Am article
by MG) is to treat the set of sentences as a function mapping from
10-tuples to 10-tuples. I.e., fill in the blanks with the values of
the argument 10-tuple, then count the digits to get the resultant

Now iterate.

Depending on the initial value, the iteration will either cycle
through a set of tuples (length > 1) or converge to a solution
tuple (i.e., a cycle of length 1).

Someone with better discrete dynamical systems skills than I have
might address the question of which properties of an initial value
could be used to predict which kind of basic that initial tuple
lies in.

Point your RSS reader here for a feed of the latest messages in this topic.

[Privacy Policy] [Terms of Use]

© The Math Forum at NCTM 1994-2018. All Rights Reserved.