AMC 10 Step by Step

2025 AMC 10A Problem 8

P1-10~3 minPrint

Agnes writes the following four statements on a blank piece of paper.

∙\bullet At least one of these statements is true.

∙\bullet At least two of these statements are true.

∙\bullet At least two of these statements are false.

∙\bullet At least one of these statements is false.

Each statement is either true or false. How many false statements did Agnes write on the paper?

Log in to save your progress.
Show solution without answering

Key insight

Every statement only talks about how many statements are true. Try each possible count from 0 to 4 and keep the one that agrees with itself.

Solution

You cannot tell whether one statement is true on its own, because each one talks about all four. But every statement depends on just one number: how many of the four are true. Call that number TT. There are only five possible values, 00 to 44, so try each.

1. Rewrite each statement in terms of TT. If TT statements are true, then 4−T4 - T are false.
- Statement 1 ("at least one true") is true when TT is 11 or more.
- Statement 2 ("at least two true") is true when TT is 22 or more.
- Statement 3 ("at least two false") is true when 4−T4 - T is 22 or more, which means TT is 22 or less.
- Statement 4 ("at least one false") is true when 4−T4 - T is 11 or more, which means TT is 33 or less.

  1. Test each value of TT. For each guess, count how many statements come out true. The guess only works if that count equals the guess.
Guess TTSt. 1St. 2St. 3St. 4Number trueMatches?
00FFTT22no
11TFTT33no
22TTTT44no
33TTFT33yes
44TTFF22no
  1. Read off the answer. Only T=3T = 3 agrees with itself. Statements 1, 2 and 4 are true, and statement 3 is false.
  1. Double-check. With exactly one false statement, "at least two are false" really is false, and the other three really are true. Everything fits.
  1. Answer the actual question. It asks for the number of false statements: 4−3=14 - 3 = 1.

The answer is (B) 1\boxed{\textbf{(B)}\ 1}.

Why this works

When statements talk about themselves, you cannot judge them one at a time. Instead, guess the one number they all depend on and check whether the guess produces itself. Here that number is "how many are true", and with only five possibilities a small table settles it. Any puzzle of the form "at least kk of these are true/false" can be handled the same way.

Concise solution

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

Let TT be the number of true statements, so 4−T4 - T are false. Every statement speaks only about TT:

  • statement 1 is true exactly when T≥1T \ge 1;
  • statement 2 is true exactly when T≥2T \ge 2;
  • statement 3 is true exactly when 4−T≥24 - T \ge 2, that is T≤2T \le 2;
  • statement 4 is true exactly when 4−T≥14 - T \ge 1, that is T≤3T \le 3.

A value of TT is possible only if exactly TT of these four conditions hold. Test all five values.

  • T=0T = 0: conditions 3 and 4 hold, so 22 statements are true, not 00.
  • T=1T = 1: conditions 1, 3, 4 hold, so 33 are true, not 11.
  • T=2T = 2: all four conditions hold, so 44 are true, not 22.
  • T=3T = 3: conditions 1, 2, 4 hold and condition 3 fails, so 33 are true. Consistent.
  • T=4T = 4: conditions 1, 2, 4 hold, so 33 are true, not 44.

Only T=3T = 3 survives: statements 1, 2 and 4 are true and statement 3 is false. Reading it back confirms the arrangement, since "at least two of these statements are false" is indeed false when exactly one is false. The number of false statements is 4−3=14 - 3 = 1.

The answer is (B) 1\boxed{\textbf{(B)}\ 1}.

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.