• Content count

  • Joined

  • Last visited

Community Reputation


About ThunderCloud

  • Rank
    Advanced Member

Profile Fields

  • Gender Male
  • Location New England
  1. Really?

  2. combining the primes

  3. Find the flaw: Picard's Theorem

    Ah, that was the part I missed. Thanks.
  4. Halloween Candy

    At a Halloween party, three boxes of candy were set out. Each contained 100 candies, individually wrapped in plain black wrapper. One box contained only chocolate candies, another contained only licorice candies, and the remaining box contained a blend (of unknown proportion) of chocolate and licorice candies. All three boxes were labeled, however, some prankster came by and swapped the labels on two of the boxes. How many candies would you have to sample in order to set the labels right again?
  5. Numbered Foreheads Concluded

    I think you are on the right track, and very close.
  6. Numbered Foreheads Concluded

    No. The logicians cannot agree upon a strategy in advance. However, you may assume each of them to be "perfect" in that they will deduce all that they logically can. You may further assume that each logician will assume the others to behave this way as well (i.e., that it is generally known that all three logicians are "perfect").
  7. Numbered Foreheads Concluded

    I am not sure I follow your reasoning here -- care to elaborate further?