n=8: 3303 reachable points of length <= 78.894 (R1=9, Rpair=30)
pairs (u,v) of reachable points of length <= 30 with det(u,v) = S: 399 ; pairs of types: {(0, 0): 133, (0, 5): 133, (1, 0): 133}
unitary pairs: 133 ; each spans a reachable n-gon with vertex types A_0,A_1,...,A_(n-3),A_0 ; no other pair with det = S does; 'four vertices reachable => all reachable' holds on all pairs
Theorem E: 266 lines (u+tv and v+tu for the unitary pairs); 1996 reachable points on them inside the disc; predicted 1996; sets and types identical
printed constants (lambda+1, lambda) on u+tv, |m| <= 4, points in the upper half-plane: tested 1469, not reachable or wrong type 1279; (item, m) -> number of pairs for which the printed point is reachable with the printed type: {('a', 0): 124, ('b', -1): 66}
Theorem F(b): reachable points of type != A_0 and length <= 9: 23 ; vertex of no reachable n-gon: 12 (52.2%), of exactly one: 11, of more: 0
  shortest points which are vertices of none: |w|=5.1699 type A_5 N=3; |w|=5.1699 type A_1 N=3; |w|=6.7548 type A_4 N=3; |w|=6.7548 type A_2 N=3
w_n = 2+3zeta+zeta^2: reachable, |w_n| = 5.1699, N = 3, type A_5 ; reachable n-gons through it: 0 ; mirror image: type A_1, n-gons: 0
  the two shortest reachable points which are vertices of no reachable n-gon are w_n and its mirror image
X_2 (type A_1): vertex of exactly one reachable n-gon (P_0)
Theorem F(a): for the 4 points of type A_0 and length <= 4, the numbers of reachable n-gons through them whose two sides at O have length <= 78.89: min 17, max 24
ALL CHECKS PASSED  [2.1s]
