AMC 10 · 2024 · #25
Grade 11 countingalgebraPick an answer.
"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².
The mirror test is being your own inverse
The condition is only f of f is x.
The line y=x is the mirror that swaps input and output, so a self-mirroring graph is one where feeding an output back in hands you the input.
The diagonal line is the mirror that swaps input and output, so a self-mirroring graph is one that undoes itself.
▸ Why?
Reflecting across that line sends each point to the point with its coordinates swapped.
▸ Why?
A graph that lands on itself under that swap is exactly a rule that undoes what it just did.
Feed f back into itself
The composition is still one fraction.
Multiplying top and bottom by cx+d clears the fraction inside the fraction and leaves an ordinary ratio of two straight-line expressions.
11.A-APR.D.6Convert To AlgebraA factor falls out
Rearranged, a plus d factors right out.
Every term of the difference secretly contains a+d, so the whole mirror condition collapses into one factor being zero.
11.A-APR.C.4Convert To AlgebraBranch two is the line itself
The identity accounts for 10 quadruples.
The one graph guaranteed to survive a mirror is the mirror itself.
9.F-IF.B.4Identify SubproblemsBranch one and the collapses
Even with zero trace, a zero denominator fails.
A flat line and its mirror image are a horizontal line and a vertical line, so a function that has quietly turned constant can never pass the mirror test.
8.G.A.3Draw A DiagramCount before removing anything
Zero trace gives 1320 quadruples.
Counting everything that satisfies the easy equation and then deleting the failures is far quicker than trying to describe the survivors directly.
9.A-CED.A.3Change Focus Count The ComplementCount the collapses
There are 38 to remove.
The cap |b|,|c| ≤ 5 kills every lopsided factor pair, so past |a|=2 only the square split |a|·|a| survives.
6.NS.B.4Make A Systematic ListPut the two branches together
1282 plus 10 is 1292.
Two disjoint branches, one large and one tiny, and the tiny one is exactly the mirror line itself.
9.A-CED.A.3Change Focus Count The ComplementReflecting 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