2022 AMC 12A Problems/Problem 5

Problem

The $\textit{taxicab distance}$ between points $(x_1, y_1)$ and $(x_2, y_2)$ in the coordinate plane is given by $|x_1 - x_2| + |y_1 - y_2|$ . For how many points $P$ with integer coordinates is the taxicab distance between $P$ and the origin less than or equal to $20$ ?

$\textbf{(A)} \, 441 \qquad\textbf{(B)} \, 761 \qquad\textbf{(C)} \, 841 \qquad\textbf{(D)} \, 921 \qquad\textbf{(E)} \, 924$

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

Page

Toolbox

Search

2022 AMC 12A Problems/Problem 5

Problem

Solution 1 (Pick's Theorem)