Difference between revisions of "1972 IMO Problems/Problem 2"
(Created page with "Prove that if n > 3; every quadrilateral that can be inscribed in a circle can be dissected into n quadrilaterals each of which is inscribable in a circle. '''SOLUTION''' ...") |
(No difference)
|
Revision as of 12:54, 20 October 2013
Prove that if n > 3; every quadrilateral that can be inscribed in a circle can be dissected into n quadrilaterals each of which is inscribable in a circle.
SOLUTION
Help us by adding a solution
