
02325741
j
1999a.00384
Hilton, Peter
Pedersen, Jean
How to construct regular 7sided polygons  and much else besides. Pt. 2. Some new mathematics.
Parabola 34, No. 2, 513 (1998).
1998
AMT Publishing, Australian Mathematics Trust, University of Canberra, Canberra; School of Mathematics \& Statistics, University of New South Wales, Sydney
EN
G40
In Part 1 (Parabola Vol. 34, No 1) the authors introduced you to a basic construction whereby they folded down $m$ times at the top of a tape and folded up $n$ times at the bottom of the tape. Such a procedure is called a period2 folding procedure, more specifically, the $(m, n)$folding procedure. In fact, we only discussed the special cases $(m,n)=(1,1), (2,2), (3,3), (2,1)$ but it surely must have been clear that we could have carried out the basic construction for any positive integers $m,n$. The authors discuss here what they would have got, in general.