Difference between revisions of "2009 AIME I Problems/Problem 11"
|Line 103:||Line 103:|
== See also ==
== See also ==
Revision as of 14:11, 16 August 2020
Consider the set of all triangles where is the origin and and are distinct points in the plane with nonnegative integer coordinates such that . Find the number of such distinct triangles whose area is a positive integer.
Let the two points and be defined with coordinates; and
We can calculate the area of the parallelogram with the determinant of the matrix of the coordinates of the two points(shoelace theorem).
Since the triangle has half the area of the parallelogram, we just need the determinant to be even.
The determinant is
Since is not even, must be even, thus the two 's must be of the same parity. Also note that the maximum value for is and the minimum is . There are even and odd numbers available for use as coordinates and thus there are such triangles.
As in Solution 1, let the two points and be defined with coordinates; and . Let the line intersect the x-axis at and the y-axis at . has coordinates , and has coordinates . As such, there are exactly lattice points on this line that can be used for and .
WLOG, let the x-coordinate of be less than the x-coordinate of . Note that . We know that and ; as such, . In addition, and .
Since is odd, the total area of is not an integer; rather, it is of the form where is an integer. To ensure has an integral value, exactly one of and must have an integral value as well (the other must be of the form where is an integer).
Returning to , we notice that integer pairs of and that satisfy the equation always have different parities. To satisfy exactly one of and having an integral area, we must have and having different parities. This is because having an even number for or makes the area of the triangle an integer. We can therefore deduce that and have the same parity.
Out of the usable lattice points for and , have even x-coordinates and 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 .
As in the solution above, let the two points and be defined with coordinates; and .
If the coordinates of and have nonnegative integer coordinates, and 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 to be and the x-intercept to be .
Using the point-to-line distance formula, we can calculate the height of from vertex (the origin) to be:
Let be the base of the triangle that is part of the line .
The area is calculated as:
Let the numerical area of the triangle be .
We know that is an integer. So, , where is also an integer.
We defined the points and as and .
Changing the y-coordinates to be in terms of x, we get:
The distance between them equals .
Using the distance formula, we get
WLOG, we can assume that .
Taking the last two equalities from the string of equalities and putting in our assumption that , we get
Dividing both sides by , we get
As we mentioned, is an integer, so is an even integer. Also, and are both positive integers. So, and are between 0 and 49, inclusive. Remember, as well.
- There are 48 ordered pairs such that their positive difference is 2.
- There are 46 ordered pairs such that their positive difference is 4.
- Finally, there are 2 ordered pairs such that their positive difference is 48.
Summing them up, we get that there are triangles.
We present a non-analytic solution; consider the lattice points on the line . The line has intercepts and , so the lattice points for divide the line into equal segments. Call the area of the large triangle . Any triangle formed with the origin having a base of one of these segments has area (call this value ) because the height is the same as that of large triangle, and the bases are in the ratio . A segment comprised of small segments (all adjacent to each other) will have area . Rewriting in terms of the original area, , , and . It is clear that in order to have a nonnegative integer for as desired, must be even. This is equivalent to finding the number of ways to choose two distinct -values and () such that their positive difference () is even. Follow one of the previous methods above to choose these pairs and arrive at the answer of 600.
|2009 AIME I (Problems • Answer Key • Resources)|
|1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15|
|All AIME Problems and Solutions|