英语家园

 找回密码
 注册

QQ登录

只需一步,快速开始

扫一扫,访问移动社区

搜索

把纸重复折叠12次-你可以吗 Folding Paper in Half 12 Times

发布者: chrislau2001 | 发布时间: 2008-7-30 11:22| 查看数: 1822| 评论数: 2|




Photo of the 11th Fold, One More to go.  

Britney Gallivan has solved the Paper Folding Problem. This well known challenge was to fold paper in half more than seven or eight times, using paper of any size or shape.

In April of 2005 Britney's accomplishment was mentioned on the prime time CBS television show Numb3rs.

The task was commonly known to be impossible. Over the years the problem has been discussed by many people, including mathematicians and has been demonstrated to be impossible on TV.

For extra credit in a math class Britney was given the challenge to fold anything in half 12 times. After extensive experimentation, she folded a sheet of gold foil 12 times, breaking the record. This was using alternate directions of folding. But, the challenge was then redefined to fold a piece of paper. She studied the problem and was the first person to realize the basic cause for the limits. She then derived the folding limit equation for any given dimension. Limiting equations were derived for the case of folding in alternate directions and for the case of folding in a single direction using a long strip of paper. The merits of both folding approaches are discussed, but for high numbers of folds, single direction folding requires less paper.

The exact limit for single direction folding case was derived, based on the accumulative limiting effects induced by every fold in the folding process.

For the single direction folding case the exact limiting equation is:

 


where L is the minimum possible length of the material, t is material thickness, and n is the number of folds possible in one direction.

L and t need to be expressed using the same units.

Stringent rules and definitions were defined by Britney for the folding process. One rule is: For a sheet to be considered folded n times it must be convincingly documented and independently verified that (2n) unique layers are in a straight line. Sections that do not meet these criteria are not counted as a part of the folded section.

 



Diagram showing part of a rotational sliding folding sequenceIn some web pages the limits found by Britney are described as being due to thickness to width ratios of the final folds or attributed to the folder not being strong enough to fold any more times. Both explanations for the limits are incorrect and miss the actual reason for the physical mathematical limit. The actual understanding of the problem involves understanding the simple dynamics of the folding model and the resulting algebra.

In one day Britney was the first person to set the record for folding paper in half 9, 10, 11 or 12 times.

The Historical Society of Pomona Valley is now selling Britney's booklet. It contains over 40 pages of solving the problem and has interesting stories and comments from others who had tried to solve the problem. The booklet gives both detailed and general explanations of the problem's background, the physical limit and tabulates the number of times it is possible to fold different size sheets.

Alternate Direction Folding has the following limit:

 


This equation gives the width "W" of a square piece of paper needed to fold a piece of paper "n" times, by folding in alternate directions. The actual equation for alternate folding is more complicated, but this relatively simple formula gives a bound that can not be exceeded and is quite close to the actual limit.

For paper that is not square, the above equation still gives an accurate limit. If the paper is 2:1 in length to width ratio, imagine it folded one time making it twice as thick "t" and then use the above formula remembering that one extra fold is added.

Britney derived folding limits in December of 2001 and folded paper in half 12 times in January of 2002, while a junior in High School. She now attends U. C. Berkeley

最新评论

wxc 发表于 2008-7-30 16:07:35
哎呀,斑竹,双语新闻版块,现在只有英文没有中文哦,英文水平有限啊,真的看不懂呀,只有错过了,呵呵~~

[ 本帖最后由 wxc 于 2008-7-30 16:09 编辑 ]
快速回复 返回顶部 返回列表