enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. Area of a circle - Wikipedia

    en.wikipedia.org/wiki/Area_of_a_circle

    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.

  3. Liu Hui's π algorithm - Wikipedia

    en.wikipedia.org/wiki/Liu_Hui's_π_algorithm

    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 ...

  4. List of second moments of area - Wikipedia

    en.wikipedia.org/wiki/List_of_second_moments_of_area

    The second moment of area, also known as area moment of inertia, is a geometrical property of an area which reflects how its points are distributed with respect to an arbitrary axis. The unit of dimension of the second moment of area is length to fourth power, L 4, and should not be confused with the mass moment of inertia.

  5. Gauss circle problem - Wikipedia

    en.wikipedia.org/wiki/Gauss_circle_problem

    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

  6. Circle packing - Wikipedia

    en.wikipedia.org/wiki/Circle_packing

    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.

  7. Circle packing in a circle - Wikipedia

    en.wikipedia.org/wiki/Circle_packing_in_a_circle

    Circle packing in a circle is a two-dimensional packing problem with the objective of packing unit circles into the smallest possible larger circle. Table of solutions, 1 ≤ n ≤ 20 [ edit ]

  8. Area - Wikipedia

    en.wikipedia.org/wiki/Area

    The formula for the area of a circle (more properly called the area enclosed by a circle or the area of a disk) is based on a similar method. Given a circle of radius r, it is possible to partition the circle into sectors, as shown in the figure to the right. Each sector is approximately triangular in shape, and the sectors can be rearranged to ...

  9. Goat grazing problem - Wikipedia

    en.wikipedia.org/wiki/Goat_grazing_problem

    A circle containing one acre is cut by another whose center is on the circumference of the given circle, and the area common to both is one-half acre. Find the radius of the cutting circle. The solutions in both cases are non-trivial but yield to straightforward application of trigonometry, analytical geometry or integral calculus.