# Cyclic

*This article is a stub. Help us out by expanding it.*

A polygon is **cyclic** if it can be inscribed in a circle, that is, if there exists a circle so that every vertex of the polygon lies on the circle. All (nondegenerate) triangles and all regular polygons are cyclic. When talking about a cyclic polygon, the circle in which it can be inscribed is called its circumcircle. The radius of this circle is known as the circumradius of the polygon.

Because two different circles intersect in at most two points, any polygon can be inscribed in at most one circle.

Since all nondegenerate triangles are cyclic, the simplest polygon for which it is interesting to consider cyclicity is the quadrilateral. The existence of cyclic quadrilaterals in a geometry problem often suggests angle chasing. Given a nondegenerate, convex quadrilateral (with vertices in that order) in the plane, the following conditions are all equivalent:

- (with vertices in that order) is cyclic
- and are equal (this also holds for three other pairs of angles, found by considering equivalent quadrilaterals , , )
- and are supplementary (this also holds for the other pair of angles and .

The above approach requires you to be able to determine the order of vertices of the cyclic quadrilateral. Sometimes, given a problem, there is more than one possible order for some cyclic quadrilateral, and the problem of configuration dependence arises. Often, this problem can be circumvented through the usage of directed angles (but directed angles have their own pitfalls, so be careful).