Squarely solvable?
Consider N squares of sides 1, 2, 3...N. What is the minimum length of the square that will circumscribe all of these smaller squares?
If you find that to be too easy, extend it to a circle!
(No overlaps allowed)
If you find that to be too easy, extend it to a circle!
(No overlaps allowed)
posted by littlecow at 12/02/2005 02:12:00 PM
5 Comments:
Has nothing to do with the answer, but I thought I'd suggest the use of peek-a-boo comments for improved readability of the blog.
Done. Thanks for the nice idea.
does there exist an explicit solution to this problem ?
usually, clues are not provided here unless absolutely necessary. and i will follow the custom with this problem also!
For a change, a problem was posed for which I do not know of a solution (and I am not sure a solution even exists). The circle problem is a brute force computational problem given in some competition... Meanwhile,
@grenade: how did you reason that it would take exponential time?
Post a Comment
<< Home