|
|
| Line 1: |
Line 1: |
| − | ==Problem 12==
| + | #redirect [[2022 AMC 12A Problems/Problem 9]] |
| − | | |
| − | On Halloween <math>31</math> 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 <math>22</math>
| |
| − | children who answered yes.
| |
| − | | |
| − | "Are you an alternater?" The principal gave a piece of candy to each of the <math>15</math>
| |
| − | children who answered yes.
| |
| − | | |
| − | "Are you a liar?" The principal gave a piece of candy to each of the <math>9</math> children who
| |
| − | answered yes.
| |
| − | | |
| − | How many pieces of candy in all did the principal give to the children who always
| |
| − | tell the truth?
| |
| − | | |
| − | <math>\textbf{(A) } 7 \qquad \textbf{(B) } 12 \qquad \textbf{(C) } 21 \qquad \textbf{(D) } 27 \qquad \textbf{(E) } 31</math>
| |
| − | | |
| − | [[2022 AMC 10A Problems/Problem 12|Solution]] | |
