Search results
Results From The WOW.Com Content Network
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
The apothem is half the cotangent of /, and the area of each of the 14 small triangles is one-fourth of the apothem. The area of a regular heptagon inscribed in a circle of radius R is , while the area of the circle itself is ; thus the regular heptagon fills approximately 0.8710 of its circumscribed circle.
The diagonals divide the polygon into 1, 4, 11, 24, ... pieces. [a] For a regular n-gon inscribed in a circle of radius , the product of the distances from a given vertex to all other vertices (including adjacent vertices and vertices connected by a diagonal) equals n.
The area of a regular polygon is given in terms of the radius r of its inscribed circle and its perimeter p by A = 1 2 ⋅ p ⋅ r . {\displaystyle A={\tfrac {1}{2}}\cdot p\cdot r.} This radius is also termed its apothem and is often represented as a .
The area of a regular polygon is half its perimeter multiplied by the distance from its center to its sides, and because the sequence tends to a circle, the corresponding formula–that the area is half the circumference times the radius–namely, A = 1 / 2 × 2πr × r, holds for a circle.
In geometry, the napkin-ring problem involves finding the volume of a "band" of specified height around a sphere, i.e. the part that remains after a hole in the shape of a circular cylinder is drilled through the center of the sphere.
[4] In particular this is true for regular polygons with evenly many sides, in which case the parallelograms are all rhombi. For the regular hexadecagon, m=8, and it can be divided into 28: 4 squares and 3 sets of 8 rhombs. This decomposition is based on a Petrie polygon projection of an 8-cube, with 28 of 1792 faces.
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.