When.com Web Search

Search results

  1. Results From The WOW.Com Content Network
  2. Sphere packing - Wikipedia

    en.wikipedia.org/wiki/Sphere_packing

    The upper bound for the density of a strictly jammed sphere packing with any set of radii is 1 – an example of such a packing of spheres is the Apollonian sphere packing. The lower bound for such a sphere packing is 0 – an example is the Dionysian sphere packing. [27]

  3. Packing problems - Wikipedia

    en.wikipedia.org/wiki/Packing_problems

    Packing identical rectangles in a rectangle: The problem of packing multiple instances of a single rectangle of size (l,w), allowing for 90° rotation, in a bigger rectangle of size (L,W) has some applications such as loading of boxes on pallets and, specifically, woodpulp stowage. For example, it is possible to pack 147 rectangles of size (137 ...

  4. Finite sphere packing - Wikipedia

    en.wikipedia.org/wiki/Finite_sphere_packing

    For example, in the case =, it is known that the optimal packing is not a tetrahedral packing like the classical packing of cannon balls, but is likely some kind of octahedral shape. [ 1 ] The sudden transition in optimal packing shape is jokingly known by some mathematicians as the sausage catastrophe (Wills, 1985). [ 4 ]

  5. Sphere packing in a sphere - Wikipedia

    en.wikipedia.org/wiki/Sphere_packing_in_a_sphere

    Sphere packing in a sphere is a three-dimensional packing problem with the objective of packing a given number of equal spheres inside a unit sphere. It is the three-dimensional equivalent of the circle packing in a circle problem in two dimensions.

  6. Close-packing of equal spheres - Wikipedia

    en.wikipedia.org/wiki/Close-packing_of_equal_spheres

    The distance between the centers along the shortest path namely that straight line will therefore be r 1 + r 2 where r 1 is the radius of the first sphere and r 2 is the radius of the second. In close packing all of the spheres share a common radius, r. Therefore, two centers would simply have a distance 2r.

  7. Category:Packing problems - Wikipedia

    en.wikipedia.org/wiki/Category:Packing_problems

    Pages in category "Packing problems" The following 29 pages are in this category, out of 29 total. ... Sphere packing; Sphere packing in a cube;

  8. 10 Hard Math Problems That Even the Smartest People in the ...

    www.aol.com/10-hard-math-problems-even-150000090...

    For example, if s=2, then 𝜁(s) is the well-known series 1 + 1/4 + 1/9 + 1/16 + …, which strangely adds up to exactly 𝜋²/6. When s is a complex number—one that looks like a+b𝑖, using ...

  9. Hilbert's eighteenth problem - Wikipedia

    en.wikipedia.org/wiki/Hilbert's_eighteenth_problem

    Hilbert's eighteenth problem is one of the 23 Hilbert problems set out in a celebrated list compiled in 1900 by mathematician David Hilbert. It asks three separate questions about lattices and sphere packing in Euclidean space. [1]