L _ T ' S
_ S S _ M _
T H _ T
T H _ R _
_ S
_ N L Y
1
C H _ _ T _ N G
H _ S B _ N D .
T H _ N
H _ S
W _ F _
D _ _ S N ' T
S _ _
_ N Y B _ D Y
C H _ _ T _ N G ,
S _
S H _
K N _ W S
H _
C H _ _ T S ,
_ N D
S H _
W _ L L
K _ L L
H _ M
T H _ T
V _ R Y
D _ Y .
N _ W ,
L _ T ' S
S _ Y
T H _ T
T H _ R _
_ R _
2
C H _ _ T _ N G
H _ S B _ N D S .
T H _ R _
W _ L L
B _
9 8
W _ M _ N
_ N
T H _
T _ W N
W H _
K N _ W
W H _
T H _
2
C H _ _ T _ R S
_ R _ .
T H _
2
W _ V _ S ,
W H _
_ R _
B _ _ N G
C H _ _ T _ D
_ N ,
W _ _ L D
T H _ N K
T H _ T
T H _ R _
_ S
_ N L Y
1
C H _ _ T _ R
_ N
T H _
T _ W N .
S _ N C _
N _ _ T H _ R
_ F
T H _ S _
2
W _ M _ N
K N _ W
T H _ T
T H _ _ R
H _ S B _ N D S
_ R _
C H _ _ T _ R S ,
T H _ Y
B _ T H
D _
N _ T
R _ P _ R T
T H _ _ R
H _ S B _ N D S
_ N
_ N
T H _
D _ Y
_ F
T H _
_ N N _ _ N C _ M _ N T .
T H _
N _ X T
D _ Y ,
W H _ N
T H _
2
W _ M _ N
S _ _
T H _ T
N _
H _ S B _ N D
W _ S
_ X _ C _ T _ D ,
T H _ Y
R _ _ L _ Z _
T H _ T
T H _ R _
C _ _ L D
_ N L Y
B _
_ N _
_ X P L _ N _ T _ _ N
-
B _ T H
T H _ _ R
H _ S B _ N D S
_ R _
C H _ _ T _ R S .
T H _ S ,
_ N
T H _
S _ C _ N D
D _ Y ,
2
H _ S B _ N D S
_ R _
_ X _ C _ T _ D .
T H R _ _ G H
M _ T H _ M _ T _ C _ L
_ N D _ C T _ _ N ,
_ T
C _ N
B _
P R _ V _ D
T H _ T
W H _ N
T H _ S
L _ G _ C
_ S
_ P P L _ _ D
T _
N
C H _ _ T _ N G
H _ S B _ N D S ,
T H _ Y
_ L L
D _ _
_ N
T H _
N
T H
D _ Y
_ F T _ R
T H _
Q _ _ _ N ' S
_ N N _ _ N C _ M _ N T .
S _
W _ T H
1 0 0
C H _ _ T _ N G
H _ S B _ N D S ,
_ L L
_ F
T H _ M
W _ L L
B _
_ X _ C _ T _ D
_ N
T H _
1 0 0 T H
D _ Y Clue
LET'S ASSUME THAT THERE IS ONLY 1 CHEATING HUSBAND. THEN HIS WIFE DOESN'T SEE ANYBODY CHEATING, SO SHE KNOWS HE CHEATS, AND SHE WILL KILL HIM THAT VERY DAY. NOW, LET'S SAY THAT THERE ARE 2 CHEATING HUSBANDS. THERE WILL BE 98 WOMEN IN THE TOWN WHO KNOW WHO THE 2 CHEATERS ARE. THE 2 WIVES, WHO ARE BEING CHEATED ON, WOULD THINK THAT THERE IS ONLY 1 CHEATER IN THE TOWN. SINCE NEITHER OF THESE 2 WOMEN KNOW THAT THEIR HUSBANDS ARE CHEATERS, THEY BOTH DO NOT REPORT THEIR HUSBANDS IN ON THE DAY OF THE ANNOUNCEMENT. THE NEXT DAY, WHEN THE 2 WOMEN SEE THAT NO HUSBAND WAS EXECUTED, THEY REALIZE THAT THERE COULD ONLY BE ONE EXPLANATION - BOTH THEIR HUSBANDS ARE CHEATERS. THUS, ON THE SECOND DAY, 2 HUSBANDS ARE EXECUTED. THROUGH MATHEMATICAL INDUCTION, IT CAN BE PROVED THAT WHEN THIS LOGIC IS APPLIED TO N CHEATING HUSBANDS, THEY ALL DIE ON THE N TH DAY AFTER THE QUEEN'S ANNOUNCEMENT. SO WITH 100 CHEATING HUSBANDS, ALL OF THEM WILL BE EXECUTED ON THE 100TH DAY IF THERE WAS ONLY ONE BLUE-EYED PERSON ON THE ISLAND, THEN THAT PERSON WOULD LOOK AROUND AND SEE THAT THERE IS NO OTHER BLUE-EYED PERSON. SO HE REALIZES THAT HE IS THE ONLY PERSON WITH BLUE EYES ON THE ISLAND AND LEAVES ON THE DAY OF THE ANNOUNCEMENT. IF THERE ARE 2 BLUE-EYED PEOPLE, THEN THEY LOOK AT EACH OTHER. EACH ONE EXPECTS THE OTHER TO LEAVE ON THE DAY OF THE ANNOUNCEMENT. HOWEVER, ON THE NEXT DAY, WHEN THEY REALIZE THAT NEITHER OF THEM LEFT THE ISLAND, THEY WOULD BE ABLE TO DEDUCE THAT BOTH OF THEM HAVE BLUE EYES. THEY BOTH LEAVE THE ISLAND ON THE SECOND DAY. THROUGH MATHEMATICAL INDUCTION, THIS LOGIC CAN BE APPLIED TO THE 100 BLUE-EYED PEOPLE ON THE ISLAND. SO ON THE 100TH DAY, ALL THE 100 BLUE-EYED PEOPLE LEAVE THE ISLAND THE ELDEST IS 8 YEARS OLD AND THE 2 YOUNGER ONES ARE 3 YEARS OLD. LET'S BREAK IT DOWN. THE PRODUCT OF THEIR AGES IS 72. SO THE POSSIBLE CHOICES ARE: 2, 2, 18 - SUM(2, 2, 18) = 22 2, 4, 9 - SUM(2, 4, 9) = 15 2, 6, 6 - SUM(2, 6, 6) = 14 2, 3, 12 - SUM(2, 3, 12) = 17 3, 4, 6 - SUM(3, 4, 6) = 13 3, 3, 8 - SUM(3, 3, 8 ) = 14 1, 8, 9 - SUM(1,8,9) = 18 1, 3, 24 - SUM(1, 3, 24) = 28 1, 4, 18 - SUM(1, 4, 18) = 23 1, 2, 36 - SUM(1, 2, 36) = 39 1, 6, 12 - SUM(1, 6, 12) = 19 THE SUM OF THEIR AGES IS THE SAME AS YOUR BIRTH DATE. THAT COULD BE ANYTHING FROM 1 TO 31 BUT THE FACT THAT JACK WAS UNABLE TO FIND OUT THE AGES, IT MEANS THERE ARE TWO OR MORE COMBINATIONS WITH THE SAME SUM. FROM THE CHOICES ABOVE, ONLY TWO OF THEM ARE POSSIBLE NOW. 2, 6, 6 - SUM(2, 6, 6) = 14 3, 3, 8 - SUM(3, 3, 8 ) = 14 SINCE THE ELDEST KID IS TAKING PIANO LESSONS, WE CAN ELIMINATE COMBINATION 1 SINCE THERE ARE TWO ELDEST ONES. THE ANSWER IS 3, 3 AND 8 BRUCE TAKES 9 OF HIS 10 CIGARETTE BUTTS AND TURNS THEM INTO 3 CIGARETTES TOTAL (3 CIGARETTE BUTTS CAN BE TURNED INTO 1 CIGARETTE). HE SMOKES ALL THREE OF THESE, AND NOW HE HAS 4 CIGARETTE BUTTS. HE THEN TURNS 3 OF THE 4 CIGARETTE BUTTS INTO ANOTHER CIGARETTE AND SMOKES IT. HE HAS NOW SMOKED 4 CIGARETTES AND HAS 2 CIGARETTE BUTTS. AND FINALLY HE GOES AND BORROWS ONE OF TOM'S CIGARETTE BUTTS. WITH THIS CIGARETTE BUTT PLUS THE 2 HE ALREADY HAS, HE IS ABLE TO MAKE HIS 5TH CIGARETTE TO SMOKE. AFTER SMOKING IT, HE IS LEFT WITH 1 CIGARETTE BUTT, WHICH HE PUTS BACK IN TOM'S PILE SO THAT TOM WON'T FIND ANYTHING MISSING