Difference between revisions of "2024 AMC 12A Problems/Problem 25"
m (typo fix) |
Babyhamster (talk | contribs) (→Solution 1) |
||
Line 64: | Line 64: | ||
~ERiccc | ~ERiccc | ||
+ | |||
+ | ==Solution 2 (Rotation + Edge Cases)== | ||
+ | Observe that the only linear functions that are symmetric about <math>y = x</math> are <math>y = x</math> and <math>y = -x</math>. | ||
+ | |||
+ | 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 linear functions except <math>y = x</math> and <math>y = -x</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</math> occurs when <math>a = -d</math> and <math>b = c = 0</math>, this case is already counted. | ||
+ | |||
+ | |||
+ | |||
+ | The answer is <math>1331 - 28 - 21 + 10 = \boxed{\textbf{B) }1292}</math>. | ||
+ | |||
+ | ~babyhamster | ||
==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 20:04, 9 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
Solution 2 (Rotation + Edge Cases)
Observe that the only linear functions that are symmetric about are
and
.
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 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 is already counted.
The answer is .
~babyhamster
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.