Leave a Reply

1 Comment threads
1 Thread replies
Most reacted comment
Hottest comment thread
2 Comment authors
newest oldest most voted
Notify of
Zaid Bin Nafees

The solution can be seen with a reasonable argument. let k=no. of green eyed people If k = 1, the person will recognize that they alone have green eyes (by seeing only non-green eyes in the others) and leave at the first dawn. If k = 2, no one will leave at the first dawn. The two green-eyed people, seeing only one person with green eyes, and that no one left on the 1st dawn (and thus that k > 1), will leave on the second dawn. Inductively, it can be reasoned that no one will leave at the first… Read more »