 Circle packing in a square

Circle packing in a square is a packing problem in applied mathematics, where the aim is to pack "n" unit circles into the smallest possible square; or, equivalently, to arrange "n" points in a unit square aiming to get the greatest minimal separation, "dn", between points.To convert between these two formulations of the problem, the square side for unit circles will be formula_1.