This month's IEEE GlobalSpec Newsletter Challenge is:
Every resident of the fantastical city of Dottown has a colored dot upon his or her forehead. This dot is always either red or blue, and everyone in town knows this. In fact, this is proclaimed as a point of pride at the daily noon gathering of the entire populace.
Every day at noon, the entire town gathers together, and each person sees every other person and every other person's forehead dot. No one ever misses this gathering.
No one dies in Dottown for any reason, with one exception. If anyone knows the color of his or her own dot, that person will die that night. Everyone else will notice this at the gathering at noon the next day (and not before).
For fear of death, there are no mirrors in Dottown, and no one ever says anything about the dots, except for the formal proclamation at noon each day.
Everyone in town is extremely intelligent, so if it is possible to figure out the color of one's own dot, one will do so immediately. Unfortunately, there is no way to avoid this.
One day, after many years of peace in the town, a stranger arrives in Dottown. At the noon meeting on that day, the stranger announces to all, "There is at least one person in this town with a red dot.'' All believe this mysterious stranger. The stranger then leaves town, without saying anything further.
From this day forward, what happens to Dottown?
Note: this is a purely mathematical puzzle. There is no trick hidden in the narrative.
And the answer is:
We know, and all of the residents of Dottown know, that if there is exactly one red dot, the person with the red dot will die Night 0 (the night of Day 0) and not be there at noon on Day 1. Because the red-dotted person sees only people with blue dots on their heads each day, her or she can immediately deduce that the red dot belongs to his- or herself, and will not make it through Night 0.
Imagine two ordinary Dottown residents, JQP and JRP. If JQP sees exactly one red dot, then either (a) there is only one red dot (on JRP, say) or (b) there are exactly two red dots. If JQP sees that JRP is still alive on Day 1, JQP knows that there must be two red dots, thus JQP must have a red dot. JRP comes to the same conclusion, so JQP and JRP (the only two with red dots) die on Night 1.
Remember that all of the residents with blue dots see two red dots, so they're wondering whether there are exactly two red dots or exactly three red dots. Thus, all residents with blue dots don't die when the red-dots die. The blue-dots will notice at noon one day that all the red-dots are gone, so they will die that night.
We apply mathematical induction. We've shown what happens when R = 1 (exactly one red dot) and when R = 2. Now, assume we know what happens when R = N (for a given N), and show what happens when R = N + 1; this is the inductive step.
Let R = N. Assume that all red-dots will deduce their dot color on Day (N - 1) and die Night (N - 1), and all blue-dots will deduce their color on Day N and die Night N. This is our `given'; we've already shown this to be true for N = 1 and N = 2. What happens if R = N + 1? For a red-dot, R_v = N, but the red-dotted person doesn't know whether R = N or R = N + 1. When the red-dot sees everyone still alive on Day N, however, he or she will realize that R = N + 1; if R = N held, all the red-dot people would be gone on Day N.
Thus, the answer:
If there are N persons with red dots in Dottown, the persons with red dots will deduce their color on Day (N - 1) and die Night (N - 1). The persons with blue dots will deduce their color on Day N and die Night N.
|
Comments rated to be Good Answers:
Comments rated to be "almost" Good Answers: