1971 AHSME Problems/Problem 17
Revision as of 20:52, 28 January 2021 by Coolmath34 (talk | contribs) (Created page with "== Problem == A circular disk is divided by <math>2n</math> equally spaced radii(<math>n>0</math>) and one secant line. The maximum number of non-overlapping areas into whi...")
Problem
A circular disk is divided by equally spaced radii(
) and one secant line. The maximum number of non-overlapping
areas into which the disk can be divided is
Solution
We can draw the cases for small values of
It seems that for
radii, there are
distinct areas. The secant line must pass through
radii for this to occur.
The answer is
-edited by coolmath34