Search results
Results from the WOW.Com Content Network
Regular polygons; Description Figure Second moment of area Comment A filled regular (equiliteral) triangle with a side length of a = = [6] The result is valid for both a horizontal and a vertical axis through the centroid, and therefore is also valid for an axis with arbitrary direction that passes through the origin.
Another proof that uses triangles considers the area enclosed by a circle to be made up of an infinite number of triangles (i.e. the triangles each have an angle of dπ at the centre of the circle), each with an area of β 1 / 2 β · r 2 · dπ (derived from the expression for the area of a triangle: β 1 / 2 β · a · b · sinπ ...
The area of an annulus is the difference in the areas of the larger circle of radius R and the smaller one of radius r: = = = (+) (). As a corollary of the chord formula, the area bounded by the circumcircle and incircle of every unit convex regular polygon is π /4
A circular segment (in green) is enclosed between a secant/chord (the dashed line) and the arc whose endpoints equal the chord's (the arc shown above the green area). In geometry, a circular segment or disk segment (symbol: β) is a region of a disk [1] which is "cut off" from the rest of the disk by a straight line.
Gauss's circle problem asks how many points there are inside this circle of the form (,) where and are both integers. Since the equation of this circle is given in Cartesian coordinates by x 2 + y 2 = r 2 {\displaystyle x^{2}+y^{2}=r^{2}} , the question is equivalently asking how many pairs of integers m and n there are such that
Liu Hui's method of calculating the area of a circle. Liu Hui's π algorithm was invented by Liu Hui (fl. 3rd century), a mathematician of the state of Cao Wei.Before his time, the ratio of the circumference of a circle to its diameter was often taken experimentally as three in China, while Zhang Heng (78–139) rendered it as 3.1724 (from the proportion of the celestial circle to the diameter ...
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.
The triangle of largest area of all those inscribed in a given circle is equilateral; and the triangle of smallest area of all those circumscribed around a given circle is equilateral. [ 36 ] The ratio of the area of the incircle to the area of an equilateral triangle, π 3 3 {\displaystyle {\frac {\pi }{3{\sqrt {3}}}}} , is larger than that of ...