Difference between revisions of "2024 AMC 12A Problems/Problem 25"
(Created page with "==Problem== A graph is <math>\textit{symmetric}</math> about a line if the graph remains unchanged after reflection in that line. For how many quadruples of integers <math>(a,...") |
Ericzzzqwq (talk | contribs) (→Solution 1) |
||
(9 intermediate revisions by the same user not shown) | |||
Line 3: | Line 3: | ||
<math>\textbf{(A) }1282\qquad\textbf{(B) }1292\qquad\textbf{(C) }1310\qquad\textbf{(D) }1320\qquad\textbf{(E) }1330</math> | <math>\textbf{(A) }1282\qquad\textbf{(B) }1292\qquad\textbf{(C) }1310\qquad\textbf{(D) }1320\qquad\textbf{(E) }1330</math> | ||
+ | ==Solution 1== | ||
+ | Symmetric about the line <math>y=x</math> implies that the inverse fuction <math>y^{-1}=y</math>. Then we split the question into several cases to find the final answer. | ||
+ | |||
+ | |||
+ | |||
+ | Case 1: <math>c=0</math> | ||
+ | |||
+ | Then <math>y=\frac{a}{d}x+\frac{b}{d}</math> and <math>y^{-1}=\frac{d}{a}x-\frac{b}{a}</math>. | ||
+ | Giving us <math>\frac{a}{d}=\frac{d}{a}</math> and <math>\frac{b}{d}=-\frac{b}{a}</math> | ||
+ | |||
+ | Therefore, we obtain 2 subcases: <math>b\neq 0, a+d=0</math> and <math>b=0, a^2=d^2</math> | ||
+ | |||
+ | |||
+ | |||
+ | Case 2: <math>c\neq 0</math> | ||
+ | |||
+ | Then <math>y^{-1}=\frac{b-dx}{cx-a}=\frac{(cx-a)(-\frac{d}{c})+b-\frac{ad}{c}}{cx-a}=-\frac{d}{c}+\frac{b-\frac{ad}{c}}{cx-a}</math> | ||
+ | |||
+ | And <math>y=\frac{(cx+d)(\frac{a}{c})+b-\frac{ad}{c}}{cx+d}=\frac{a}{c}+\frac{b-\frac{ad}{c}}{cx+d}</math> | ||
+ | |||
+ | So <math>\frac{a}{c}=-\frac{d}{c}</math>, or <math>a=-d</math> (<math>c\neq 0</math>), and substitude that into <math>\frac{b-\frac{ad}{c}}{cx-a}=\frac{b-\frac{ad}{c}}{cx+d}</math> gives us: | ||
+ | |||
+ | <math>bc-ad\neq 0</math> (Otherwise <math>y=\frac{a}{c}</math>, <math>y^{-1}=-\frac{d}{c}=\frac{a}{c}</math>, and is not symmetric about <math>y=x</math>) | ||
+ | |||
+ | |||
+ | |||
+ | Therefore we get three cases: | ||
+ | |||
+ | Case 1.1: <math>c= 0, b\neq 0, d\neq 0, a+d=0</math> | ||
+ | |||
+ | We have 10 choice of <math>b</math>, 10 choice of <math>d</math> and each choice of <math>d</math> has one corresponding choice of <math>a</math>. In total <math>10\times 10=100</math> ways. | ||
+ | |||
+ | |||
+ | |||
+ | Case 1.2: <math>c= 0, b = 0, d\neq 0, a^2=d^2</math> | ||
+ | |||
+ | We have 10 choice for <math>d</math> (<math>d\neq 0</math>), each choice of <math>d</math> has 2 corresponding choice of <math>a</math>, thus <math>10\times 2=20</math> ways. | ||
+ | |||
+ | |||
+ | |||
+ | Case 2: <math>c\neq 0, bc-ad\neq 0, a=-d</math> | ||
+ | |||
+ | <math>a=0</math>: <math>10\times 10=100</math> ways. | ||
+ | |||
+ | <math>a=-1,1</math>: <math>(11\times 10-2)\times 2=216</math> ways. | ||
+ | |||
+ | <math>a=-2,2</math>: <math>(11\times 10-2)\times 2=216</math> ways. | ||
+ | |||
+ | <math>a=-3,3</math>: <math>(11\times 10-2)\times 2=216</math> ways. | ||
+ | |||
+ | <math>a=-4,4</math>: <math>(11\times 10-6)\times 2=208</math> ways. | ||
+ | |||
+ | <math>a=-5,5</math>: <math>(11\times 10-2)\times 2=216</math> ways. | ||
+ | |||
+ | In total <math>100+208+216\times 4= 1172</math> ways. | ||
+ | |||
+ | |||
+ | |||
+ | So the answer is <math>100+20+1172= \boxed{\textbf{B) }1292}</math> | ||
+ | |||
+ | ~ERiccc | ||
==See also== | ==See also== | ||
{{AMC12 box|year=2024|ab=A|num-b=24|after=Last Problem}} | {{AMC12 box|year=2024|ab=A|num-b=24|after=Last Problem}} | ||
{{MAA Notice}} | {{MAA Notice}} |
Revision as of 21:13, 8 November 2024
Problem
A graph is about a line if the graph remains unchanged after reflection in that line. For how many quadruples of integers , where and and are not both , is the graph of symmetric about the line ?
Solution 1
Symmetric about the line implies that the inverse fuction . Then we split the question into several cases to find the final answer.
Case 1:
Then and . Giving us and
Therefore, we obtain 2 subcases: and
Case 2:
Then
And
So , or (), and substitude that into gives us:
(Otherwise , , and is not symmetric about )
Therefore we get three cases:
Case 1.1:
We have 10 choice of , 10 choice of and each choice of has one corresponding choice of . In total ways.
Case 1.2:
We have 10 choice for (), each choice of has 2 corresponding choice of , thus ways.
Case 2:
: ways.
: ways.
: ways.
: ways.
: ways.
: ways.
In total ways.
So the answer is
~ERiccc
See also
2024 AMC 12A (Problems • Answer Key • Resources) | |
Preceded by Problem 24 |
Followed by Last Problem |
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 • 16 • 17 • 18 • 19 • 20 • 21 • 22 • 23 • 24 • 25 | |
All AMC 12 Problems and Solutions |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.