enow.com Web Search

Search results

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

    en.wikipedia.org/wiki/Hendecagon

    The regular hendecagon has Dih 11 symmetry, order 22. Since 11 is a prime number there is one subgroup with dihedral symmetry: Dih 1, and 2 cyclic group symmetries: Z 11, and Z 1. These 4 symmetries can be seen in 4 distinct symmetries on the hendecagon. John Conway labels these by a letter and group order. [11]

  3. Brahmagupta's formula - Wikipedia

    en.wikipedia.org/wiki/Brahmagupta's_formula

    giving the basic form of Brahmagupta's formula. It follows from the latter equation that the area of a cyclic quadrilateral is the maximum possible area for any quadrilateral with the given side lengths. A related formula, which was proved by Coolidge, also gives the area of a general convex

  4. Method of exhaustion - Wikipedia

    en.wikipedia.org/wiki/Method_of_exhaustion

    The idea originated in the late 5th century BC with Antiphon, although it is not entirely clear how well he understood it. [1] The theory was made rigorous a few decades later by Eudoxus of Cnidus, who used it to calculate areas and volumes. It was later reinvented in China by Liu Hui in the 3rd century AD in order to find the area of a circle. [2]

  5. Shoelace formula - Wikipedia

    en.wikipedia.org/wiki/Shoelace_formula

    Shoelace scheme for determining the area of a polygon with point coordinates (,),..., (,). The shoelace formula, also known as Gauss's area formula and the surveyor's formula, [1] is a mathematical algorithm to determine the area of a simple polygon whose vertices are described by their Cartesian coordinates in the plane. [2]

  6. Hexagonal number - Wikipedia

    en.wikipedia.org/wiki/Hexagonal_number

    Proof without words that a hexagonal number (middle column) can be rearranged as rectangular and odd-sided triangular numbers. A hexagonal number is a figurate number.The nth hexagonal number h n is the number of distinct dots in a pattern of dots consisting of the outlines of regular hexagons with sides up to n dots, when the hexagons are overlaid so that they share one vertex.

  7. Pascal's theorem - Wikipedia

    en.wikipedia.org/wiki/Pascal's_theorem

    The converse is the Braikenridge–Maclaurin theorem, named for 18th-century British mathematicians William Braikenridge and Colin Maclaurin , which states that if the three intersection points of the three pairs of lines through opposite sides of a hexagon lie on a line, then the six vertices of the hexagon lie on a conic; the conic may be ...

  8. Apothem - Wikipedia

    en.wikipedia.org/wiki/Apothem

    Apothem of a hexagon Graphs of side, s; apothem, a; and area, A of regular polygons of n sides and circumradius 1, with the base, b of a rectangle with the same area. The green line shows the case n = 6. The apothem (sometimes abbreviated as apo [1]) of a regular polygon is a line

  9. Packing problems - Wikipedia

    en.wikipedia.org/wiki/Packing_problems

    Packing squares in a square: Optimal solutions have been proven for n from 1-10, 14-16, 22-25, 33-36, 62-64, 79-81, 98-100, and any square integer. The wasted space is asymptotically O(a 3/5). Packing squares in a circle: Good solutions are known for n ≤ 35. The optimal packing of 10 squares in a square