n=5: 1371 reachable points of length <= 51.539 (R1=9, Rpair=30)
pairs (u,v) of reachable points of length <= 30 with det(u,v) = S: 601 ; pairs of types: {(0, 0): 205, (0, 2): 198, (1, 0): 198}
unitary pairs: 205 ; 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: 410 lines (u+tv and v+tu for the unitary pairs); 2458 reachable points on them inside the disc; predicted 2458; sets and types identical
printed constants (lambda+1, lambda) on u+tv, |m| <= 4, points in the upper half-plane: tested 2260, not reachable or wrong type 0; (item, m) -> number of pairs for which the printed point is reachable with the printed type: {('a', -4): 7, ('a', -3): 10, ('a', -2): 16, ('a', -1): 34, ('a', 0): 193, ('a', 1): 205, ('a', 2): 205, ('a', 3): 205, ('a', 4): 205, ('b', -4): 10, ('b', -3): 15, ('b', -2): 28, ('b', -1): 102, ('b', 0): 205, ('b', 1): 205, ('b', 2): 205, ('b', 3): 205, ('b', 4): 205}
Theorem F(b): reachable points of type != A_0 and length <= 9: 16 ; vertex of no reachable n-gon: 6 (37.5%), of exactly one: 10, of more: 0
  shortest points which are vertices of none: |w|=4.0406 type A_1 N=3; |w|=4.0406 type A_2 N=3; |w|=6.6138 type A_1 N=5; |w|=6.6138 type A_2 N=5
w_n = 2+3zeta+zeta^2: reachable, |w_n| = 4.0406, N = 3, type A_2 ; 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 5 points of type A_0 and length <= 4, the numbers of reachable n-gons through them whose two sides at O have length <= 51.54: min 12, max 20
ALL CHECKS PASSED  [1.4s]
