Search results
Results from the WOW.Com Content Network
Following Archimedes' argument in The Measurement of a Circle (c. 260 BCE), compare the area enclosed by a circle to a right triangle whose base has the length of the circle's circumference and whose height equals the circle's radius. If the area of the circle is not equal to that of the triangle, then it must be either greater or less.
The area-equivalent radius of a 2D object is the radius of a circle with the same area as ... one can calculate its area ... diameter is the "diameter of a circle ...
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 arc length, from the familiar geometry of a circle, is s = θ R {\displaystyle s={\theta }R} The area a of the circular segment is equal to the area of the circular sector minus the area of the triangular portion (using the double angle formula to get an equation in terms of θ {\displaystyle \theta } ):
A circular mil is a unit of area, equal to the area of a circle with a diameter of one mil (one thousandth of an inch or 0.0254 mm). It is equal to π /4 square mils or approximately 5.067 × 10 −4 mm 2. It is a unit intended for referring to the area of a wire with a circular cross section.
where a is the radius of the circle, (,) are the polar coordinates of a generic point on the circle, and (,) are the polar coordinates of the centre of the circle (i.e., r 0 is the distance from the origin to the centre of the circle, and φ is the anticlockwise angle from the positive x axis to the line connecting the origin to the centre of ...
The most efficient way to pack different-sized circles together is not obvious. In geometry, circle packing is the study of the arrangement of circles (of equal or varying sizes) on a given surface such that no overlapping occurs and so that no circle can be enlarged without creating an overlap.
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