Skip to main content

2022 AMC 12A Problem 9

Problem 9 of 25EasierCounting & Probability

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?

Answer choices

Show solution

Solution

To “Are you a truth-teller?” the truth-tellers and liars both answer yes, and only alternaters who lie on this question answer yes. To “Are you an alternater?” the liars answer yes, and among alternaters only those telling the truth on this question answer yes. To “Are you a liar?” only alternaters lying on this question answer yes. Split the alternaters by first response. Those starting with a lie answer (lie, truth, lie), so they say yes to all three questions; those starting truthful answer (truth, lie, truth) and say yes to none of the three. The 99 yeses on the last question are exactly the lie-first alternaters, so there are 99 of them. The second question’s 1515 yeses are the liars plus these 9,9, so there are 66 liars. The first question’s 2222 yeses are truth-tellers plus liars plus the 9,9, so the truth-tellers number 2269=7.22-6-9=7. Truth-tellers answer yes only to the first question, receiving one candy each, for 71=77\cdot1=7 pieces. Thus, the correct answer is A.

More practice

Concepts: truth-tellers and liars · logical deduction · casework

Problem text and solution from the LIVE past-contest archive. See also the AoPS wiki page for community solutions.