\input zb-basic
\input zb-matheduc
\iteman{ZMATH 1999a.00384}
\itemau{Hilton, Peter; Pedersen, Jean}
\itemti{How to construct regular 7-sided polygons - and much else besides. Pt. 2. Some new mathematics.}
\itemso{Parabola 34, No. 2, 5-13 (1998).}
\itemab
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 period-2 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.
\itemrv{~}
\itemcc{G40}
\itemut{}
\itemli{}
\end