enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. Cyclic quadrilateral - Wikipedia

    en.wikipedia.org/wiki/Cyclic_quadrilateral

    In geometry, a cyclic quadrilateral or inscribed quadrilateral is a quadrilateral (four-sided polygon) whose vertices all lie on a single circle, making the sides chords of the circle. This circle is called the circumcircle or circumscribed circle , and the vertices are said to be concyclic .

  3. Japanese theorem for cyclic polygons - Wikipedia

    en.wikipedia.org/wiki/Japanese_theorem_for...

    In geometry, the Japanese theorem states that no matter how one triangulates a cyclic polygon, the sum of inradii of triangles is constant. [1]: p. 193 Conversely, if the sum of inradii is independent of the triangulation, then the polygon is cyclic. The Japanese theorem follows from Carnot's theorem; it is a Sangaku problem.

  4. Ptolemy's theorem - Wikipedia

    en.wikipedia.org/wiki/Ptolemy's_theorem

    This is not a cyclic quadrilateral. The equality never holds here, and is unequal in the direction indicated by Ptolemy's inequality. The equation in Ptolemy's theorem is never true with non-cyclic quadrilaterals. Ptolemy's inequality is an extension of this fact, and it is a more general form of Ptolemy's theorem.

  5. Japanese theorem for cyclic quadrilaterals - Wikipedia

    en.wikipedia.org/wiki/Japanese_theorem_for...

    Then the quadrilateral formed by M 1, M 2, M 3, M 4 is a rectangle. Proofs are given by Bogomolny [2] and Reyes. [1] This theorem may be extended to prove the Japanese theorem for cyclic polygons, according to which the sum of inradii of a triangulated cyclic polygon does not depend on how it is triangulated. The special case of the theorem for ...

  6. Dividing a circle into areas - Wikipedia

    en.wikipedia.org/wiki/Dividing_a_circle_into_areas

    The number of points (n), chords (c) and regions (r G) for first 6 terms of Moser's circle problem. In geometry, the problem of dividing a circle into areas by means of an inscribed polygon with n sides in such a way as to maximise the number of areas created by the edges and diagonals, sometimes called Moser's circle problem (named after Leo Moser), has a solution by an inductive method.

  7. Ptolemy's inequality - Wikipedia

    en.wikipedia.org/wiki/Ptolemy's_inequality

    Ptolemy's inequality is often stated for a special case, in which the four points are the vertices of a convex quadrilateral, given in cyclic order. [2] [3] However, the theorem applies more generally to any four points; it is not required that the quadrilateral they form be convex, simple, or even planar.

  8. Antiparallelogram - Wikipedia

    en.wikipedia.org/wiki/Antiparallelogram

    An antiparallelogram is a special case of a crossed quadrilateral, with two pairs of equal-length edges. [3] In general, crossed quadrilaterals can have unequal edges. [3] Special forms of the antiparallelogram are the crossed rectangles and crossed squares, obtained by replacing two opposite sides of a rectangle or square by the two diagonals.

  9. Snellius–Pothenot problem - Wikipedia

    en.wikipedia.org/wiki/Snellius–Pothenot_problem

    In trigonometry, the Snellius–Pothenot problem is a problem first described in the context of planar surveying.Given three known points A, B, C, an observer at an unknown point P observes that the line segment AC subtends an angle α and the segment CB subtends an angle β; the problem is to determine the position of the point P.