AMC 10 Step by Step

2022 AMC 10A Problem 12

P11-15~5 minPrint

On Halloween, 3131 children walked into the principal's office asking for candy. They can be classified into three types: Some always lie; some always tell the truth; and some alternately lie and tell the truth. The alternaters arbitrarily choose their first response, either a lie or the truth, but each subsequent statement has the opposite truth value from its predecessor. The principal asked everyone the same three questions in this order.

"Are you a truth-teller?" The principal gave a piece of candy to each of the 2222 children who answered yes.

"Are you an alternater?" The principal gave a piece of candy to each of the 1515 children who answered yes.

"Are you a liar?" The principal gave a piece of candy to each of the 99 children who answered yes.

How many pieces of candy in all did the principal give to the children who always tell the truth?

Log in to save your progress.
Show solution without answering

Key insight

Write down how each kind of child answers the three questions. Truth-tellers say yes, no, no; liars say yes, yes, no; alternaters say no, no, no or yes, yes, yes.

Solution

Step 1: how does each kind of child answer? The true answers to "Are you a truth-teller / an alternater / a liar?" depend on the child, and then we apply lying or not.

  • A truth-teller answers honestly: yes, no, no.
  • A liar's honest answers would be no, no, yes; a liar says the opposite: yes, yes, no.
  • An alternater who starts with the truth: question 1 honestly "no"; question 2 is a lie, so "no" (the truth is yes); question 3 honestly "no". So: no, no, no.
  • An alternater who starts with a lie: question 1 "yes" (a lie); question 2 honestly "yes"; question 3 "yes" (a lie). So: yes, yes, yes.
Kind of childQ1Q2Q3
Truth-telleryesnono
Liaryesyesno
Alternater, truth firstnonono
Alternater, lie firstyesyesyes

Step 2: count, starting with the question the fewest kinds say yes to. That is question 3.

  1. Question 3: only lie-first alternaters say yes, so there are 99 of them.
  2. Question 2: liars and lie-first alternaters say yes. So the number of liars is 15−9=615 - 9 = 6.
  3. Question 1: truth-tellers, liars and lie-first alternaters say yes. So the number of truth-tellers is 22−6−9=722 - 6 - 9 = 7.
  4. Check: the truth-first alternaters number 31−7−6−9=931 - 7 - 6 - 9 = 9, a sensible count.

Step 3: candy. A truth-teller says yes only to question 1, so each gets exactly one piece. The 77 truth-tellers get 77 pieces in all.

The answer is (A) 7\boxed{\textbf{(A)}\ 7}.

Why this works

Truth-teller and liar puzzles turn into simple counting once you make a table of how each kind answers. The alternaters split into two kinds depending on how they start. Then begin with the question that the fewest kinds answer yes to, and work back up one question at a time.

Concise solution

A shorter write-up, the way contest solutions are usually written. It may take a different route from the solution above.

Work out how each kind of child answers the three questions (truth-teller? alternater? liar?).

  • Truth-teller: yes, no, no.
  • Liar: the true answers are no, no, yes; a liar negates them: yes, yes, no.
  • Alternater starting truthful: truthfully "no" to question 1, then lies about being an alternater: "no", then truthfully "no": no, no, no.
  • Alternater starting with a lie: yes, yes, yes.

Let TT, LL, A1A_1, A2A_2 be the numbers of truth-tellers, liars, truth-first alternaters, and lie-first alternaters. Reading the counts from the last question backward:

  • Question 3 (99 yeses): only lie-first alternaters said yes, so A2=9A_2 = 9.
  • Question 2 (1515 yeses): liars and lie-first alternaters, so L+9=15L + 9 = 15, L=6L = 6.
  • Question 1 (2222 yeses): truth-tellers, liars, lie-first alternaters, so T+6+9=22T + 6 + 9 = 22, T=7T = 7.

(Then A1=31−22=9A_1 = 31 - 22 = 9, consistent.) Each truth-teller received exactly one piece of candy, on question 1, so the truth-tellers received 77 pieces in all.

The answer is (A) 7\boxed{\textbf{(A)}\ 7}.

Review in the AoPS books

Similar problems

Problem © Mathematical Association of America (MAA), American Mathematics Competitions. Reproduced for non-commercial educational use. Solution and commentary are original to this site.