AMC 10 · 2021 · #7

Grade 8 algebra
polynomial-factoringdifference-of-squaresperfect-squares convert-to-algebrapattern-recognition ↑ Prerequisites: polynomial-factoring
📏 Medium solution 💡 2 insights
Problem
Among all pairs of real numbers, find the smallest possible value of an expression made of two squares added together. Both pieces are squares, so the expression is never negative.

Pick an answer.

(A)
0
(B)
$\frac{1}{4}$
(C)
$\frac{1}{2}$
(D)
1
(E)
2
How to solve
Strategy Organize Information in More Ways

Tool #15 (Reorganize) is the heart — the original form hides the answer, but expanding and re-grouping reveals a clean product structure. Tool #13 (Algebra) executes the rewrite: expand the squares, regroup, factor as (x² + 1)(y² + 1). Tool #6 (Guess and Check) confirms the candidate (0, 0) achieves the value. Tool #3 (Eliminate) discards 0 (impossible because xy = 1 and x + y = 0 have no real solution) and the larger options.

1STEP 1

Can it be zero?

They cannot both vanish.

x + y = 0, xy = 1 → -x² = 1 (no real x)
2STEP 2

Expand and tidy

Expanding kills the cross terms.

(xy-1)² + (x+y)² = x² y² - 2xy + 1 + x² + 2xy + y² = x² y² + x² + y² + 1
3STEP 3

Factor it

What remains is a product of two factors.

x² y² + x² + y² + 1 = (x² + 1)(y² + 1)
4STEP 4

Read the floor

Both factors are at least one.

x² + 1 ≥ 1, y² + 1 ≥ 1 → (x² + 1)(y² + 1) ≥ 1
5STEP 5

Check the floor is reached

The origin actually reaches it.

(0, 0): (0 - 1)² + 0² = 1 ✓
6STEP 6

Read the minimum

The minimum is 1.

min = 1 → (D)
Answer
1
Two independent confirmations: the algebraic factorization proves (x²+1)(y²+1) ≥ 1 for all real x, y; the point (0, 0) achieves 1, so 1 is the exact minimum. The choices smaller than 1 — {0, 1/4, 1/2} — are all ruled out by the inequality. Choice (E) 2 is too large since 1 is actually attainable.
💡Key takeaway

This AMC 12 problem only needs Grade 8 algebra you already know — expand the two squares so the ± 2xy terms cancel, factor to (x² + 1)(y² + 1), see that each factor is at least 1, and check that (0, 0) gives the minimum 1.