In geometry, the paper bag problem or teabag problem is to calculate the maximum possible inflated volume of an initially flat sealed rectangular bag which has the same shape as a cushion or pillow, made out of two pieces of material which can bend but not stretch.

A cushion filled with stuffing

According to Anthony C. Robin, an approximate formula for the capacity of a sealed expanded bag is:[1]

where w is the width of the bag (the shorter dimension), h is the height (the longer dimension), and V is the maximum volume. The approximation ignores the crimping round the equator of the bag.

A very rough approximation to the capacity of a bag that is open at one edge is:

[citation needed]

(This latter formula assumes that the corners at the bottom of the bag are linked by a single edge, and that the base of the bag is not a more complex shape such as a lens).[citation needed]

The square teabag edit

 
A numerical simulation of an inflated teabag (with crimping smoothed out)

For the special case where the bag is sealed on all edges and is square with unit sides, h = w = 1, the first formula estimates a volume of roughly

 

or roughly 0.19. According to Andrew Kepert[who?] at the University of Newcastle, Australia, an upper bound for this version of the teabag problem is 0.217+, and he has made a construction that appears to give a volume of 0.2055+.[citation needed]

Robin also found a more complicated formula for the general paper bag,[1][specify] which gives 0.2017, below the bounds given by Kepert (i.e., 0.2055+ ≤ maximum volume ≤ 0.217+).

See also edit

Notes edit

References edit

  • Robin, Anthony C (2004). "Paper Bag Problem". Mathematics Today. June. Institute of Mathematics and its Applications: 104–107. ISSN 1361-2042.
  • Weisstein, Eric W. "Paper Bag". MathWorld. Archived from the original on 2011-06-29.[circular reference]

External links edit