For any n≥1 and a geometric shape P (e.g. a polygon, a polytope or a sphere), let C(n,P) denote the smallest scale s such that one can place n identical copies of P with disjoint interiors inside another copy of P scaled up by a factor of s. Establish lower and upper bounds for C(n,P) that are as strong as possible.