Difference between revisions of "2024 AMC 12A Problems/Problem 25"
Boppitybobii (talk | contribs) m (→Solution 1) |
|||
(6 intermediate revisions by 3 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 47: | Line 47: | ||
<math>a=0</math>: <math>10\times 10=100</math> ways. | <math>a=0</math>: <math>10\times 10=100</math> ways. | ||
− | <math>a= | + | <math>a=\pm 1</math>: <math>(11\times 10-2)\times 2=216</math> ways. |
− | <math>a= | + | <math>a=\pm 2</math>: <math>(11\times 10-2)\times 2=216</math> ways. |
− | <math>a= | + | <math>a=\pm 3</math>: <math>(11\times 10-2)\times 2=216</math> ways. |
− | <math>a= | + | <math>a=\pm 4</math>: <math>(11\times 10-6)\times 2=208</math> ways. |
− | <math>a= | + | <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. | In total <math>100+208+216\times 4= 1172</math> ways. | ||
Line 155: | Line 155: | ||
Adding the possibilities for Case 1 and Case 2 yields our final answer of <math>120+1172=\boxed{\textbf{(B) }1292}</math> possible quadruples. | 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}} |
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.