1994 AHSME Problems/Problem 26

Revision as of 21:09, 27 June 2014 by TheMaskedMagician (talk | contribs) (Created page with "==Problem== A regular polygon of <math>m</math> sides is exactly enclosed (no overlaps, no gaps) by <math>m</math> regular polygons of <math>n</math> sides each. (Shown here for ...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Problem

A regular polygon of $m$ sides is exactly enclosed (no overlaps, no gaps) by $m$ regular polygons of $n$ sides each. (Shown here for $m=4, n=8$.) If $m=10$, what is the value of $n$? [asy] size(200); defaultpen(linewidth(0.8)); draw(unitsquare); path p=(0,1)--(1,1)--(1+sqrt(2)/2,1+sqrt(2)/2)--(1+sqrt(2)/2,2+sqrt(2)/2)--(1,2+sqrt(2))--(0,2+sqrt(2))--(-sqrt(2)/2,2+sqrt(2)/2)--(-sqrt(2)/2,1+sqrt(2)/2)--cycle; draw(p); draw(shift((1+sqrt(2)/2,-sqrt(2)/2-1))*p); draw(shift((0,-2-sqrt(2)))*p); draw(shift((-1-sqrt(2)/2,-sqrt(2)/2-1))*p);[/asy] $\textbf{(A)}\ 5 \qquad\textbf{(B)}\ 6 \qquad\textbf{(C)}\ 14 \qquad\textbf{(D)}\ 20 \qquad\textbf{(E)}\ 26$

Solution