Kissing number problem

In geometry,kissing number problem isfindmaximal numberspheresradius 1 that can simultaneously touchunit spheren-dimensional Euclidean space (or, withrestrictiontheir centresbe inparticular lattice).

See also: sphere packing