When.com Web Search

Search results

  1. Results From The WOW.Com Content Network
  2. 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 ...

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

  4. Area of a circle - Wikipedia

    en.wikipedia.org/wiki/Area_of_a_circle

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

  5. Malfatti circles - Wikipedia

    en.wikipedia.org/wiki/Malfatti_circles

    Malfatti's assumption that the two problems are equivalent is incorrect. Lob and Richmond (), who went back to the original Italian text, observed that for some triangles a larger area can be achieved by a greedy algorithm that inscribes a single circle of maximal radius within the triangle, inscribes a second circle within one of the three remaining corners of the triangle, the one with the ...

  6. Circle packing - Wikipedia

    en.wikipedia.org/wiki/Circle_packing

    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. Smallest-circle problem - Wikipedia

    en.wikipedia.org/wiki/Smallest-circle_problem

    The algorithm selects one point p randomly and uniformly from P, and recursively finds the minimal circle containing P – {p}, i.e. all of the other points in P except p. If the returned circle also encloses p, it is the minimal circle for the whole of P and is returned. Otherwise, point p must lie on the boundary of the result circle.

  8. Measurement of a Circle - Wikipedia

    en.wikipedia.org/wiki/Measurement_of_a_Circle

    A page from Archimedes' Measurement of a Circle. Measurement of a Circle or Dimension of the Circle (Greek: Κύκλου μέτρησις, Kuklou metrēsis) [1] is a treatise that consists of three propositions, probably made by Archimedes, ca. 250 BCE. [2] [3] The treatise is only a fraction of what was a longer work. [4] [5]

  9. Dividing a circle into areas - Wikipedia

    en.wikipedia.org/wiki/Dividing_a_circle_into_areas

    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.