Difference between revisions of "1957 AHSME Problems/Problem 43"
(Created page with "r") |
(added second solution) |
||
(5 intermediate revisions by 2 users not shown) | |||
Line 1: | Line 1: | ||
− | + | == Problem == | |
+ | We define a lattice point as a point whose coordinates are integers, zero admitted. | ||
+ | Then the number of lattice points on the boundary and inside the region bounded by the <math>x</math>-axis, | ||
+ | the line <math>x = 4</math>, and the parabola <math>y = x^2</math> is: | ||
+ | |||
+ | <math>\textbf{(A)}\ 24 \qquad | ||
+ | \textbf{(B)}\ 35\qquad | ||
+ | \textbf{(C)}\ 34\qquad | ||
+ | \textbf{(D)}\ 30\qquad | ||
+ | \textbf{(E)}\ \infty</math> | ||
+ | |||
+ | == Solution 1 == | ||
+ | |||
+ | <asy> | ||
+ | |||
+ | path p = (0,0){right}..(1,1)..(2,4)..(3,9)..(4,16); | ||
+ | |||
+ | // Shaded Region | ||
+ | fill(p--(4,0)--cycle,lightred); | ||
+ | |||
+ | // x-Axis | ||
+ | draw((-4,0)--(16,0), arrow=Arrows); | ||
+ | label("$x$",(18,0)); | ||
+ | |||
+ | // y-Axis | ||
+ | draw((0,-4)--(0,16), arrow=Arrows); | ||
+ | label("$y$",(0,18)); | ||
+ | |||
+ | // y=x^2 | ||
+ | draw(p); | ||
+ | |||
+ | // x=4 | ||
+ | draw((4,-5)--(4,20), arrow=Arrows(TeXHead)); | ||
+ | |||
+ | </asy> | ||
+ | |||
+ | We want to find the number of lattice points in and on the boundary of the shaded region in the diagram. To do this, we will look at the integer values of <math>x</math> from <math>0</math> to <math>4</math>. At a given value of <math>x</math>, the amount of lattice points in the region is <math>x^2+1</math>, because all of the integers from <math>0</math> up to and including <math>x^2</math> are in the region. Thus, evaluating this expression at at <math>x=0,1,2,3,</math> and <math>4</math> and adding the results together, we see that the number of lattice points is <math>1+2+5+10+17=35</math>, so our answer is <math>\boxed{\textbf{(B) }35}</math>. | ||
+ | |||
+ | == Solution 2 (not as fast, but cool theorems) == | ||
+ | Let us construct a simple polygon with vertices at <math>(0,0), (1,1), (2,4), (3,9), (4,16),</math> and <math>(4,0)</math>. Notice that this polygon overestimates the area of the shaded region in the diagram (because the parabola has [[convex function|positive concavity]]) yet does not have any more lattice points, because it matches the parabola at integral values of <math>x</math>, and lattice points can only exist when <math>x</math> is an integer. | ||
+ | After using the [[Shoelace Theorem]], we see that the area of the polygon is <math>\tfrac{114-70}2=22</math>. Let <math>B</math> be the number of lattice points on the boundary of the polygon, and let <math>I</math> be the number of lattice points inside the polygon. We know that <math>B=5+17+5-3=24</math> by counting the lattice points on the parabola, on the right edge, and on the bottom edge while taking care to subtract out the three points we counted twice (namely, <math>(0,0), (4,16),</math> and <math>(4,0)</math>). Now, recalling that the polygon has area <math>22</math>, we can use [[Pick's Theorem]] to solve for <math>I</math> as follows: | ||
+ | \begin{align*} | ||
+ | I + \frac B 2 -1 &= 22 \\ | ||
+ | I + \frac{24}{2} &= 23 \\ | ||
+ | I + 12 &= 23 \\ | ||
+ | I &= 11 | ||
+ | \end{align*} | ||
+ | Because the total amount of lattice points inside the polygon (and, consequently, inside the shaded region) is <math>I+B</math>, our answer is <math>11+24=\boxed{\textbf{(B) }35}</math>. | ||
+ | |||
+ | == See Also == | ||
+ | {{AHSME 50p box|year=1957|num-b=42|num-a=44}} | ||
+ | {{MAA Notice}} | ||
+ | [[Category:AHSME]][[Category:AHSME Problems]] |
Latest revision as of 11:10, 27 July 2024
Problem
We define a lattice point as a point whose coordinates are integers, zero admitted.
Then the number of lattice points on the boundary and inside the region bounded by the -axis,
the line
, and the parabola
is:
Solution 1
We want to find the number of lattice points in and on the boundary of the shaded region in the diagram. To do this, we will look at the integer values of from
to
. At a given value of
, the amount of lattice points in the region is
, because all of the integers from
up to and including
are in the region. Thus, evaluating this expression at at
and
and adding the results together, we see that the number of lattice points is
, so our answer is
.
Solution 2 (not as fast, but cool theorems)
Let us construct a simple polygon with vertices at and
. Notice that this polygon overestimates the area of the shaded region in the diagram (because the parabola has positive concavity) yet does not have any more lattice points, because it matches the parabola at integral values of
, and lattice points can only exist when
is an integer.
After using the Shoelace Theorem, we see that the area of the polygon is
. Let
be the number of lattice points on the boundary of the polygon, and let
be the number of lattice points inside the polygon. We know that
by counting the lattice points on the parabola, on the right edge, and on the bottom edge while taking care to subtract out the three points we counted twice (namely,
and
). Now, recalling that the polygon has area
, we can use Pick's Theorem to solve for
as follows:
\begin{align*}
I + \frac B 2 -1 &= 22 \\
I + \frac{24}{2} &= 23 \\
I + 12 &= 23 \\
I &= 11
\end{align*}
Because the total amount of lattice points inside the polygon (and, consequently, inside the shaded region) is
, our answer is
.
See Also
1957 AHSC (Problems • Answer Key • Resources) | ||
Preceded by Problem 42 |
Followed by Problem 44 | |
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 • 16 • 17 • 18 • 19 • 20 • 21 • 22 • 23 • 24 • 25 • 26 • 27 • 28 • 29 • 30 • 31 • 32 • 33 • 34 • 35 • 36 • 37 • 38 • 39 • 40 • 41 • 42 • 43 • 44 • 45 • 46 • 47 • 48 • 49 • 50 | ||
All AHSME Problems and Solutions |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.