Difference between revisions of "1981 AHSME Problems/Problem 20"
Arcticturn (talk | contribs) (→Problem) |
Arcticturn (talk | contribs) (→Solution) |
||
(4 intermediate revisions by the same user not shown) | |||
Line 1: | Line 1: | ||
− | ==Problem | + | ==Problem== |
A ray of light originates from point <math>A</math> and travels in a plane, being reflected <math>n</math> times between lines <math>AD</math> and <math>CD</math> before striking a point <math>B</math> (which may be on <math>AD</math> or <math>CD</math>) perpendicularly and retracing its path back to <math>A</math> (At each point of reflection the light makes two equal angles as indicated in the adjoining figure. The figure shows the light path for <math>n=3</math>). If <math>\measuredangle CDA=8^\circ</math>, what is the largest value <math>n</math> can have? | A ray of light originates from point <math>A</math> and travels in a plane, being reflected <math>n</math> times between lines <math>AD</math> and <math>CD</math> before striking a point <math>B</math> (which may be on <math>AD</math> or <math>CD</math>) perpendicularly and retracing its path back to <math>A</math> (At each point of reflection the light makes two equal angles as indicated in the adjoining figure. The figure shows the light path for <math>n=3</math>). If <math>\measuredangle CDA=8^\circ</math>, what is the largest value <math>n</math> can have? | ||
Line 31: | Line 31: | ||
<math> \textbf{(A)}\ 6\qquad\textbf{(B)}\ 10\qquad\textbf{(C)}\ 38\qquad\textbf{(D)}\ 98\qquad\textbf{(E)}\ \text{There is no largest value.} </math> | <math> \textbf{(A)}\ 6\qquad\textbf{(B)}\ 10\qquad\textbf{(C)}\ 38\qquad\textbf{(D)}\ 98\qquad\textbf{(E)}\ \text{There is no largest value.} </math> | ||
+ | |||
+ | ==Solution== | ||
+ | Notice that when we start, we want the smallest angle possible of reflection. The ideal reflection would be <math>0</math>, but that would be impossible. Therefore we start by working backwards. Since angle <math>CDA</math> is <math>8</math>, the reflection would give us a triangle with angles <math>16, 90</math>, and <math>74</math>. Then, when we reflect again, we will have <math>180 - 74 - 74</math> = <math>32</math>. Since the other side of the reflection when we had the <math>82</math> degrees had carried over to the other side, we have a <math>32-82-66</math> triangle. | ||
+ | |||
+ | Notice that we keep decreasing by increments of <math>8</math>. This is because the starting angle was <math>8</math> and since we always have to decrease <math>8</math> every time and that every triangle has every increasing angles of <math>8</math>, we must decrease by <math>8</math> every time. This is the most optimal path of the light beam. | ||
+ | |||
+ | The pattern of light will be <math>82-74-66-58-50-42-34-26-18-10</math>. When we get to the angle of <math>2</math> degrees, we have reached angle <math>A</math>. Therefore, we don't count the <math>2</math>, so our total number of reflections between <math>CD</math> and <math>AD</math> is <math>\boxed {(B) 10}</math> | ||
+ | |||
+ | ~Arcticturn |
Latest revision as of 19:35, 23 October 2021
Problem
A ray of light originates from point and travels in a plane, being reflected
times between lines
and
before striking a point
(which may be on
or
) perpendicularly and retracing its path back to
(At each point of reflection the light makes two equal angles as indicated in the adjoining figure. The figure shows the light path for
). If
, what is the largest value
can have?
Solution
Notice that when we start, we want the smallest angle possible of reflection. The ideal reflection would be , but that would be impossible. Therefore we start by working backwards. Since angle
is
, the reflection would give us a triangle with angles
, and
. Then, when we reflect again, we will have
=
. Since the other side of the reflection when we had the
degrees had carried over to the other side, we have a
triangle.
Notice that we keep decreasing by increments of . This is because the starting angle was
and since we always have to decrease
every time and that every triangle has every increasing angles of
, we must decrease by
every time. This is the most optimal path of the light beam.
The pattern of light will be . When we get to the angle of
degrees, we have reached angle
. Therefore, we don't count the
, so our total number of reflections between
and
is
~Arcticturn