On Wed, 2014-02-05 at 16:44 -0500, Ralph Jones wrote:
When I read about someone having this sort of difficulty, I want to remind
about using a grid of evenly (equally) spaced lines. Align one edge of your
paper from gridline zero, on one corner, to gridline N (odd integer N=eleven,
in this case), on the other adjacent corner. Pick an even number 2M less than
N (2M=10 is good), and fold the lower corner to gridline 2M, creasing across
the paper. Now either M or N-M is even, so it's easy to crease that part of
the paper in half. Some folding sequence such as
[M,N-M]=[5,6], [8,3], [4,7], [2,9], [1,10], [6,5], [3,8], [7,4], [9,2],
[10,1] gets all N-1 creases to divide the paper into N sections. Crease each
section in 2,4,8 . . parts to get 2N, 4N, 8N . . sections.
This is such a standard technique, I wonder how it is so very frequently
missed.
Thank you and have a great day!
SVBE(si vales, bene est)
The early bird may get the worm, sure, but the second mouse gets the cheese.
-
Cheers, Ralph Jones
That *is* really nice: essentially Fujimoto's approximate algorithm with
a perfect first guess:-)
Neil
