Difference between revisions of "2025 AIME I Problems/Problem 4"
Mathkiddus (talk | contribs) (→Solution 1) |
|||
Line 21: | Line 21: | ||
~[[User:Mathkiddus|mathkiddus]] | ~[[User:Mathkiddus|mathkiddus]] | ||
+ | |||
+ | ==Solution 2== | ||
+ | First, notice that (0,0) is a solution. | ||
+ | |||
+ | Divide the equation by <math>y^2</math>, getting <math>12(\frac{x}{y})^2-\frac{x}{y}-6 = 0</math>. (We can ignore the <math>y=0</math> case for now.) Let <math>a = \frac{x}{y}</math>. We now have <math>12a^2-a-6=0</math>. Factoring, we get <math>(4a-3)(3a+2) = 0</math>. Therefore, the graph is satisfied when <math>4a=3</math> or <math>3a=-2</math>. Substituting <math>\frac{x}{y} = a</math> back into the equations, we get <math>4x=3y</math> or <math>3x=-2y</math>. | ||
+ | |||
+ | Remember that both <math>x</math> and <math>y</math> are bounded by <math>-100</math> and <math>100</math>, inclusive. For <math>4x=3y</math>, the solutions are <math>(-75,-100), (-72,-96), (-69, -92), \dots, (72,96), (75,100)</math>. Remember to not count the <math>x=y=0</math> case for now. There are <math>25</math> positive solutions and <math>25</math> negative solutions for a total of <math>50</math>. | ||
+ | |||
+ | For <math>3x-2y</math>, we do something similar. The solutions are <math>(-66,99), (-64,96), \dots, (64, -96), (66, -99)</math>. There are <math>33</math> solutions when <math>x</math> is positive and <math>33</math> solutions when <math>x</math> is negative, for a total of <math>66</math>. | ||
+ | |||
+ | Now we can count the edge case of <math>(0,0</math>. The answer is therefore <math>50+66+1 = \boxed{117}</math>. | ||
+ | |||
+ | ~lprado |
Revision as of 18:48, 13 February 2025
Problem
Find the number of ordered pairs , where both
and
are integers between
and
inclusive, such that
.
Solution 1
We begin by factoring, Since the RHS is
we have two options,
In this case we have, Using the bounding on
we have,
In addition in order for
to be integer
so we substitute
From this we have solutions starting from
to
which is
solutions.
On the other hand, we have, From bounds we have,
In this case, for
to be integer
so we substitute
This gives us
solutions.
Finally we overcount one case which is the intersection of the lines or the point
Therefore our answer is
Solution 2
First, notice that (0,0) is a solution.
Divide the equation by , getting
. (We can ignore the
case for now.) Let
. We now have
. Factoring, we get
. Therefore, the graph is satisfied when
or
. Substituting
back into the equations, we get
or
.
Remember that both and
are bounded by
and
, inclusive. For
, the solutions are
. Remember to not count the
case for now. There are
positive solutions and
negative solutions for a total of
.
For , we do something similar. The solutions are
. There are
solutions when
is positive and
solutions when
is negative, for a total of
.
Now we can count the edge case of . The answer is therefore
.
~lprado