Difference between revisions of "1998 AIME Problems/Problem 2"

(')
 
(prob/sol, sol2 by towersfreak2006)
Line 1: Line 1:
 
== Problem ==
 
== Problem ==
 +
Find the number of [[ordered pair]]s <math>\displaystyle (x,y)</math> of positive integers that satisfy <math>x \le 2y \le 60 \displaystyle</math> and <math>\displaystyle y \le 2x \le 60</math>.
 +
__TOC__
 +
== Solution ==
 +
=== Solution 1 ===
 +
[[Image:AIME_1998-2.png]]
 +
[[Pick's theorem]] states that:
 +
<div style="text-align:center;"><math>A = I + \frac B2 - 1</math></div>
 +
 +
The conditions give us four [[inequality|inequalities]]: <math>x \le 30 \displaystyle</math>, <math>y \displaystyle \le 30</math>, <math>\displaystyle x \le 2y</math>, <math>\displaystyle y \le 2x</math>. These create a [[quadrilateral]], whose area is <math>\frac 12</math> of the 30 by 30 [[square]] it is in. A simple way to see this is to note that the two triangles outside of the quadrilateral form half of the area of the 30 by 30 square.
 +
 +
So <math>A = \frac 12 \cdot 30^2 = 450</math>. <math>\displaystyle B</math> we can calculate by just counting. Ignoring the vertices, the top and right sides have 14 [[lattice point]]s, and the two diagonals each have 14 lattice points (for the top diagonal, every value of <math>x</math> corresponds with an integer value of <math>y</math> as <math>y = 2x</math> and vice versa for the bottom, so and there are 14 values for x not counting vertices). Adding the four vertices, there are 60 points on the borders.
 +
 +
<div style="text-align:center;"><math>450 = I + \frac {60}2 - 1 \displaystyle</math>
 +
<br />
 +
<math>\displaystyle I = 421</math></div>
 +
 +
Since the inequalities also include the equals case, we include the boundaries, which gives us <math>421 + 60 = 481</math> ordered pairs. However, the question asks us for positive integers, so <math>(0,0)</math> doesn't count; hence, the answer is <math>480</math>.
 +
 +
=== Solution 2 ===
 +
First, note that all pairs of the form <math>\displaystyle (a,a)</math>, <math>1\le a \displaystyle \le30</math> work.
 +
 +
Now, considered the ordered pairs with <math>x < y</math>, so that <math>x < 2y</math> is automatically satisfied. Since <math>x < y\le 2x</math>, there are <math>2x - x = x \displaystyle</math> possible values of <math>y</math>. Hence, given <math>x</math>, there are <math>x</math> values of possible <math>y</math> for which <math>x < y</math> and the above conditions are satisfied. But <math>2y \displaystyle \le60</math>, so this only works for <math>x\le15</math>. Thus, there are
  
== Solution ==
+
<math>\sum_{i=1}^{15} i=\frac{(30)(31)}{2}</math>
 +
 
 +
ordered pairs. For <math>x > 15</math>, <math>y</math> must follow <math>x < y\le 30 \displaystyle</math>. Hence, there are <math>30 - x</math> possibilities for <math>y</math>, and there are
 +
 
 +
<math>\sum_{i=16}^{30}(30-i)=\sum_{i=0}^{14}i=\frac{(14)(15)}{2}</math>
 +
 
 +
ordered pairs.
 +
 
 +
By symmetry, there are also <math>\displaystyle \frac {(15)(16)}{2} + \frac {(14)(15)}{2}</math> ordered pairs with <math>x > y</math> and the above criteria satisfied.
 +
 
 +
Hence, the total is
 +
 
 +
<math>\frac{(15)(16)}{2}+\frac{(14)(15)}{2}+\frac{(15)(16)}{2}+\frac{(14)(15)}{2}+30=480.</math>
  
 
== See also ==
 
== See also ==
* [[1998 AIME Problems]]
+
{{AIME box|year=1998|num-b=1|num-a=3}}
 +
 
 +
[[Category:Intermediate Geometry Problems]]

Revision as of 16:31, 7 September 2007

Problem

Find the number of ordered pairs $\displaystyle (x,y)$ of positive integers that satisfy $x \le 2y \le 60 \displaystyle$ and $\displaystyle y \le 2x \le 60$.

Solution

Solution 1

AIME 1998-2.png Pick's theorem states that:

$A = I + \frac B2 - 1$

The conditions give us four inequalities: $x \le 30 \displaystyle$, $y \displaystyle \le 30$, $\displaystyle x \le 2y$, $\displaystyle y \le 2x$. These create a quadrilateral, whose area is $\frac 12$ of the 30 by 30 square it is in. A simple way to see this is to note that the two triangles outside of the quadrilateral form half of the area of the 30 by 30 square.

So $A = \frac 12 \cdot 30^2 = 450$. $\displaystyle B$ we can calculate by just counting. Ignoring the vertices, the top and right sides have 14 lattice points, and the two diagonals each have 14 lattice points (for the top diagonal, every value of $x$ corresponds with an integer value of $y$ as $y = 2x$ and vice versa for the bottom, so and there are 14 values for x not counting vertices). Adding the four vertices, there are 60 points on the borders.

$450 = I + \frac {60}2 - 1 \displaystyle$


$\displaystyle I = 421$

Since the inequalities also include the equals case, we include the boundaries, which gives us $421 + 60 = 481$ ordered pairs. However, the question asks us for positive integers, so $(0,0)$ doesn't count; hence, the answer is $480$.

Solution 2

First, note that all pairs of the form $\displaystyle (a,a)$, $1\le a \displaystyle \le30$ work.

Now, considered the ordered pairs with $x < y$, so that $x < 2y$ is automatically satisfied. Since $x < y\le 2x$, there are $2x - x = x \displaystyle$ possible values of $y$. Hence, given $x$, there are $x$ values of possible $y$ for which $x < y$ and the above conditions are satisfied. But $2y \displaystyle \le60$, so this only works for $x\le15$. Thus, there are

$\sum_{i=1}^{15} i=\frac{(30)(31)}{2}$

ordered pairs. For $x > 15$, $y$ must follow $x < y\le 30 \displaystyle$. Hence, there are $30 - x$ possibilities for $y$, and there are

$\sum_{i=16}^{30}(30-i)=\sum_{i=0}^{14}i=\frac{(14)(15)}{2}$

ordered pairs.

By symmetry, there are also $\displaystyle \frac {(15)(16)}{2} + \frac {(14)(15)}{2}$ ordered pairs with $x > y$ and the above criteria satisfied.

Hence, the total is

$\frac{(15)(16)}{2}+\frac{(14)(15)}{2}+\frac{(15)(16)}{2}+\frac{(14)(15)}{2}+30=480.$

See also

1998 AIME (ProblemsAnswer KeyResources)
Preceded by
Problem 1
Followed by
Problem 3
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15
All AIME Problems and Solutions