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 » Online Projects » pow-teach

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

Topic: 12 dwarves problem: need help.
Replies: 2   Last Post: Aug 9, 2001 12:05 PM

Advanced Search

Back to Topic List Back to Topic List Jump to Tree View Jump to Tree View   Messages: [ Previous | Next ]

Posts: 1
Registered: 12/3/04
12 dwarves problem: need help.
Posted: May 19, 2001 4:20 PM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic Reply

Could anybody help me to solve the following problem?

There were 12 dwarves living in a florest and each of them lives in a
house that is painted blue or red. At the month "i" the dwarf number
"i" visits all his friends and if most of his friends have their
houses painted with one color diferent from his one, he join them by
changing the color of his own house. This process continues on the
next months. Prove that someday the dwarves will not need to change
the color of their houses. (The friendships are mutual and don't
change over the time).

Thanks in advance.


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.