返回题库

AIME 2009 I · 第 11 题

AIME 2009 I — Problem 11

专题
Contest Math
难度
L4
来源
AIME

题目详情

Problem

Consider the set of all triangles OPQOPQ where OO is the origin and PP and QQ are distinct points in the plane with nonnegative integer coordinates (x,y)(x,y) such that 41x+y=200941x + y = 2009. Find the number of such distinct triangles whose area is a positive integer.

解析

Solution 1 (Matrix's, Determinants)

Let the two points PP and QQ be defined with coordinates; P=(x1,y1)P=(x_1,y_1) and Q=(x2,y2)Q=(x_2,y_2)

We can calculate the area of the parallelogram with the determinant of the matrix of the coordinates of the two points(shoelace theorem).

det(PQ)=det(x1y1x2y2).\det \left(\begin{array}{c} P \\ Q\end{array}\right)=\det \left(\begin{array}{cc}x_1 &y_1\\x_2&y_2\end{array}\right).

Since the triangle has half the area of the parallelogram, we just need the determinant to be even.

The determinant is

(x1)(y2)(x2)(y1)=(x1)(200941(x2))(x2)(200941(x1))=2009(x1)41(x1)(x2)2009(x2)+41(x1)(x2)=2009((x1)(x2))(x_1)(y_2)-(x_2)(y_1)=(x_1)(2009-41(x_2))-(x_2)(2009-41(x_1))=2009(x_1)-41(x_1)(x_2)-2009(x_2)+41(x_1)(x_2)=2009((x_1)-(x_2)) Since 20092009 is not even, x1x2x_1-x_2 must be even, thus the two xx's must be of the same parity. Also note that the maximum value for xx is 4949 and the minimum is 00. There are 2525 even and 2525 odd numbers available for use as coordinates and thus there are (25C2)+(25C2)=600(_{25}C_2)+(_{25}C_2)=\boxed{600} such triangles.

Solution 2

As in Solution 1, let the two points PP and QQ be defined with coordinates; P=(x1,y1)P=(x_1,y_1) and Q=(x2,y2)Q=(x_2,y_2). Let the line 41x+y=200941x+y=2009 intersect the x-axis at XX and the y-axis at YY. XX has coordinates (49,0)(49,0), and YY has coordinates (0,2009)(0,2009). As such, there are exactly 5050 lattice points on this line that can be used for PP and QQ.

WLOG, let the x-coordinate of PP be less than the x-coordinate of QQ. Note that [OPQ]=[OYX][OYP][OXQ][OPQ]=[OYX]-[OYP]-[OXQ]. We know that OY=2009OY=2009 and OX=49OX= 49; as such, [OYX]=12OYOX=12200949[OYX]=\frac{1}{2} \cdot OY \cdot OX = \frac{1}{2} \cdot 2009 \cdot 49. In addition, [OYP]=122009x1[OYP]=\frac{1}{2} \cdot 2009 \cdot x_1 and [OXQ]=1249y2[OXQ]=\frac{1}{2} \cdot 49 \cdot y_2.

Since 2009492009 \cdot 49 is odd, the total area of OYXOYX is not an integer; rather, it is of the form k+12k + \frac{1}{2} where kk is an integer. To ensure [OPQ][OPQ] has an integral value, exactly one of [OPY][OPY] and [OQX][OQX] must have an integral value as well (the other must be of the form k+12k + \frac{1}{2} where kk is an integer).

Returning to 41x+y=200941x+y=2009, we notice that integer pairs of xx and yy that satisfy the equation always have different parities. To satisfy exactly one of [OPY][OPY] and [OQX][OQX] having an integral area, we must have x1x_1 and y2y_2 having different parities. This is because having an even number for x1x_1 or y2y_2 makes the area of the triangle an integer. We can therefore deduce that x1x_1 and x2x_2 have the same parity.

Out of the 5050 usable lattice points for PP and QQ, 2525 have even x-coordinates and 2525 have odd x-coordinates. Since we must pick two points with even x-coordinates or two points with odd x-coordinates, our desired answer is (252)+(252)=300+300=600\binom{25}{2}+\binom{25}{2}=300+300=\fbox{600}.

Solution 3 (Analytic geometry)

As in the solution above, let the two points PP and QQ be defined with coordinates; P=(x1,y1)P=(x_1,y_1) and Q=(x2,y2)Q=(x_2,y_2).

If the coordinates of PP and QQ have nonnegative integer coordinates, PP and QQ must be lattice points either

  • on the nonnegative x-axis

  • on the nonnegative y-axis

  • in the first quadrant

We can calculate the y-intercept of the line 41x+y=200941x+y=2009 to be (0,2009)(0,2009) and the x-intercept to be (49,0)(49,0).

Using the point-to-line distance formula, we can calculate the height of OPQ\triangle OPQ from vertex OO (the origin) to be:

41(0)+1(0)2009412+12=20091682=2009292\dfrac{|41(0) + 1(0) - 2009|}{\sqrt{41^2 + 1^2}} = \dfrac{2009}{\sqrt{1682}} = \dfrac{2009}{29\sqrt2}

Let bb be the base of the triangle that is part of the line 41x+y=200941x+y=2009.

The area is calculated as: 12×b×2009292=2009582×b\dfrac{1}{2}\times b \times \dfrac{2009}{29\sqrt2} = \dfrac{2009}{58\sqrt2}\times b

Let the numerical area of the triangle be kk.

So, k=2009582×bk = \dfrac{2009}{58\sqrt2}\times b

We know that kk is an integer. So, b=582×zb = 58\sqrt2 \times z, where zz is also an integer.

We defined the points PP and QQ as P=(x1,y1)P=(x_1,y_1) and Q=(x2,y2)Q=(x_2,y_2).

Changing the y-coordinates to be in terms of x, we get:

P=(x1,200941x1)P=(x_1,2009-41x_1) and Q=(x2,200941x2)Q=(x_2,2009-41x_2).

The distance between them equals bb.

Using the distance formula, we get

PQ=b=(41x2+41x1)2+(x2x1)2=292×x2x1=582×zPQ = b = \sqrt{(-41x_2+ 41x_1)^2 + (x_2 - x_1)^2} = 29\sqrt2 \times |x_2 - x_1| = 58\sqrt2\times z ()(*)

WLOG, we can assume that x2>x1x_2 > x_1.

Taking the last two equalities from the ()(*) string of equalities and putting in our assumption that x2>x1x_2>x_1, we get

292×(x2x1)=582×z29\sqrt2\times (x_2-x_1) = 58\sqrt2\times z.

Dividing both sides by 29229\sqrt2, we get

x2x1=2zx_2-x_1 = 2z

As we mentioned, zz is an integer, so x2x1x_2-x_1 is an even integer. Also, x2x_2 and x1x_1 are both positive integers. So, x2x_2 and x1x_1 are between 0 and 49, inclusive. Remember, x2>x1x_2>x_1 as well.

  • There are 48 ordered pairs (x2,x1)(x_2,x_1) such that their positive difference is 2.

  • There are 46 ordered pairs (x2,x1)(x_2,x_1) such that their positive difference is 4.

...

  • Finally, there are 2 ordered pairs (x2,x1)(x_2,x_1) such that their positive difference is 48.

Summing them up, we get that there are 2+4++48=6002+4+\dots + 48 = \boxed{600} triangles.

Solution 4

We present a non-analytic solution; consider the lattice points on the line 41x+y=200941x+y=2009. The line has intercepts (0,2009)(0, 2009) and (49,0)(49, 0), so the lattice points for x=0,1,,49x=0, 1, \ldots, 49 divide the line into 4949 equal segments. Call the area of the large triangle AA. Any triangle formed with the origin having a base of one of these segments has area A/49A/49 (call this value BB) because the height is the same as that of large triangle, and the bases are in the ratio 1:491:49. A segment comprised of nn small segments (all adjacent to each other) will have area nBnB. Rewriting in terms of the original area, A=(12)(49)(2009)A=(\frac{1}{2})(49)(2009), B=20092B=\frac{2009}{2}, and nB=n(20092)nB=n(\frac{2009}{2}). It is clear that in order to have a nonnegative integer for nBnB as desired, nn must be even. This is equivalent to finding the number of ways to choose two distinct xx-values x1x_1 and x2x_2 (0x1,x2490 \leq x_1, x_2 \leq 49) such that their positive difference (nn) is even. Follow one of the previous methods above to choose these pairs and arrive at the answer of 600.

Solution 5 (Shoelace Theorem)

Label point PP and QQ as (x1,200941x1)(x_1, 2009 - 41x_1) and (x2,200941x2)(x_2, 2009 - 41x_2) respectively. Now, we shall use Shoelace Theorem to calculate the area of the triangle. After doing the calculations and simplifications with the coordinates, you will get the area of the triangle to be 2009x1x22\frac{2009|x_1-x_2|}{2}. Based on this, in order for the area of the triangle to be an integer, x1x2|x_1-x_2| needs to be even. The only way for this to happen is that either x1x_1 and x2x_2 are both even are both odd. From the equation from the problem, we can know that 0x1,x2490 \le x_1, x_2 \le 49. There are 25C2_{25}C_2 ways to choose 2 even integers in that range or 2 odd numbers in that range. Thus, the answer is 2(25C2)2(_{25}C_2) which is 600\boxed{600}.

~ROGER8432V3

Solution 6 (Easier Shoelace)

Dividing by 41 on both sides yields

x+y41=49x+ \frac{y}{41} = 49 and because the result is an integer, y41=z\frac{y}{41} = z and thus we have

x+z=49x+z = 49 and through stars-and-bars the number of ways to count the following integer pairs greater than or equal to 0 is simply just (501)=50\binom{50}{1} = 50.

From here, shoelace on the coordinates (0,0)(0,0), P(x1,y1)P(x_1, y_1), Q(x2,y2)Q(x_2,y_2) results in 12x1y2y1x2\frac{1}{2} | x_1y_2 - y_1x_2 |. Also notice that for the resulting area to be an integer we must have that x1y2y1x2(mod2)x_1y_2 \equiv y_1x_2 \pmod{2}. The only way this is possible is if both x1y2y1x2x_1y_2 - y_1x_2 are either even or odd. There are 25 pairs of odd numbers, and 25 pairs of even numbers out of the 50 possible stars-and-bars cases. Note that choosing the two numbers themselves to give to the coordinates of PP and QQ respectively make the triangle distinct as order does not matter. Thus the answer is just the number of ways to choose two even coordinates for one of the four distinct values and the remainder is for one of the odd coordinates, and thus our answer is just 2((252))=6002(\binom{25}{2}) = \boxed{600}.

~Pinotation