Search results
Results from the WOW.Com Content Network
The sum of the squared distances from the vertices of a regular n-gon to any point on its circumcircle equals 2nR 2 where R is the circumradius. [4]: p. 73 The sum of the squared distances from the midpoints of the sides of a regular n-gon to any point on the circumcircle is 2nR 2 − 1 / 4 ns 2, where s is the side length and R is the ...
Let one n-gon be inscribed in a circle, and let another n-gon be tangential to that circle at the vertices of the first n-gon. Then from any point P on the circle, the product of the perpendicular distances from P to the sides of the first n-gon equals the product of the perpendicular distances from P to the sides of the second n-gon. [13]
In Euclidean geometry, a cyclic quadrilateral or inscribed quadrilateral is a quadrilateral whose vertices all lie on a single circle. This circle is called the circumcircle or circumscribed circle, and the vertices are said to be concyclic. The center of the circle and its radius are called the circumcenter and the circumradius respectively.
The quadrature of the circle does not have a solid construction. A regular n-gon has a solid construction if and only if n=2 a 3 b m where a and b are some non-negative integers and m is a product of zero or more distinct Pierpont primes (primes of the form 2 r 3 s +1).
The circle k 2 determines the point H instead of the bisector w 3. The circle k 4 around the point G' (reflection of the point G at m) yields the point N, which is no longer so close to M, for the construction of the tangent. Some names have been changed. Heptadecagon in principle according to H.W. Richmond, a variation of the design regarding ...
If n = pq with p = 2 or p and q coprime, an n-gon can be constructed from a p-gon and a q-gon. If p = 2, draw a q-gon and bisect one of its central angles. From this, a 2q-gon can be constructed. If p > 2, inscribe a p-gon and a q-gon in the same circle in such a way that they share a
As cycle graphs can be drawn as regular polygons, the symmetries of an n-cycle are the same as those of a regular polygon with n sides, the dihedral group of order 2n. In particular, there exist symmetries taking any vertex to any other vertex, and any edge to any other edge, so the n-cycle is a symmetric graph.
Illustration of Poncelet's porism for n = 3, a triangle that is inscribed in one circle and circumscribes another.. In geometry, Poncelet's closure theorem, also known as Poncelet's porism, states that whenever a polygon is inscribed in one conic section and circumscribes another one, the polygon must be part of an infinite family of polygons that are all inscribed in and circumscribe the same ...