AMC10每日一题(2000年真题#16)
- 2018-04-25
- 775 人浏览
- 分享
- 收藏
2000 AMC 10 竞赛试题/第16题
Problem
The diagram shows
lattice points, each one unit from its nearest neighbors. Segment
meets segment
at
. Find the length of segment
.
![[asy] path seg1, seg2; seg1=(6,0)--(0,3); seg2=(2,0)--(4,2); dot((0,0)); dot((1,0)); fill(circle((2,0),0.1),black); dot((3,0)); dot((4,0)); dot((5,0)); fill(circle((6,0),0.1),black); dot((0,1)); dot((1,1)); dot((2,1)); dot((3,1)); dot((4,1)); dot((5,1)); dot((6,1)); dot((0,2)); dot((1,2)); dot((2,2)); dot((3,2)); fill(circle((4,2),0.1),black); dot((5,2)); dot((6,2)); fill(circle((0,3),0.1),black); dot((1,3)); dot((2,3)); dot((3,3)); dot((4,3)); dot((5,3)); dot((6,3)); draw(seg1); draw(seg2); pair [] x=intersectionpoints(seg1,seg2); fill(circle(x[0],0.1),black); label("$A$",(0,3),NW); label("$B$",(6,0),SE); label("$C$",(4,2),NE); label("$D$",(2,0),S); label("$E$",x[0],N); [/asy]](http://latex.artofproblemsolving.com/4/1/a/41a4d56674e110de9b320f5c056a1c32c13fc24a.png)
![]()
Solution
Solution 1
Let
be the line containing
and
and let
be the line containing
and
. If we set the bottom left point at
, then
,
,
, and
.
The line
is given by the equation
. The
-intercept is
, so
. We are given two points on
, hence we can compute the slope,
to be
, so
is the line ![]()
Similarly,
is given by
. The slope in this case is
, so
. Plugging in the point
gives us
, so
is the line
.
At
, the intersection point, both of the equations must be true, so
We have the coordinates of
and
, so we can use the distance formula here:![\[\sqrt{\left(\frac{10}{3}-0\right)^2+\left(\frac{4}{3}-3\right)^2}=\frac{5\sqrt{5}}{3}\]](http://latex.artofproblemsolving.com/3/e/5/3e598a6ff0d2f1448bc262901a7b2045d5d2ab38.png)
which is answer choice ![]()
Solution 2
![[asy] path seg1, seg2; seg1=(6,0)--(0,3); seg2=(2,0)--(4,2); dot((0,0)); dot((1,0)); fill(circle((2,0),0.1),black); dot((3,0)); dot((4,0)); dot((5,0)); fill(circle((6,0),0.1),black); dot((0,1)); dot((1,1)); dot((2,1)); dot((3,1)); dot((4,1)); dot((5,1)); dot((6,1)); dot((0,2)); dot((1,2)); dot((2,2)); dot((3,2)); fill(circle((4,2),0.1),black); dot((5,2)); dot((6,2)); fill(circle((0,3),0.1),black); dot((1,3)); dot((2,3)); dot((3,3)); dot((4,3)); dot((5,3)); dot((6,3)); draw(seg1); draw(seg2); pair [] x=intersectionpoints(seg1,seg2); fill(circle(x[0],0.1),black); label("$A$",(0,3),NW); label("$B$",(6,0),SE); label("$C$",(4,2),NE); label("$D$",(2,0),S); label("$E$",x[0],N); label("$F$",(2.5,.5),E); draw((6,0)--(4,2)); draw((0,3)--(2.5,.5)); [/asy]](http://latex.artofproblemsolving.com/1/7/e/17e845bc055dd72ce11f0d025ce0bade75970b47.png)
Draw the perpendiculars from
and
to
, respectively. As it turns out,
. Let
be the point on
for which
.
, and
, so by AA similarity,![]()
By the Pythagorean Theorem, we have
,
, and
. Let
, so
, then![]()
![]()
This is answer choice ![]()
Also, you could extend CD to the end of the box and create two similar triangles. Then use ratios and find that the distance is 5/9 of the diagonal AB. Thus, the answer is B.
Solution 3
![[asy] path seg1, seg2; seg1=(6,0)--(0,3); seg2=(2,0)--(4,2); dot((0,0)); dot((1,0)); fill(circle((2,0),0.1),black); dot((3,0)); dot((4,0)); dot((5,0)); fill(circle((6,0),0.1),black); dot((0,1)); dot((1,1)); dot((2,1)); dot((3,1)); dot((4,1)); dot((5,1)); dot((6,1)); dot((0,2)); dot((1,2)); dot((2,2)); dot((3,2)); fill(circle((4,2),0.1),black); dot((5,2)); dot((6,2)); fill(circle((0,3),0.1),black); dot((1,3)); dot((2,3)); dot((3,3)); dot((4,3)); dot((5,3)); dot((6,3)); draw(seg1); draw(seg2); pair [] x=intersectionpoints(seg1,seg2); fill(circle(x[0],0.1),black); label("$A$",(0,3),NW); label("$B$",(6,0),SE); label("$C$",(4,2),NE); label("$D$",(2,0),S); label("$E$",x[0],N); label("$F$",(2,2),NE); draw((2,2)--(4,2)); draw((6,0)--(2,0)); [/asy]](http://latex.artofproblemsolving.com/4/7/d/47d4c28a6503f46c00fe5f98316320cdd4460081.png)
Drawing line
and parallel line
, we see that
by AA similarity. Thus
. Reciprocating, we know that
so
. Reciprocating again, we have
. We know that
, so by the pythagorean theorem,
. Thus
. Applying the pythagorean theorem again, we have
. We finally have ![]()
- 上一篇: AMC10每日一题(2000年真题#13)
- 下一篇: AMC10每日一题(2000年真题#17)
本站凡注明原创和署名的文章,未经课窝考试网许可,不得转载。课窝考试网的部分文章素材来自于网络,版权归原作者所有,仅供学习与研究,如果侵权,请提供版权证明,以便尽快删除。
- 试题分析:AMC10如何刷题?(七) 2020.03.04 15:02
- 试题分析:AMC10如何刷题?(六) 2020.02.13 15:56
- 试题分析:AMC10如何刷题?(五) 2020.01.15 16:17
- 试题分析:AMC10如何刷题?(四) 2020.01.13 16:27

