• Bilb!@lemmy.ml
      link
      fedilink
      English
      arrow-up
      3
      ·
      edit-2
      1 day ago

      You could arrange them that way, but the goal is to find the way to pack the small squares in a way that results in the smallest possible outer square. In the solution shown, the length of one side of the outer square is just a bit smaller than 12. If you pack them normally, the length would be larger than 12. (1 = the length of one side of the smaller squares.)