Difference between revisions of "2008 iTest Problems/Problem 99"
(solution) |
(→Solution) |
||
Line 11: | Line 11: | ||
Let <math>A_1, A_2</math> be the trisection points on <math>\overline{AB},\overline{AD}</math>, respectively, that are closest to <math>A</math>. Then the operation <math>\text{clip}(P)</math> deletes <math>\triangle A_1AA_2</math>. Since <math>A_1A/AB = 1/3, A_2A/AD = 1/3</math>, and <math>\triangle A_1AA_2, \triangle BAD</math> share common <math>\angle A</math>, we have <math>\triangle A_1AA_2 \sim \triangle BAD</math> by side ratio <math>1/3</math>. Their areas are in the ratio <math>(1/3)^2 = 1/9</math>. | Let <math>A_1, A_2</math> be the trisection points on <math>\overline{AB},\overline{AD}</math>, respectively, that are closest to <math>A</math>. Then the operation <math>\text{clip}(P)</math> deletes <math>\triangle A_1AA_2</math>. Since <math>A_1A/AB = 1/3, A_2A/AD = 1/3</math>, and <math>\triangle A_1AA_2, \triangle BAD</math> share common <math>\angle A</math>, we have <math>\triangle A_1AA_2 \sim \triangle BAD</math> by side ratio <math>1/3</math>. Their areas are in the ratio <math>(1/3)^2 = 1/9</math>. | ||
− | + | Similarly, <math>[C_1CC_2] = \frac{1}{9}[BCD]</math>, and <math>[A_1AA_2] + [C_1CC_2] = \frac{1}{9}[ABCD]</math>. Cutting along diagonal <math>AC</math>, we get the same result, so <math>D_1 = \frac{2}{9}P_1</math>. | |
Revision as of 22:48, 9 February 2016
Problem
Given a convex, -sided polygon
, form a
-sided polygon
by cutting off each corner of
at the edges’ trisection points. In other words,
is the polygon whose vertices are the
edge trisection points of
, connected in order around the boundary of
. Let
be an isosceles trapezoid with side lengths
, and
, and for each
, let
. This iterative clipping process approaches a limiting shape
. If the difference of the areas of
and
is written as a fraction
in lowest terms, calculate the number of positive integer factors of
.
Solution
Let be the difference in the areas between
and
. Let our trapezoid be
(and
); then without loss of generality construct diagonal
.
![[asy] pathpen = linewidth(0.7);pen d = linetype("4 4")+linewidth(0.7); pair A=(0,0),B=(5,12),C=(8,12),D=(13,0),A1=B/3,A2=D/3; D(MP("A",A)--MP("B",B,N)--MP("C",C,N)--MP("D",D)--cycle); D(B--D); D(MP("A_1",A1,NW) -- MP("A_2",A2)); D(D+2(C-D)/3 -- B+2(C-B)/3); D(4B/9 -- (A+D)/3+2*((A+B)/3 - (A+D)/3)/3, d); D(4D/9 -- (A+D)/3 + ((A+B)/3 - (A+D)/3)/3, d); [/asy]](http://latex.artofproblemsolving.com/f/3/0/f30c6ba339233428c01745f5f17d417b372f0006.png)
Let be the trisection points on
, respectively, that are closest to
. Then the operation
deletes
. Since
, and
share common
, we have
by side ratio
. Their areas are in the ratio
.
Similarly, , and
. Cutting along diagonal
, we get the same result, so
.
We now consider the effects of the second clipping. Without loss of generality consider what happens along the vertex of
. Let
be the trisection point along
(again closest to
), and
be the trisection point along
. Now
and
, and
. Using the
definition of the area of a triangle, we see that
. A similar clipping about
gives
; around each clipped region in
, we clip a new area
. Generalizing, we have the recursion
.
Then, . Hence,

Then has
factors.