Art of Problem Solving
AoPS Online
Math texts, online classes, and more
for students in grades 5-12.
Visit AoPS Online ‚
Books for Grades 5-12 Online Courses
Beast Academy
Engaging math books and online learning
for students ages 6-13.
Visit Beast Academy ‚
Books for Ages 6-13 Beast Academy Online
AoPS Academy
Small live classes for advanced math
and language arts learners in grades 2-12.
Visit AoPS Academy ‚
Find a Physical Campus Visit the Virtual Campus

1972 IMO Problems/Problem 2

Revision as of 11:54, 20 October 2013 by Elvis (talk | contribs) (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''' ...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

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
Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=1972_IMO_Problems/Problem_2&oldid=57355"