enow.com Web Search

Search results

1. Results from the WOW.Com Content Network

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

3. Farey sequence - Wikipedia

   en.wikipedia.org/wiki/Farey_sequence

   For every fraction ⁠ p / q ⁠ (in its lowest terms) there is a Ford circle C[⁠ p / q ⁠], which is the circle with radius 1/(2q 2) and centre at (⁠ p / q ⁠, ⁠ 1 / 2q 2 ⁠). Two Ford circles for different fractions are either disjoint or they are tangent to one another—two Ford circles never intersect. If 0 < ⁠ p / q ⁠ < 1 ...

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

5. Packing problems - Wikipedia

   en.wikipedia.org/wiki/Packing_problems

   The study of polyomino tilings largely concerns two classes of problems: to tile a rectangle with congruent tiles, and to pack one of each n-omino into a rectangle. A classic puzzle of the second kind is to arrange all twelve pentominoes into rectangles sized 3×20, 4×15, 5×12 or 6×10.

6. Basel problem - Wikipedia

   en.wikipedia.org/wiki/Basel_problem

   The Basel problem is a problem in mathematical analysis with relevance to number theory, concerning an infinite sum of inverse squares. It was first posed by Pietro Mengoli in 1650 and solved by Leonhard Euler in 1734, [1] and read on 5 December 1735 in The Saint Petersburg Academy of Sciences. [2] Since the problem had withstood the attacks of ...

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