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 sphere packing problem is the three-dimensional version of a class of ball-packing problems in arbitrary dimensions. In two dimensions, the equivalent problem is packing circles on a plane. In one dimension it is packing line segments into a linear universe. [10]

  3. Packing problems - Wikipedia

    en.wikipedia.org/wiki/Packing_problems

    Packing different rectangles in a rectangle: The problem of packing multiple rectangles of varying widths and heights in an enclosing rectangle of minimum area (but with no boundaries on the enclosing rectangle's width or height) has an important application in combining images into a single larger image. A web page that loads a single larger ...

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

  5. Finite sphere packing - Wikipedia

    en.wikipedia.org/wiki/Finite_sphere_packing

    In mathematics, the theory of finite sphere packing concerns the question of how a finite number of equally-sized spheres can be most efficiently packed. The question of packing finitely many spheres has only been investigated in detail in recent decades, with much of the groundwork being laid by László Fejes Tóth .

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

  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. Kepler conjecture - Wikipedia

    en.wikipedia.org/wiki/Kepler_conjecture

    The volume of the Voronoi polyhedron of a sphere in a packing of equal spheres is at least the volume of a regular dodecahedron with inradius 1. McLaughlin's proof, [13] for which he received the 1999 Morgan Prize. A related problem, whose proof uses similar techniques to Hales' proof of the Kepler conjecture. Conjecture by L. Fejes Tóth in ...