General Discussion Undecided where to post - do it here. |
Reply to Thread New Thread |
![]() |
#1 |
|
|
![]() |
![]() |
#2 |
|
|
![]() |
![]() |
#5 |
|
|
![]() |
![]() |
#7 |
|
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. |
![]() |
![]() |
#10 |
|
|
![]() |
![]() |
#11 |
|
|
![]() |
![]() |
#12 |
|
Have not I provided those details? All of them are standard. I graduated from calculus and I know there needs to be SOME NUMBERS and they are all standard so it should not be hard to find the limit as X approaches the number of papers I can fit. |
![]() |
![]() |
#14 |
|
Have not I provided those details? All of them are standard. I graduated from calculus and I know there needs to be SOME NUMBERS and they are all standard so it should not be hard to find the limit as X approaches the number of papers I can fit. |
![]() |
![]() |
#17 |
|
|
![]() |
![]() |
#19 |
|
At my desk right now, I have: |
![]() |
Reply to Thread New Thread |
Currently Active Users Viewing This Thread: 11 (0 members and 11 guests) | |
|