Open Access
Table 2
Number of cuts for smallest and largest divisors for m-polygons.
| m | d1 | dm | d1 + dm |
|---|---|---|---|
| 3 | 2 | 7 | 9 |
| 4 | 4 | 7 | 11 |
| 5 | 5 | 12 | 17 |
| 6 | 7 | 12 | 19 |
| 7 | 8 | 17 | 25 |
| 8 | 10 | 17 | 27 |
| 9 | 11 | 22 | 33 |
| 10 | 13 | 22 | 35 |
| … | … | … | … |
| m = 2k + 1 | 3k − 1 | 5k + 2 | 8k + 1 = 4m − 3 |
| m = 2k | 3k – 2 | 5k − 3 | 8km – 5 = 4m − 5 |