Kissing number problem

In geometry, the kissing number problem is to find the maximal number of spheres of radius 1 that can simultaneously touch the unit sphere in n-dimensional Euclidean space (or, with the restriction for their centres to be in a particular lattice).

See also: sphere packing