Math Problem

  • Thread starter simpleton
  • Start date
58
0

Main Question or Discussion Point

Hi,

Given that the radius of a circle is X, and the side length of a square is Y, what is the maximum number of squares you can fill inside this circle, provided that the squares do not overlap? If you know of a general formula or something, can you please tell me the proof or give me a link to the proof or something?

Thanks a lot.
 

Answers and Replies

1,016
1
Have a look at
http://www2.stetson.edu/~efriedma/packing.html
http://en.wikipedia.org/wiki/Packing_problem
http://mathworld.wolfram.com/SquarePacking.html
which gives you the answer. Consider scaling to connect it to your problem with X and Y.

I haven't heard of a general formula. But with large circles one could write down an (ugly?) formula for the bounds to the number of squares by assuming gapless packing.

Maybe for very large circles the gapless packing is even optimal? Not sure about how much the boundaries matter.
 
CRGreathouse
Science Advisor
Homework Helper
2,817
0
Maybe for very large circles the gapless packing is even optimal? Not sure about how much the boundaries matter.
Probably "square root"-ly. So not much if you're concerned about the percentage filled, but a lot if you care about the amount not filled.
 

Related Threads for: Math Problem

  • Last Post
Replies
5
Views
2K
  • Last Post
Replies
2
Views
2K
  • Last Post
Replies
3
Views
904
  • Last Post
Replies
5
Views
2K
  • Last Post
Replies
16
Views
7K
  • Last Post
Replies
3
Views
4K
  • Last Post
Replies
4
Views
2K
  • Last Post
Replies
6
Views
2K
Top