Difference between revisions of "2024 AMC 12A Problems/Problem 25"
Ericzzzqwq (talk | contribs) (→Solution 1) |
|||
(21 intermediate revisions by 6 users 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== | + | ==Solution 1 (Inverse Function)== |
− | Symmetric about the line <math>y=x</math> implies that the inverse | + | Symmetric about the line <math>y=x</math> implies that the inverse function <math>y^{-1}=y</math>. Then we split the question into several cases to find the final answer. |
Line 11: | Line 11: | ||
Then <math>y=\frac{a}{d}x+\frac{b}{d}</math> and <math>y^{-1}=\frac{d}{a}x-\frac{b}{a}</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> | + | 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> | Therefore, we obtain 2 subcases: <math>b\neq 0, a+d=0</math> and <math>b=0, a^2=d^2</math> | ||
Line 23: | Line 23: | ||
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> | 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 | + | So <math>\frac{a}{c}=-\frac{d}{c}</math>, or <math>a=-d</math> (<math>c\neq 0</math>), and substitute 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>) | <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: | Therefore we get three cases: | ||
− | Case 1.1: <math>c= 0, d\neq 0, a+d=0</math> | + | 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, a^2=d^2</math> | + | 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> | 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=\pm 1</math>: <math>(11\times 10-2)\times 2=216</math> ways. | ||
+ | |||
+ | <math>a=\pm 2</math>: <math>(11\times 10-2)\times 2=216</math> ways. | ||
+ | |||
+ | <math>a=\pm 3</math>: <math>(11\times 10-2)\times 2=216</math> ways. | ||
+ | |||
+ | <math>a=\pm 4</math>: <math>(11\times 10-6)\times 2=208</math> ways. | ||
+ | |||
+ | <math>a=\pm 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 | ||
+ | |||
+ | ==Solution 2 (Rotation + Edge Cases)== | ||
+ | First, observe that the only linear functions that are symmetric about <math>y = x</math> are <math>y = x</math> and <math>y = -x+k</math>, where <math>k</math> is some constant. | ||
+ | |||
+ | |||
+ | |||
+ | We perform a <math>45^\circ</math> counterclockwise rotation of the Cartesian plane. Let <math>(x, y)</math> be sent to <math>(u, v)</math>. Then <math>u</math> and <math>v</math> are the real and imaginary parts of <math>(x + yi)(\frac{\sqrt{2}}{2}+\frac{\sqrt{2}}{2}i)</math> respectively, which gives | ||
+ | |||
+ | <cmath>u = \frac{x - y}{\sqrt{2}}</cmath> | ||
+ | <cmath>v = \frac{x + y}{\sqrt{2}}</cmath> | ||
+ | |||
+ | so | ||
+ | |||
+ | <cmath>x = \frac{v + u}{\sqrt{2}}</cmath> | ||
+ | <cmath>y = \frac{v - u}{\sqrt{2}}</cmath>. | ||
+ | |||
+ | The rotated function is symmetric about the y-axis, so the equation holds after replacing all instances of <math>u</math> with <math>-u</math> (this is just switching the values of <math>x</math> and <math>y</math> which is a reflection over <math>y = x</math>, but working in terms of <math>(u, v)</math> allows more cancellations in the following calculations). | ||
+ | |||
+ | Writing <math>x</math> and <math>y</math> in terms of <math>u</math> and <math>v</math>, we have | ||
+ | |||
+ | <cmath>\frac{v - u}{\sqrt{2}} = \frac{a(v + u) + b\sqrt{2}}{c(v + u) + d\sqrt{2}}</cmath> | ||
+ | <cmath>\frac{v + u}{\sqrt{2}} = \frac{a(v - u) + b\sqrt{2}}{c(v - u) + d\sqrt{2}}</cmath> | ||
+ | |||
+ | Multiplying both equations by <math>\sqrt{2}</math> and subtracting the second equation from the first equation gives <math>d = -a</math>. Since <math>a, b, c, d</math> are integers between <math>-5</math> and <math>5</math>, this gives <math>11^3 = 1331</math> combinations. We need to subtract the edge cases that don't work, namely all undefined functions and linear functions except <math>y = x</math> and <math>y = -x+k</math>. Consider the following cases: | ||
+ | |||
+ | |||
+ | |||
+ | Case 1: <math>a, b, c, d</math> are all nonzero. Then the function is linear when <math>ax + b</math> is a multiple of <math>cx + d</math>, or <math>\frac{a}{b} = \frac{c}{-a}</math>. | ||
+ | |||
+ | If <math>a = \pm 1</math>, <math>(b,c) = (1, -1)</math> or <math>(-1, 1)</math>; there are <math>2*2 = 4</math> ways. | ||
+ | |||
+ | If <math>a = \pm 2</math>, there are <math>12</math> ways. | ||
+ | |||
+ | If <math>a = \pm 3</math>, there are <math>4</math> ways. | ||
+ | |||
+ | If <math>a = \pm 4</math>, there are <math>4</math> ways. | ||
+ | |||
+ | If <math>a = \pm 5</math>, there are <math>4</math> ways. | ||
+ | |||
+ | In total, this case has <math>28</math> combinations. | ||
+ | |||
+ | |||
+ | |||
+ | Case 2: <math>a = b = d = 0</math> or <math>a = c = d = 0</math> | ||
+ | |||
+ | If <math>a = b = d = 0</math> then <math>c</math> can take on <math>11</math> values, and if <math>a = c = d = 0</math>, then <math>b</math> can take on <math>11</math> values, but <math>a = b = c = d = 0</math> is counted twice so this case has <math>11 + 11 - 1 = 21</math> combinations. | ||
+ | |||
+ | |||
+ | |||
+ | Finally, we need to add the case where <math>y = x</math>, which occurs when <math>a = d</math> and <math>b = c = 0</math>. <math>a</math> can be any integer from <math>-5</math> to <math>5</math> except <math>0</math>, so this case has <math>10</math> combinations. Since <math>y = -x+k</math> occurs when <math>a = -d</math> and <math>c = 0</math>, this case has already been counted. | ||
+ | |||
+ | |||
+ | |||
+ | Thus, the answer is <math>1331 - 28 - 21 + 10 = \boxed{\textbf{(B) }1292}</math>. | ||
+ | |||
+ | ~babyhamster | ||
+ | |||
+ | == Solution 3 (Asymptotes) == | ||
+ | There are two cases: when <math>c=0</math> and when <math>c\neq 0</math>. | ||
+ | |||
+ | |||
+ | |||
+ | <math>\textbf{Case 1: }\mathbf{c=0.}</math> If <math>c=0</math>, then <math>y=\frac{ax+b}d=\frac adx+\frac bd</math>. This is the equation of a line, and the only lines symmetric about <math>y=x</math> are those perpendicular to <math>y=x</math> (i.e. those with slope <math>-1</math>) and <math>y=x</math> itself. To have a slope of <math>-1</math>, we need <math>a=-d\neq 0</math>, and <math>b</math> can be any of its <math>11</math> possibilities from <math>-5</math> to <math>5</math>. There are <math>11\cdot 10=110</math> possibilities here. For the function to be <math>y=x</math>, we need <math>a=d\neq 0</math> and <math>b=0</math>. There are <math>10</math> possibilities here. Thus, our total for Case 1 is <math>110+10=120</math> possiblities. | ||
+ | |||
+ | |||
+ | |||
+ | <math>\textbf{Case 2: }\mathbf{c\neq 0.}</math> When <math>c\neq 0</math>, we will first consider the case in which the graph is a hyperbola. Clearly, for this hyperbola to be symmetric about <math>y=x</math>, the intersection of its horizontal and vertical asymptotes must be on <math>y=x</math>. The location of the horizontal asymptote is <math>y=\frac ac</math>, and the vertical asymptote occurs at <math>x=-\frac dc</math>. These asymptotes intersect on <math>y=x</math> when <math>\frac ac = -\frac dc</math>, or, more simply, when <math>a=-d</math>. | ||
+ | |||
+ | If the asymptotes intersect on <math>y=x</math>, then the hyperbola must be symmetric about <math>y=x</math>. This is true because for any hyperbola with perpendicular asymptotes, we can rotate and translate the coordinate plane in a certain way such that that hyperbola has an equation of the form <math>x^2-y^2=a^2</math>. Then, the hyperbola's asymptotes would intersect at the origin, and it would be symmetric about the coordinate axes (because it makes a distinction neither between <math>x</math> and <math>-x</math> nor <math>y</math> and <math>-y</math>). The coordinate axes are the bisectors of the angles formed by the asymptotes, and the hyperbola is symmetric about them. Thus, because the angles formed by our hyperbola's asymptotes are bisected by <math>y=x</math>, our hyperbola must be symmetric about <math>y=x</math>. | ||
+ | |||
+ | Thus, with the conditions that <math>a=-d</math> and <math>c\neq 0</math>, there are <math>11\cdot 11\cdot 10\cdot 1=1210</math> possibilites for <math>(a,b,c,d)</math>. However, not all of these ordered quadruples produce hyperbolas. If <math>b=a=d=0</math> or <math>\frac ac=\frac bd</math>, then the quadruples produce horizontal lines with a hole when the denominator equals <math>0</math>. As seen in Case 1, these lines, with slope <math>0</math>, cannot be symmetric about <math>y=x</math>. | ||
+ | |||
+ | For the subcase where <math>b=a=d=0</math>, there are <math>10</math> possibilities for <math>c\neq 0</math>, which gives us <math>10</math> wrongly counted quadruples. | ||
+ | |||
+ | For the subcase where <math>\frac ac=\frac bd</math>, we wrongly counted cases where <math>d=-a</math>. Here, <math>-a^2=bc</math> by cross-multiplication. The casework on the possible values of <math>a</math> below counts the number of triples <math>(a,b,c)</math> with <math>|a|,|b|,|c|\leq 5</math> which satisfy this condition. | ||
+ | |||
+ | If <math>a=\pm 1</math>, <math>bc=-1</math>, which yields <math>2\cdot 2 \cdot 1=4</math> possibilities. | ||
+ | |||
+ | If <math>a=\pm 2</math>, <math>bc=-4</math>, which yields <math>2\cdot 2\cdot 3=12</math> possibilities. | ||
+ | |||
+ | If <math>a=\pm 3</math>, <math>bc=-9</math>, which yields <math>2\cdot 2\cdot 1=4</math> possbilities. (recall that <math>|b|,|c|\leq 5</math>) | ||
+ | |||
+ | If <math>a=\pm 4</math>, <math>bc=-16</math>, which yields <math>2\cdot 2\cdot 1=4</math> possibilities. | ||
+ | |||
+ | If <math>a=\pm 5</math>, <math>bc=-25</math>, which yields <math>2\cdot 2\cdot 1=4</math> possibilities. | ||
+ | |||
+ | Adding the above values together for this subcase yields <math>4+12+4+4+4=28</math> wrongly counted quadruples. | ||
+ | |||
+ | Subtracting the wrongly counted quadruples from our count for Case 2 yields <math>1210-10-28=1172</math>. | ||
+ | |||
+ | Adding the possibilities for Case 1 and Case 2 yields our final answer of <math>120+1172=\boxed{\textbf{(B) }1292}</math> possible quadruples. | ||
+ | |||
+ | == Solution 4 == | ||
+ | Note that the condition is equivalent to having <math>f(f(x))=x</math>. | ||
+ | |||
+ | So we have: <math>\frac{a(\frac{ax+b}{cx+d})+b}{c(\frac{ax+b}{cx+d})+d} = x \Rightarrow x^2(ac+cd)+x(d^2-a^2)-(ab+bd)=0</math> | ||
+ | |||
+ | Thus we require: | ||
+ | |||
+ | <math>ac+cd = 0 \rightarrow c=0</math> or <math>a = -d</math> | ||
+ | |||
+ | <math>d^2-a^2 = 0 \rightarrow a = d</math> or <math>a = -d</math> | ||
+ | |||
+ | <math>ab+bd = 0 \rightarrow b=0</math> or <math>a = -d</math> | ||
+ | |||
+ | Note that if <math>a = -d</math> then all 3 cases work and give <math>11^3=1331</math> solutions. | ||
+ | |||
+ | If instead <math>c=0</math> and <math>a \neq -d</math> then we require <math>a=d</math> and <math>b=0</math> which then give <math>10</math> solutions. | ||
+ | |||
+ | Now, we must remove all extraneous cases. This is when <math>x(ac+cd)+bc+d^2 = 0</math> (note this includes the case where <math>c=d=0</math>). | ||
+ | |||
+ | So this is equivalent to having both <math>ac+cd = 0</math> and <math>bc + d^2 = 0.</math> | ||
+ | |||
+ | If <math>c = d = 0</math> we have <math>11</math> solutions. | ||
+ | |||
+ | If <math>c = 0</math> and <math>d \neq 0</math> then we have <math>0</math> solutions. | ||
+ | |||
+ | If <math>c \neq 0</math> and <math>d = 0</math> then we require <math>a=0</math> and <math>b=0</math> so we have <math>10</math> solutions. | ||
+ | |||
+ | And if <math>c \neq 0</math> and <math>d \neq 0</math> we have <math>a = -d</math> and <math>d^2 = -bc</math>, see that if <math>\left|d\right|=1,3,4,5</math> we have <math>2</math> solutions and if <math>\left|d\right|=2</math> we have <math>6</math> solutions, so a total of <math>2(2+6+2+2+2) = 28</math> solutions. | ||
+ | |||
+ | Thus, the final answer is <math>1331+10-11-10-28 =\boxed{\textbf{(B) }1292}</math> | ||
+ | |||
+ | ~LuisFonseca123 | ||
+ | |||
==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}} |
Latest revision as of 12:28, 10 November 2024
Contents
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 (Inverse Function)
Symmetric about the line implies that the inverse function . 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 substitute 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
Solution 2 (Rotation + Edge Cases)
First, observe that the only linear functions that are symmetric about are and , where is some constant.
We perform a counterclockwise rotation of the Cartesian plane. Let be sent to . Then and are the real and imaginary parts of respectively, which gives
so
.
The rotated function is symmetric about the y-axis, so the equation holds after replacing all instances of with (this is just switching the values of and which is a reflection over , but working in terms of allows more cancellations in the following calculations).
Writing and in terms of and , we have
Multiplying both equations by and subtracting the second equation from the first equation gives . Since are integers between and , this gives combinations. We need to subtract the edge cases that don't work, namely all undefined functions and linear functions except and . Consider the following cases:
Case 1: are all nonzero. Then the function is linear when is a multiple of , or .
If , or ; there are ways.
If , there are ways.
If , there are ways.
If , there are ways.
If , there are ways.
In total, this case has combinations.
Case 2: or
If then can take on values, and if , then can take on values, but is counted twice so this case has combinations.
Finally, we need to add the case where , which occurs when and . can be any integer from to except , so this case has combinations. Since occurs when and , this case has already been counted.
Thus, the answer is .
~babyhamster
Solution 3 (Asymptotes)
There are two cases: when and when .
If , then . This is the equation of a line, and the only lines symmetric about are those perpendicular to (i.e. those with slope ) and itself. To have a slope of , we need , and can be any of its possibilities from to . There are possibilities here. For the function to be , we need and . There are possibilities here. Thus, our total for Case 1 is possiblities.
When , we will first consider the case in which the graph is a hyperbola. Clearly, for this hyperbola to be symmetric about , the intersection of its horizontal and vertical asymptotes must be on . The location of the horizontal asymptote is , and the vertical asymptote occurs at . These asymptotes intersect on when , or, more simply, when .
If the asymptotes intersect on , then the hyperbola must be symmetric about . This is true because for any hyperbola with perpendicular asymptotes, we can rotate and translate the coordinate plane in a certain way such that that hyperbola has an equation of the form . Then, the hyperbola's asymptotes would intersect at the origin, and it would be symmetric about the coordinate axes (because it makes a distinction neither between and nor and ). The coordinate axes are the bisectors of the angles formed by the asymptotes, and the hyperbola is symmetric about them. Thus, because the angles formed by our hyperbola's asymptotes are bisected by , our hyperbola must be symmetric about .
Thus, with the conditions that and , there are possibilites for . However, not all of these ordered quadruples produce hyperbolas. If or , then the quadruples produce horizontal lines with a hole when the denominator equals . As seen in Case 1, these lines, with slope , cannot be symmetric about .
For the subcase where , there are possibilities for , which gives us wrongly counted quadruples.
For the subcase where , we wrongly counted cases where . Here, by cross-multiplication. The casework on the possible values of below counts the number of triples with which satisfy this condition.
If , , which yields possibilities.
If , , which yields possibilities.
If , , which yields possbilities. (recall that )
If , , which yields possibilities.
If , , which yields possibilities.
Adding the above values together for this subcase yields wrongly counted quadruples.
Subtracting the wrongly counted quadruples from our count for Case 2 yields .
Adding the possibilities for Case 1 and Case 2 yields our final answer of possible quadruples.
Solution 4
Note that the condition is equivalent to having .
So we have:
Thus we require:
or
or
or
Note that if then all 3 cases work and give solutions.
If instead and then we require and which then give solutions.
Now, we must remove all extraneous cases. This is when (note this includes the case where ).
So this is equivalent to having both and
If we have solutions.
If and then we have solutions.
If and then we require and so we have solutions.
And if and we have and , see that if we have solutions and if we have solutions, so a total of solutions.
Thus, the final answer is
~LuisFonseca123
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.