Find the minimum size square capable of bounding n equal squares arranged in any configuration. The first few cases are illustrated above (Friedman). The only packings which have been proven optimal are 2, 3, 5, 6, 7, 8, 14, 15, 24, and 35, in addition to the trivial cases of the square numbers (Friedman). If n = a^2 - a for some a, it is conjectured that the size of the minimum bounding square is a for small n. The smallest n for which the conjecture is known to be violated is n = 272 (with a = 17). The following table gives the smallest known side lengths for a square into which n unit squares can be packed. An asterisk (*)indicates that a packing has been proven to be optimal.
We guarantee you’ll find the right tutor, or we’ll cover the first hour of your lesson.
Club Z! has connected me with a tutor through their online platform! This was exactly the one-on-one attention I needed for my math exam. I was very pleased with the sessions and ClubZ’s online tutoring interface.
My son was suffering from low confidence in his educational abilities. I was in need of help and quick. Club Z! assigned Charlotte (our tutor) and we love her! My son’s grades went from D’s to A’s and B’s.
I’ve been using Club Z’s online classrooms to receive some help and tutoring for 2 of my college classes. I must say that I am very impressed by the functionality and ease of use of their online App. Working online with my tutor has been a piece of cake. Thanks Z.
Jonathan is doing really well in all of his classes this semester, 5 A’s & 2 B’s (he has a computer essentials class instead of PLC). In his Algebra class that Nathan is helping him with he has an A+.
Sarah is very positive, enthusiastic and encourages my daughter to do better each time she comes. My daughter’s grade has improved, we are very grateful for Sarah and that she is tutoring our daughter. Way to go ClubZ!
