Difference between revisions of "2022 AMC 12A Problems/Problem 5"
Jamesl123456 (talk | contribs) (→Solution 2 (Stars and Bars)) |
Jamesl123456 (talk | contribs) (→Solution 2 (Stars and Bars)) |
||
Line 15: | Line 15: | ||
Then, we can copy our solutions over to the other four quadrants. First, so as not to overcount, we remove all points on the axes. There are <math>20 + 20 + 1 = 41</math> such points with nonnegative integer coordinates. Then we multiply the <math>190</math> remaining points by <math>4</math> to get <math>760</math> points that are not on the axes. Then, we can add back the <math>41</math> nonnegative points on the axes, as well as the <math>40</math> other points with negative coordinates to get <math>760 + 41 + 40 = \boxed{\textbf{(C)} \, 841}.</math> | Then, we can copy our solutions over to the other four quadrants. First, so as not to overcount, we remove all points on the axes. There are <math>20 + 20 + 1 = 41</math> such points with nonnegative integer coordinates. Then we multiply the <math>190</math> remaining points by <math>4</math> to get <math>760</math> points that are not on the axes. Then, we can add back the <math>41</math> nonnegative points on the axes, as well as the <math>40</math> other points with negative coordinates to get <math>760 + 41 + 40 = \boxed{\textbf{(C)} \, 841}.</math> | ||
+ | |||
+ | ~ jamesl123456 |
Revision as of 12:28, 12 November 2022
Problem
The between points
and
in the coordinate plane is given by
. For how many points
with integer coordinates is the taxicab distance between
and the origin less than or equal to
?
Solution 1 (Pick's Theorem)
Let . Since the problem asks for taxicab distances from the origin, we want
. The graph of all solutions to this equation on the
-plane is a square with vertices at
and
(In order to prove this, one can divide the sections of this graph into casework on the four quadrants, and tie together the resulting branches.) We want the number of lattice points on the border of the square and inside the square.
Each side of the square goes through an equal number of lattice points, so if we focus on one side going from
to
, we can see that it goes through
points in total. In addition, each of the vertices gets counted twice, so the total number of border points is
. Also, the area of the square is
, so when we plug this information inside Pick's theorem, we get
. Then our answer is
~ Oxymoronic15
Solution 2 (Stars and Bars)
Instead of considering all points with integer coordinates, first consider points with nonnegative coordinates only. Then, we want . We can introduce a third variable, say
, such that
. Note that counting the ways to have
is the same as counting the ways to have
. Therefore, by stars and bars, there are
solutions with nonnegative integer coordinates.
Then, we can copy our solutions over to the other four quadrants. First, so as not to overcount, we remove all points on the axes. There are such points with nonnegative integer coordinates. Then we multiply the
remaining points by
to get
points that are not on the axes. Then, we can add back the
nonnegative points on the axes, as well as the
other points with negative coordinates to get
~ jamesl123456