Alex, Brook, Cody, Dusty, and Erin recently found out that all of their birthdays were on the same day, though they are different ages.
On their mutual birthday, they were jabbering away, flapping their gums about their recent discovery. And, lucky me, I was there. Some of the things that I overheard were...
Since I knew these people and how old they were, I knew that they were not telling the whole truth.
After thinking about it, I realized that when one of them spoke to someone older, everything they said was true, but when speaking to someone younger, everything they said was false.
What is the sum of their ages?
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
@Percy Jackson, You can give me pts now :)
Uniqueness | 0 | same logic |
Latex | 10 | Great La-text! |
No Mistakes | 10 | No mistakes! |
Clarity | 10 | Clear and nice explanation! |
Time | 10 | First solution |
@Jeff Giff 's Total | 40 | Awesome! |
As a beginning we can name the characters after their initials: A=Alex, B=Brook, C=Cody, D=Dusty, and E=Erin.
Then we can check if certain combinations are impossible.
Is it possible that E is the youngest person?
No, because E would have to equal A+7, which is a contradiction if E is the youngest.
Is it possible that D is the youngest person?
No, because D would have to equal E+9, which is a contradiction if D is the youngest.
Is it possible that C is the youngest person?
No, because C would have to equal A+10, which is a contradiction if C is the youngest.
Chart of possible solutions
youngest | oldest | |||
AB | ABCDE | ABCDE | ABCDE | ABCDE |
But we can ask more questions...
Can Brook be the oldest? (btw. Alex is the youngest then because, as proved above, no one else can be the youngest.)
No. E would be greater than C, according to statement 4, but C would equal A+10 but E only A+7, which is a contradiction.
Can Alex be older than Cody?
No, A cannot be greater than C because statement 6 would have to be true but statement 6 explicitly states that C is A+10.
Therefore we know that A<C. Due to that we can deduce from claim 7 that D<B.
This also makes it impossible for Brook to be the youngest or the 2nd youngest.
Chart of possible solutions
youngest | oldest | |||
A | CDE | BCDE | BCE | CE |
As D < B and D = E + 9 are both valid, Dusty can not be the youngest or the 2nd youngest. And Erin has to be younger than him.
In addition to that, Cody has to be the oldest as Brook has been proven to not be the oldest, Erin has to be younger than Dusty, and Dusty is supposed to be younger than Brook. And Alex has been proven to be the youngest.
This gives us only one possible solution.
youngest | oldest | |||
A | E | D | B | C |
A | A+7 | A+16 | 1.7A | A+25 |
Can it withstand all claims?
There is not contradiction in these statements. Now we only need to solve for A.
First equation:
A + 1 6 < 1 . 7 ⋅ A 1 6 < 0 . 7 ⋅ A 2 2 . 8 5 < A
Second equation:
1 . 7 ⋅ A < A + 2 5 0 . 7 ⋅ A < 2 5 A < 3 5 . 7
We know that all ages are integers. But 1.7 x n can only be an integer if n is a multiple of 10.
As there is only one multiple of 10 in the interval 23<A<35, we know that A=30.
A = 3 0 E = A + 7 = 3 0 + 7 = 3 7 D = A + 1 6 = 3 0 + 7 = 4 6 B = A ⋅ 1 . 7 = 3 0 ⋅ 1 . 7 = 5 1 C = A + 2 5 = 3 0 + 2 5 = 5 5
Now we only need to add those up...
A + E + D + B + C = 3 0 + 3 7 + 4 6 + 5 1 + 5 5 = 2 1 9
The sum of their ages is 219.
Uniqueness | 0 | same logic |
Latex | 10 | Great La-text! |
No Mistakes | 10 | No mistakes! |
Clarity | 10 | Clear and nice explanation! |
Time | 8 | 3rd solution |
@Lorenz W. 's Total | 38 | Awesome! |
Let the age of Alex, Brook, Cody, Dusty, and Erin be A , B , C , D and E
Above statements can be translated as follows : D < B ⇔ D = E + 9 . . . . . . . . . . [ 1 ] E < B ⇔ E = A + 7 . . . . . . . . . . [ 2 ] A < B ⇔ B = 1 0 1 7 A . . . . . . . . . . [ 3 ] B < C ⇔ E < C . . . . . . . . . . [ 4 ] C < D ⇔ ∣ C − D ∣ = 6 . . . . . . . . . . [ 5 ] C < A ⇔ C = A + 1 0 . . . . . . . . . . [ 6 ] C < A ⇔ B < D . . . . . . . . . . [ 7 ] B < C ⇔ ∣ C − D ∣ = ∣ E − D ∣ . . . . . . . . . . [ 8 ] In [ 6 ] there are 3 cases
Case 1 : C < D is t r u e ⇒ C = A + 1 0
⇒ statement [ 6 ] is c o n t r a d i c t e d
Case 2 : C = A + 1 0 is t r u e ⇒ C < D
⇒ statement [ 6 ] is c o n t r a d i c t e d
Case 3 : C < A and C = A + 1 0 both are f a l s e
⇒ statement [ 6 ] is c o r r e c t
Therefore the only possible case is the third case.
So, C > A ⇒ D < B ⇒ D > E ⇒ E < B ⇒ E > A From [ 6 ] , [ 7 ] , [ 1 ] and [ 2 ] we get C > B > D > E > A . . . . . . . . . . [ α ] And E − A = 7 . . . . . . . . . . [ I ] D − E = 9 . . . . . . . . . . [ I I ] C − D = 9 . . . . . . . . . . [ I I I ] [ I ] + [ I I ] ⇒ D − A = 7 + 9 = 7 + ( 1 0 − 1 ) = 1 7 − 1 = 1 6 . . . . . . . . . . [ I V ] [ I I I ] + [ I V ] ⇒ C − A = 1 6 + 9 = 1 6 + ( 1 0 − 1 ) = 2 6 − 1 = 2 5 . . . . . . . . . . [ V ] Subtracting A in [ α ] C − A > B − A > D − A > 0 . . . . . . . . . . [ β ] From [ 3 ] , [ β ] , [ I V ] and [ V ] we get 2 5 > 1 0 1 7 A − A > 1 6 > 0 2 5 > 1 0 7 A > 1 6 > 0 ∵ 1 0 1 7 A − A = 1 0 1 7 A − 1 0 A = 1 0 7 A Now as ( B − A ) ∈ Z + ; B − A = 7 × 1 0 1 A ⇒ 7 ∣ ( B − A )
Now as 2 1 is the only multiple 7 between 1 6 and 2 5 ⇒ B − A = 2 1 1 0 7 A = 2 1 ∵ B − A = 1 0 7 A s e e [ 3 ] A = 2 1 × 7 1 0 = 1 0 × 7 2 1 = 1 0 × 3 = 3 0 A = 3 0 From [ 3 ] B = 1 0 1 7 A = 1 0 1 7 × 3 0 = 1 7 × 3 = 5 1 ⇒ B = 5 1 From [ I ] E − A = 7 ⇒ E = 7 + A ⇒ E = 3 0 + 7 = 3 7 ⇒ E = 3 7 From [ I I ] D − E = 9 ⇒ D = 9 + E = 9 + 3 7 = 4 6 ⇒ D = 4 6 From [ I I I ] C − D = 9 ⇒ C = 9 + D = 9 + 4 6 = 5 5 ⇒ C = 5 5 Therefore, A + B + C + D + E = 3 0 + 5 1 + 5 5 + 4 6 + 3 7 = 2 1 9
Uniqueness | 3 | A is found by a bit different logic! |
Latex | 10 | Great La-text! |
No Mistakes | 10 | No mistakes! |
Clarity | 10 | Clear and nice explanation! |
Time | 9 | 2nd solution |
@Zakir Husain 's Total | 42 | Awesome! |
Problem Loading...
Note Loading...
Set Loading...
Let’s name the characters’ ages after their initials: A , B , C , D , E .
Look at this sentence.
If Cody’s the younger one, he is telling the t r u t h . This leads to a contradiction so Cody is older, i.e. C > A .
Now we know that the statements
are f a l s e , ergo Brook is older than Dusty( B > D ).
Now since Brook’s older than Dusty, the statement
Is t r u e .
Now we know C > B > D > E and C > A .
This is obviously true. So now we know C > B > D > E > A .
So these are the t r u e statements:
So these give us a set of equations:(the numbers in the brackets are the lines in the quote for reference) ⎩ ⎪ ⎪ ⎪ ⎨ ⎪ ⎪ ⎪ ⎧ D = E + 9 , ( 1 ) E = A + 7 , ( 2 ) C = D + 9 = E + 1 8 = A + 2 5 , ( 1 , 2 , 5 ) 1 7 0 % A = B . ( 3 ) Now look at those two equations: C = A + 2 5 , 1 7 0 % A = B , D + 9 = A + 2 5 ( D = A + 1 6 ) . Look at the inequality from the last section(the age sequence) to get A + 2 5 > 1 7 0 % A > A + 1 6 . Since we assume the ages are all integers, A must be divisible by 10 for 170%A to be an integer. So A = 3 0 , and everyone’s ages are C = 5 5 , B = 5 1 , D = 4 6 , E = 3 7 , A = 3 0 . So the answer is 5 5 + 5 1 + 4 6 + 3 7 + 3 0 = 2 1 9 .