All the information you need is available to you

Logic Level 3
  • Alex and Bob meet on the street.
  • Alex tells Bob that he has three children.
  • Bob asks how old they are.
  • Alex tells him that the product of the ages of his children is 36, and the sum of their ages is equal to the number of houses on the other side of the street.
  • Bob counts the number of houses and then says that this is not enough information for him to solve the problem.
  • Alex then tells Bob that his oldest child's eyes are blue.

How old are Alex's children?

9, 2, 2 3, 3, 4 36, 1, 1 18, 2, 1 6, 3, 2

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.

1 solution

Tarjan Tamas
Oct 30, 2016

Consider all possible sets of three natural numbers where the product of these numbers is 36.

  • 2, 2, 9; SUM = 13
  • 2, 3, 6; SUM = 11
  • 1, 1, 36; SUM = 38
  • 1, 3, 12; SUM = 16
  • 1, 6, 6; SUM = 13
  • 3, 3, 4; SUM = 10
  • 1, 2, 18; SUM = 21
  • 1, 4, 9; SUM = 14

It's evident that only two of these sets have the same sum: 1, 6, 6; SUM = 13 and 2, 2, 9; SUM = 13. When Bob counts the number of houses, any number other than 13 would have identified the solution, which means that because he said this still wasn't enough information, there had to have been 13 houses. After that Alex reveals that he has an oldest son, therefore his children are 2, 2 and 9 years old.

Good explanation for how to use the information "his oldest child's eyes are blue".

Calvin Lin Staff - 4 years, 7 months ago

maybe add that two of the children are twins or something because when you think about it if two people are the same age it doesn't necessarily mean they were born on the same day. Sorry for being pedantic but that's what I thought when I first saw the question.

Wen Z - 4 years, 7 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...