We cut out from one square sheet (cardboard), four small squares and make a cross-shaped piece out of the box. Then we cut out of four small square sheets sixteen more small squares and make them into new boxes and so on to infinity. What will be the maximum amount of an infinite number of boxes?
AlanStevens wrote:
Interesting recursive relation for 'a'. Can't see where this particular one comes from!
I can't see too 
One reader of first my book on Mathcad (see the Preface >>>) has sent me this solution without any description (may de he was legendary Tom Gutman 
)
And other same problem! How many cones with max sum volumes we can do from one circle workpiece?
Here's a "starter for ten". Numerical only. I've assumed each segment angle bears same relationship to what remains as first segment angle bears to whole cirlce. I haven't proved that this leads to the maximum volume (it might not!).
Alan
AlanStevens wrote:
Here's a "starter for ten".
Ten!?
Sorry, Alan!
I think we can have only two cones with max sum volume.
The sum volume is less with 3-d cone!
