enow.com Web Search

Search results

1. Results from the WOW.Com Content Network

2. Magic circle (mathematics) - Wikipedia

   en.wikipedia.org/wiki/Magic_circle_(mathematics)

   Magic circles were invented by the Song dynasty (960–1279) Chinese mathematician Yang Hui (c. 1238–1298). It is the arrangement of natural numbers on circles where the sum of the numbers on each circle and the sum of numbers on diameters are identical. One of his magic circles was constructed from the natural numbers from 1 to 33 arranged ...

3. Packing problems - Wikipedia

   en.wikipedia.org/wiki/Packing_problems

   The hexagonal packing of circles on a 2-dimensional Euclidean plane. These problems are mathematically distinct from the ideas in the circle packing theorem.The related circle packing problem deals with packing circles, possibly of different sizes, on a surface, for instance the plane or a sphere.

4. Circle packing - Wikipedia

   en.wikipedia.org/wiki/Circle_packing

   A compact binary circle packing with the most similarly sized circles possible. [7] It is also the densest possible packing of discs with this size ratio (ratio of 0.6375559772 with packing fraction (area density) of 0.910683). [8] There are also a range of problems which permit the sizes of the circles to be non-uniform.

5. Intersecting chords theorem - Wikipedia

   en.wikipedia.org/wiki/Intersecting_chords_theorem

   In Euclidean geometry, the intersecting chords theorem, or just the chord theorem, is a statement that describes a relation of the four line segments created by two intersecting chords within a circle. It states that the products of the lengths of the line segments on each chord are equal. It is Proposition 35 of Book 3 of Euclid 's Elements.

6. 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 ... solutions for n = 2, 3, 4, 7, 19, ...

7. Dividing a circle into areas - Wikipedia

   en.wikipedia.org/wiki/Dividing_a_circle_into_areas

   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, has a solution by an inductive method. The greatest possible number of regions, rG = , giving the sequence 1, 2, 4 ...