Comment on Just one more square bro
AnarchistArtificer@slrpnk.net 1 day agoThe optimisation objective is to fit n smaller squares (in this case, n=17) into the larger square, whilst minimising the size of the outer square. So that means that in this problem, the dimensions of the outer square isn’t a thing that we’re choosing the dimensions of, but rather discovering its dimensions (given the objective of "minimise the dimensions of the outer square whilst fitting 17 smaller squares inside it)
wolframhydroxide@sh.itjust.works 1 day ago
Specifically, the optimal area side length of the larger square for any integer n is the square root of n. The closer your larger side length gets to sqrt(n), the more efficient your packing.