T H _
M _ X _ M _ M
N _ M B _ R
_ F
B _ N _ N _ S
T H _ T
C _ N
B _
T R _ N S F _ R R _ D
_ S
5 3 3 .
I F
W _
T R _ N S P _ R T
1 0 0 0
B _ N _ N _ S
_ T
_
T _ M _ ,
T H _
C _ M _ L
W _ L L
C _ N S _ M _
_ L L
T H _
B _ N _ N _ S
B Y
T H _
T _ M _
_ T
R _ _ C H _ S
T H _
D _ S T _ N _ T _ _ N .
S _ ,
W _
N _ _ D
T _
H _ V _
_ N T _ R M _ D _ _ T _
D R _ P
P _ _ N T S ,
T H _
C _ M _ L
C _ N
T H _ N
M _ K _
S _ V _ R _ L
S H _ R T
T R _ P S
_ N
B _ T W _ _ N .
T _
B _
_ P T _ M _ L ,
W _
T R Y
T _
M _ _ N T _ _ N
T H _
N _ M B _ R
_ F
B _ N _ N _ S
_ T
_ _ C H
P _ _ N T
T _
B _
_
M _ L T _ P L _
_ F
1 0 0 0 ,
_ S
T H _ T ' S
T H _
M _ X _ M _ M
_ F
B _ N _ N _ S
T H _
C _ M _ L
C _ N
T R _ N S P _ R T
_ T
_ N Y
P _ _ N T
_ F
T _ M _ .
S _ _ R C _ - - - I P 1 - - - I P 2 - - - - D _ S T _ N _ T _ _ N
3 0 0 0
X
K M
2 0 0 0
Y
K M
1 0 0 0
Z
K M
T _
G _
F R _ M
S _ _ R C _
T _
I P 1
P _ _ N T
C _ M _ L
H _ S
T _
T _ K _
_
T _ T _ L
_ F
5
T R _ P S ,
3
F _ R W _ R D
_ N D
2
B _ C K W _ R D S ,
S _ N C _
W _
H _ V _
3 0 0 0
B _ N _ N _ S
T _
T R _ N S P _ R T .
T H _
S _ M _
W _ Y
F R _ M
I P 1
T _
I P 2
C _ M _ L
H _ S
T _
T _ K _
_
T _ T _ L
_ F
3
T R _ P S ,
2
F _ R W _ R D
_ N D
1
B _ C K W _ R D ,
S _ N C _
W _
H _ V _
2 0 0 0
B _ N _ N _ S
T _
T R _ N S P _ R T .
F R _ M
I P 2
T _
D _ S T _ N _ T _ _ N
W _
_ N L Y
H _ V _
1
F _ R W _ R D
M _ V _ .
L _ T ' S
S _ _
T H _
T _ T _ L
N _ M B _ R
_ F
B _ N _ N _ S
C _ N S _ M _ D
_ T
_ V _ R Y
P _ _ N T .
F R _ M
T H _
S _ _ R C _
T _
I P 1
_ T S
5 X
B _ N _ N _ S ,
_ S
T H _
D _ S T _ N C _
B _ T W _ _ N
T H _
S _ _ R C _
_ N D
I P 1
_ S
X
K M
_ N D
T H _
C _ M _ L
H _ D
5
T R _ P S .
F R _ M
I P 1
T _
I P 2
_ T S
3 Y
B _ N _ N _ S ,
_ S
T H _
D _ S T _ N C _
B _ T W _ _ N
I P 1
_ N D
I P 2
_ S
Y
K M
_ N D
T H _
C _ M _ L
H _ D
3
T R _ P S .
F R _ M
I P 2
T _
D _ S T _ N _ T _ _ N
_ T S
Z
B _ N _ N _ S .
W _
C _ N
N _ W
C _ L C _ L _ T _
T H _
D _ S T _ N C _
B _ T W _ _ N
T H _
P _ _ N T S :
3 0 0 0
-
5 X
=
2 0 0 0
S _
W _
G _ T
X
=
2 0 0
2 0 0 0 - 3 Y
=
1 0 0 0
S _
W _
G _ T
Y
=
3 3 3 . 3 3
B _ T
H _ R _
T H _
D _ S T _ N C _
_ S
_ L S _
T H _
N _ M B _ R
_ F
B _ N _ N _ S
_ N D
_ T
C _ N N _ T
B _
F R _ C T _ _ N
S _
W _
T _ K _
Y
=
3 3 3
_ N D
_ T
I P 2
W _
H _ V _
T H _
N _ M B _ R
_ F
B _ N _ N _ S
_ Q _ _ L
1 0 0 1 ,
S _
_ T S
2 0 0 0 - 3 Y
=
1 0 0 1
S _
T H _
R _ M _ _ N _ N G
D _ S T _ N C _
T _
T H _
M _ R K _ T
_ S
1 0 0 0
-
X
-
Y
=
Z
_ . _
1 0 0 0 - 2 0 0 - 3 3 3
=
Z
=
4 6 7 .
F R _ M
I P 2
T _
T H _
D _ S T _ N _ T _ _ N
P _ _ N T ,
T H _
C _ M _ L
C _ N S _ M _ S
4 6 7
B _ N _ N _ S
_ N D
5 3 3
B _ N _ N _ S
R _ M _ _ N .
R _ F _ R _ N C _ :
A
C _ M _ L
T R _ N S P _ R T _ N G
B _ N _ N _ S
-
P _ Z Z L _ N G
S T _ C K
E X C H _ N G _ Clue
THE MAXIMUM NUMBER OF BANANAS THAT CAN BE TRANSFERRED IS 533. IF WE TRANSPORT 1000 BANANAS AT A TIME, THE CAMEL WILL CONSUME ALL THE BANANAS BY THE TIME IT REACHES THE DESTINATION. SO, WE NEED TO HAVE INTERMEDIATE DROP POINTS, THE CAMEL CAN THEN MAKE SEVERAL SHORT TRIPS IN BETWEEN. TO BE OPTIMAL, WE TRY TO MAINTAIN THE NUMBER OF BANANAS AT EACH POINT TO BE A MULTIPLE OF 1000, AS THAT'S THE MAXIMUM OF BANANAS THE CAMEL CAN TRANSPORT AT ANY POINT OF TIME. SOURCE---IP1---IP2----DESTINATION 3000 X KM 2000 Y KM 1000 Z KM TO GO FROM SOURCE TO IP1 POINT CAMEL HAS TO TAKE A TOTAL OF 5 TRIPS, 3 FORWARD AND 2 BACKWARDS, SINCE WE HAVE 3000 BANANAS TO TRANSPORT. THE SAME WAY FROM IP1 TO IP2 CAMEL HAS TO TAKE A TOTAL OF 3 TRIPS, 2 FORWARD AND 1 BACKWARD, SINCE WE HAVE 2000 BANANAS TO TRANSPORT. FROM IP2 TO DESTINATION WE ONLY HAVE 1 FORWARD MOVE. LET'S SEE THE TOTAL NUMBER OF BANANAS CONSUMED AT EVERY POINT. FROM THE SOURCE TO IP1 ITS 5X BANANAS, AS THE DISTANCE BETWEEN THE SOURCE AND IP1 IS X KM AND THE CAMEL HAD 5 TRIPS. FROM IP1 TO IP2 ITS 3Y BANANAS, AS THE DISTANCE BETWEEN IP1 AND IP2 IS Y KM AND THE CAMEL HAD 3 TRIPS. FROM IP2 TO DESTINATION ITS Z BANANAS. WE CAN NOW CALCULATE THE DISTANCE BETWEEN THE POINTS: 3000 - 5X = 2000 SO WE GET X = 200 2000-3Y = 1000 SO WE GET Y = 333.33 BUT HERE THE DISTANCE IS ALSO THE NUMBER OF BANANAS AND IT CANNOT BE FRACTION SO WE TAKE Y = 333 AND AT IP2 WE HAVE THE NUMBER OF BANANAS EQUAL 1001, SO ITS 2000-3Y = 1001 SO THE REMAINING DISTANCE TO THE MARKET IS 1000 - X - Y = Z I.E 1000-200-333 = Z = 467. FROM IP2 TO THE DESTINATION POINT, THE CAMEL CONSUMES 467 BANANAS AND 533 BANANAS REMAIN. REFERENCE: A CAMEL TRANSPORTING BANANAS - PUZZLING STACK EXCHANGE FIRST HEAP: 22, SECOND HEAP: 14, THIRD HEAP: 12. TO SOLVE THIS PROBLEM, WE SHALL HAVE TO START FROM THE END. WE HAVE BEEN TOLD THAT AFTER ALL THE TRANSPOSITIONS, THE NUMBER OF MATCHES IN EACH HEAP IS THE SAME. LET US PROCEED FROM THIS FACT. SINCE THE TOTAL NUMBER OF MATCHES HAS NOT CHANGED IN THE PROCESS, AND THE TOTAL NUMBER BEING 48, IT FOLLOWS THAT THERE WERE 16 MATCHES IN EACH HEAP. AND SO, IN THE END WE HAVE: FIRST HEAP: 16, SECOND HEAP: 16, THIRD HEAP: 16 IMMEDIATELY BEFORE THIS WE HAVE ADDED TO THE FIRST HEAP AS MANY MATCHES AS THERE WERE IN IT, I.E. WE HAD DOUBLED THE NUMBER. SO, BEFORE THE FINAL TRANSPOSITION, THERE ARE ONLY 8 MATCHES IN THE FIRST HEAP. NOW, IN THE THIRD HEAP, FROM WHICH WE TOOK THESE 8 MATCHES, THERE WERE: 16 + 8 = 24 MATCHES. WE NOW HAVE THE NUMBERS AS FOLLOWS: FIRST HEAP: 8, SECOND HEAP: 16, THIRD HEAP: 24. WE KNOW THAT WE TOOK FROM THE SECOND HEAP AS MANY MATCHES AS THERE WERE IN THE THIRD HEAP, WHICH MEANS 24 WAS DOUBLE THE ORIGINAL NUMBER. FROM THIS WE KNOW HOW MANY MATCHES WE HAD IN EACH HEAP AFTER THE FIRST TRANSPOSITION: FIRST HEAP: 8, SECOND HEAP: 16 + 12 = 28, THIRD HEAP: 12. NOW WE CAN DRAW THE FINAL CONCLUSION THAT BEFORE THE FIRST TRANSPOSITION THE NUMBER OF MATCHES IN EACH HEAP WAS: FIRST HEAP: 22, SECOND HEAP: 14, THIRD HEAP: 12 THE CHILDREN ARE 1, 6 AND 6 YEARS OLD. THE PRODUCT OF THEIR AGES IS 36, SO NONE OF THEM CAN BE OLDER THAN 36. THE NUMBER 36 HAS TO BE EXPRESSED AS THE PRODUCT OF 3 NUMBERS. THEIR POSSIBLE AGES ARE (THE SUM OF THEIR AGES IS IN BRACKETS): 1, 1, 36 (3938) 1, 2, 18 (21) 1, 3, 12 (16) 1, 4, 9 (14) 1, 6, 6 (13) 2, 2, 9 (13) 2, 3, 6 (11) 3, 3, 4 (10) SINCE CHERYL IS TOM'S NEXT DOOR NEIGHBOUR, TOM KNOWS CHERYL'S HOUSE NUMBER. TOM WOULD KNOW THE CHILDREN'S AGES IN EVERY CASE THAT SUMS UP TO A UNIQUE NUMBER EXCEPT FOR THE SUM OF 13, WHICH HAVE 2 COMBINATIONS OF POSSIBLE AGES. AS A RESULT, TOM WOULD BE CONFUSED AS HE HAS TO PICK BETWEEN THE 2 COMBINATIONS: (1,6,6) AND (2,2,9). CHERYL THEN TELLS TOM ABOUT HER YOUNGEST CHILD WHO LIKES STRAWBERRY MILK WHICH TELLS TOM THAT THERE IS ONLY 1 YOUNGEST CHILD 50 STATEMENTS ARE CORRECT AND 50 ARE INCORRECT. STATEMENTS 1 TO 50 ARE TRUE AND STATEMENTS 51 TO 100 ARE FALSE. IF ANY ONE OF THE STATEMENTS IS TRUE, THEN ALL OF THE STATEMENTS NUMBERED LOWER THAN THAT ONE MUST ALSO BE TRUE, BECAUSE THE TERM "AT LEAST" IS INCLUSIVE OF A FEWER NUMBER, AND THEY ARE NUMBERED IN ASCENDING ORDER. ASSUMING STATEMENT 1 IS TRUE; THEN STATEMENT 100 IS FALSE. ASSUMING STATEMENTS 1-2 ARE TRUE; THEN STATEMENTS 99-100 ARE FALSE. ASSUMING STATEMENTS 1-3 ARE TRUE; THEN STATEMENTS 98-100 ARE FALSE. ASSUMING STATEMENTS 1-4 ARE TRUE; THEN STATEMENTS 97-100 ARE FALSE. ... ASSUMING STATEMENTS 1-50 ARE TRUE; THEN STATEMENTS 51-100 ARE FALSE. STATEMENT 99 WILL BE THE ONLY CORRECT STATEMENT IF THE TERMS "AT LEAST" ARE REPLACED WITH THE TERM "EXACTLY.", E.G. "EXACTLY 99 OF THESE STATEMENTS ARE FALSE."