AMC 10 · 2024 · #25

Grade 11 countingalgebra
function-compositionline-symmetrycomplementary-countingsystematic-enumerationfactors convert-to-algebracaseworkcomplementary-counting ↑ Prerequisites: function-evaluationpolynomial-factoringfactors
📏 Long solution 💡 5 insights
Problem
Count the ordered integer quadruples (a,b,c,d) with |a|,|b|,|c|,|d| ≤ 5 and c,d not both 0, for which the graph of y=(ax+b)/(cx+d) is left unchanged when it is reflected in the line y=x.

Pick an answer.

(A)
1282
(B)
1292
(C)
1310
(D)
1320
(E)
1330
How to solve
Strategy Convert to Algebra

"The picture looks the same in a mirror" is not something you can count. Tool #13 (Convert to Algebra) is the whole engine here: reflecting in y=x swaps the coordinates, so the mirror test says that whenever (x,y) sits on the curve so does (y,x) — that is, f undoes itself, and f(f(x))=x. Composing f with itself is a short computation, and when the result is compared with x a single factor of (a+d) falls out of every term. That factorisation is the payoff: it splits the problem into just two branches, and Tool #7 (Identify Subproblems) keeps them apart. One branch is the bare line y=x and is over in a line of work. The other branch is the condition a+d=0, where Tool #1 (Draw a Diagram) earns its place — the picture of a horizontal line facing the mirror is what shows that the collapsed, constant cases have to be thrown out. Counting that branch is easiest backwards, so Tool #16 (Change Focus / Count the Complement) counts every quadruple with a+d=0 first and then removes the bad ones, and Tool #2 (Make a Systematic List) finds the bad ones by walking through the factor pairs with product -a².

1STEP 1

The mirror test is being your own inverse

The condition is only f of f is x.

(p,q) ⟼ (q,p), so the condition is f(f(x))=x for every x where f is defined
2STEP 2

Feed f back into itself

The composition is still one fraction.

f(f(x))=(a·(ax+b)/(cx+d)+b)/(c·(ax+b)/(cx+d)+d)=(a(ax+b)+b(cx+d))/(c(ax+b)+d(cx+d))=(a²+bc)x+b(a+d)/(c(a+d)x+(bc+d²))
3STEP 3

A factor falls out

Rearranged, a plus d factors right out.

[(a²+bc)x+b(a+d)]-x[c(a+d)x+(bc+d²)]=-(a+d)(cx²+(d-a)x-b)
4STEP 4

Branch two is the line itself

The identity accounts for 10 quadruples.

c=0, a=d ≠ 0, b=0 ⟹ f(x)=x; the number of such quadruples is 10
5STEP 5

Branch one and the collapses

Even with zero trace, a zero denominator fails.

d=-a ⟹ f(f(x))=((a²+bc)x)/(a²+bc), which is x exactly when bc ≠ -a²
6STEP 6

Count before removing anything

Zero trace gives 1320 quadruples.

11 · 11 · 11-11=1331-11=1320
7STEP 7

Count the collapses

There are 38 to remove.

10+4+12+4+4+4=38
8STEP 8

Put the two branches together

1282 plus 10 is 1292.

(1320-38)+10=1282+10=1292
Answer
1292
Test the rule on actual quadruples. Take (a,b,c,d)=(1,1,1,-1), which has a+d=0 and bc=1 ≠ -a²=-1, so it should count: f(x)=(x+1)/(x-1) gives f(2)=3 and f(3)=2, and f(0)=-1 and f(-1)=0, so points come in swapped pairs exactly as symmetry demands. Now take (1,-1,1,-1), which has a+d=0 but bc=-1=-a², one of the 38 removals: f(x)=(x-1)/(x-1)=1, a horizontal line with a hole, whose mirror image is a vertical line — correctly rejected, and this is the case that separates the answer choices. A branch-one quadruple with c=0, say (2,3,0,-2), gives f(x)=(2x+3)/-2=-x-3/2, a line of slope -1; it meets y=x at a right angle, so reflecting in y=x swaps its two halves and returns the same line — symmetric, as the count claims. A quadruple failing a+d=0, say (2,1,1,1), gives f(f(x))=(5x+3)/(3x+2) ≠ x — correctly rejected. Next a size check: there are 11⁴-11=14630 allowed quadruples, and 1292/14630≈ 8.8%, which sits just under the 1/11≈ 9.1% you would expect from the single equation a+d=0 — the small shortfall is the 38 removals, and the sign is right. Finally the answer choices themselves are a check, because each one is a specific slip: 1330 is 1320+10, forgetting to remove the 38 constants; 1320 is branch one alone with neither the removals nor the line y=x; and 1282 is branch one done correctly but with the 10 copies of y=x overlooked. The correct total sits at 1292, choice (B).
💡Key takeaway

Reflecting in y=x just swaps the two coordinates, so the graph mirrors itself exactly when putting an output back in returns the input; for y=(ax+b)/(cx+d) that forces a+d=0 (or the plain line y=x), and 1320-38+10=1292.

  • The mirror test is f(f(x))=x
  • Feed f back into itself
  • A factor of a+d falls out
  • Branch two is the line y=x
  • Branch one: a+d=0, minus the collapses
  • Count a+d=0 before removing anything
  • List the factor pairs with product -a²
  • Put the two branches together