View Single Post
Old 05-05-2010, 08:05 PM   #7
Lunims

Join Date
Nov 2005
Location
CA
Posts
601
Senior Member
Default
Make A= width of envelope, B= height of envelope, X= width of paper, Y= height of paper.

Find lowest possible positive integers l,m and n,o so that X/l < A, Y/m < B, X/n < B, Y/o < A

compare l+m and n+o, and pick the lowest of the two. If equal, prefer powers of two, even numbers, odd numbers in that order. Of the chosen pair, the first number (l or n) is the amount of folds over the paper's width, and the second (m or o) the amount of folds over its height.
Lunims is offline


 

All times are GMT +1. The time now is 07:58 AM.
Copyright ©2000 - 2012, Jelsoft Enterprises Ltd.
Design & Developed by Amodity.com
Copyright© Amodity