• Content count

  • Joined

  • Last visited

Community Reputation


About ThunderCloud

  • Rank
    Advanced Member

Profile Fields

  • Gender
  • Location
    New England
  1. It's a theorem in complex analysis, not in real analysis. Do you know about complex numbers? Ah, that was the part I missed. Thanks.
  2. 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?
  3. We know that A sees B=334 and c=334 - A CANNOT see B=335 and C=334. (Not to confound with: "As this information in not available to him, he ASSUMES he has 334 or 335.") So my first answer was correct. In the 2nd try, I got lost and could not correct quickly enough.
  4. I think you are on the right track, and very close.
  5. 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").