When.com Web Search

Search results

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

    en.wikipedia.org/wiki/Sphere_packing

    Sphere packing finds practical application in the stacking of cannonballs. In geometry, a sphere packing is an arrangement of non-overlapping spheres within a containing space. The spheres considered are usually all of identical size, and the space is usually three-dimensional Euclidean space.

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

  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.

  5. Close-packing of equal spheres - Wikipedia

    en.wikipedia.org/wiki/Close-packing_of_equal_spheres

    Denser sphere packings are known, but they involve unequal sphere packing. A packing density of 1, filling space completely, requires non-spherical shapes, such as honeycombs . Replacing each contact point between two spheres with an edge connecting the centers of the touching spheres produces tetrahedrons and octahedrons of equal edge lengths.

  6. Kepler conjecture - Wikipedia

    en.wikipedia.org/wiki/Kepler_conjecture

    Sphere packing in higher dimensions In 2016, Maryna Viazovska announced proof of the optimal sphere packing in dimension 8, which quickly led to a solution in dimension 24. [14] However, the optimal sphere packing question in dimensions other than 1, 2, 3, 8, and 24 is still open. Ulam's packing conjecture

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

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

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

    The Kissing Number Problem. A broad category of problems in math are called the Sphere Packing Problems. They range from pure math to practical applications, generally putting math terminology to ...

  9. Random close pack - Wikipedia

    en.wikipedia.org/wiki/Random_close_pack

    Random close packing (RCP) of spheres is an empirical parameter used to characterize the maximum volume fraction of solid objects obtained when they are packed randomly. For example, when a solid container is filled with grain, shaking the container will reduce the volume taken up by the objects, thus allowing more grain to be added to the container.