For the uninitiated: this is the current most-efficient method found of packing 17 unit squares inside another square. You may not like it, but this is what peak efficiency looks like.
(Of course, 16 squares has a packing coefficient of 4, compared to this arrangement’s 4.675, so this is just what peak efficiency looks like for 17 squares)
Edit: For the record, since this blew up, a tiny nitpick in my own explanation above: a smaller value of the packing coefficient is not actually what makes it more efficient (as it is simply the ratio of the larger square’s side to the sides of the smaller squares). The optimal efficiency (zero interstitial space) is achieved when the packing coefficient is precisely equal to the square root of the number of smaller squares. Hence why the case of n=25, with a packing coefficient of 5, is actually more efficient than this packing of n=17, with a packing coefficient of 4.675. Since sqrt(25)=5, that case is a perfectly efficient packing, equal to the case of n=16 with coefficient of 4. Since sqrt(17)=4.123, this packing above is not perfectly efficient, leaving interstices. Obviously. This also means that we may yet find a packing for n=17 with a packing coefficient closer to sqrt(17), which would be an interesting breakthrough, but more important are the questions “is it possible to prove that a given packing is the most efficient possible packing for that value of n” and “does there exist a general rule which produces the most efficient possible packing for any given value of n unit squares?”
Isn’t this only true if the outer square’s size is not an integer multiple of the inner square’s size? Meaning, if you have to do this to your waffle iron, you simply chose the dimensions poorly.
The 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)
Specifically, the optimal side length of the larger square for any natural number of smaller squares ‘n’ is the square root of n (assuming the smaller squares are unit squares). The closer your larger side length gets to sqrt(n), the more efficient your packing.
For the uninitiated: this is the current most-efficient method found of packing 17 unit squares inside another square. You may not like it, but this is what peak efficiency looks like.
(Of course, 16 squares has a packing coefficient of 4, compared to this arrangement’s 4.675, so this is just what peak efficiency looks like for 17 squares)
Edit: For the record, since this blew up, a tiny nitpick in my own explanation above: a smaller value of the packing coefficient is not actually what makes it more efficient (as it is simply the ratio of the larger square’s side to the sides of the smaller squares). The optimal efficiency (zero interstitial space) is achieved when the packing coefficient is precisely equal to the square root of the number of smaller squares. Hence why the case of n=25, with a packing coefficient of 5, is actually more efficient than this packing of n=17, with a packing coefficient of 4.675. Since sqrt(25)=5, that case is a perfectly efficient packing, equal to the case of n=16 with coefficient of 4. Since sqrt(17)=4.123, this packing above is not perfectly efficient, leaving interstices. Obviously. This also means that we may yet find a packing for n=17 with a packing coefficient closer to sqrt(17), which would be an interesting breakthrough, but more important are the questions “is it possible to prove that a given packing is the most efficient possible packing for that value of n” and “does there exist a general rule which produces the most efficient possible packing for any given value of n unit squares?”
Isn’t this only true if the outer square’s size is not an integer multiple of the inner square’s size? Meaning, if you have to do this to your waffle iron, you simply chose the dimensions poorly.
The 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)
Specifically, the optimal side length of the larger square for any natural number of smaller squares ‘n’ is the square root of n (assuming the smaller squares are unit squares). The closer your larger side length gets to sqrt(n), the more efficient your packing.
Or maybe you just want waffles with 17 squares in them.