2024 AMC 12A Problems/Problem 25
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
Solution 5
Proceed the same way as the other solutions keeping in mind that . Then, I got: . Cross multiplying and matching coefficients, we get: = ; = ; and = . Then, I broke it up into 4 cases:
Case 1: , , .
Case 2: , , .
Case 3: , , .
Case 4: , , .
I first accounted the total number of cases for everything to work WITHOUT any restrictions. So for Case 1, there would be 10 possibilities for and 11 for the part where . So a total of 110 cases. Similarly, in the same fashion, Case 2 would yield 21 cases. Case 3 would yield 1100 cases and Case 4 would bring a total of 110 cases. So, our total possibilities right now is = . But wait! Notice a lot of these cases would bring the denominator of to be 0 namely to be 0. We don't want this! So we have to subtract out all the cases that bring to be 0. Notice for Case 1, so if , we have a bad case. We shall keep track of all the "bad" cases. For Case 1, any quadruple that includes is "bad". So no restrictions upon since depends upon . Therefore, we have 10 bad cases so far remember, for Case 1.
We now proceed to Case 2. Notice we only have 1 "bad" case namely . This is because and depend on each other again.
Now Case 3. This will have quite a bit of "bad" cases as . Firstly, clearly would again have some overcounting going on so we would have to subtract out 10 again as the value of doesn't matter. Then, we start off with . Obviously, then would yield a bad case IF . Now we see what happens is . Then, the denominator would be . For this to be 0, . So all even values of would be considered "bad". Thus, we would have to be "bad" cases which yields a subtotal of 4 cases. Now, the same thing would happen if except all multiples of 3 would be considered "bad". So would be "bad" or a subtotal of 2 cases. Then, we see the pattern. Multiples of 4 could also be eliminated for which would yield but these overcount the multiples of 2 so no need to worry about them. Lastly, multiples of 5 wouldn't work if so is "bad" or 2 cases. Then, could also be eliminated. Then, at last would also not work. Finally, a total of cases would be "bad" which yields a subtotal of 19 cases. As you would see, Case 4 has the exact same restrictions on but not . So we can predict it would yield the same number of "bad" cases as Case 3. Finally, we could up all of the "bad" cases we have: = "bad" cases. What we did here is also known as counting up all the "asymptotes".
Our answer should be or .
~ilikemath247365
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.