n=6: reachable points with |B|<=30: 475 (0.0s); by type: {0: 250, 1: 81, 2: 63, 3: 81}
exact check X_j = a_j*eta + b_j*xi (j=1..n-1) and a_j, b_j >= 1 for 2<=j<=n-2: OK

=== Conjecture 2.4: named points ===
identity 2+3z+z^2 = (lam^4-lam^2-1)xi + (lam^2+1)eta = X_1 - X_{n-1} + lam^2 X_{n-2}: exact OK
X_2                    |w|=1.7321 coords(xi,eta)=(1.0000,2.0000) reachable: N=1 segments, type A_1 ; reachable n-gons with w=gX_j (2<=j<=n-2), exhaustive: 1 [(2, [0, 1, 2, 3, 0])] ; as neighbour of O: 17 partners with det=S in the disc, 0 n-gons
X_{n-2}                |w|=1.7321 coords(xi,eta)=(2.0000,1.0000) reachable: N=1 segments, type A_3 ; reachable n-gons with w=gX_j (2<=j<=n-2), exhaustive: 1 [(4, [0, 1, 2, 3, 0])] ; as neighbour of O: 17 partners with det=S in the disc, 0 n-gons
w_n = 2+3zeta+zeta^2   |w|=4.5826 coords(xi,eta)=(5.0000,4.0000) reachable: N=3 segments, type A_3 ; reachable n-gons with w=gX_j (2<=j<=n-2), exhaustive: 0 [] ; as neighbour of O: 6 partners with det=S in the disc, 0 n-gons
mirror(w_n)            |w|=4.5826 coords(xi,eta)=(4.0000,5.0000) reachable: N=3 segments, type A_1 ; reachable n-gons with w=gX_j (2<=j<=n-2), exhaustive: 0 [] ; as neighbour of O: 6 partners with det=S in the disc, 0 n-gons
(4,5) lattice          |w|=4.5826 coords(xi,eta)=(4.0000,5.0000) reachable: N=3 segments, type A_1 ; reachable n-gons with w=gX_j (2<=j<=n-2), exhaustive: 0 [] ; as neighbour of O: 6 partners with det=S in the disc, 0 n-gons
(5,4) lattice          |w|=4.5826 coords(xi,eta)=(5.0000,4.0000) reachable: N=3 segments, type A_3 ; reachable n-gons with w=gX_j (2<=j<=n-2), exhaustive: 0 [] ; as neighbour of O: 6 partners with det=S in the disc, 0 n-gons

=== Conjecture 2.4: all reachable points of type != A_0 with |w| <= 9 ===
number of points by number of reachable n-gons through them (exhaustive for the vertices gX_j, 2<=j<=n-2): {0: 10, 1: 11}
in every n-gon found the point is the vertex v_{k+1} and the vertex types are A_0,A_1,...,A_{n-3},A_0: True
   on no n-gon: |w|=4.58258 coords(xi,eta)=(4.00000, 5.00000) type A_1 N=3  [is w_n: False, is mirror(w_n): True]
   on no n-gon: |w|=4.58258 coords(xi,eta)=(5.00000, 4.00000) type A_3 N=3  [is w_n: True, is mirror(w_n): False]
   on no n-gon: |w|=5.29150 coords(xi,eta)=(4.00000, 6.00000) type A_2 N=3  [is w_n: False, is mirror(w_n): False]
   on no n-gon: |w|=5.29150 coords(xi,eta)=(6.00000, 4.00000) type A_2 N=3  [is w_n: False, is mirror(w_n): False]
type != A_0 points as a neighbour of O: 96 partners with det = S inside the disc of radius 30, reachable n-gons among them: 0

=== pairs (u,v) of reachable points with det(u,v) = S, both of radius <= 9 ===
pairs: 47 ; (type u, type v) histogram: {(0, 0): 17, (0, 3): 15, (1, 0): 15}
unitary pairs: 17 ; of these spanning a reachable n-gon with vertex types A_0,A_1,..,A_{n-3},A_0: 17 ; non-unitary pairs spanning a reachable n-gon: 0

=== Conjecture 2.5 on all unitary pairs above; lines u+tv and v+tu inside the disc of radius 30 ===
corrected statement (step lam^2, offset lam^2-1): {'lines': 34, 'on_line': 290, 'extra': 0, 'cand': 274, 'missing': 0, 'wrongtype': 0, 'lower_reach': 0, 'lower_tested': 278}
  = lines 34 ; reachable points found on them 290, of which NOT of the form u+m*lam^2*v or u+(m*lam^2-1)*v: 0 ; predicted points inside disc and on the admissible side: 274, of which not reachable: 0 ; wrong type: 0 ; predicted points on the wrong side that are reachable (other than xi, eta): 0 of 278

--- printed constants of Conjecture 2.5 (lam+1 and lam) ---
lam = 1.732050808, lam+1 = 2.732050808, lam^2 = 3.000000000, lam^2-1 = 2.000000000
n even: lam = 2cos(pi/n) is not in Q(zeta_n) (degree argument), so the printed points are not in Z[zeta_n];
  numerical illustration on up to 200 unitary pairs: minimal distance from a printed point u+m(lam+1)v, u+(lam+(m-1)(lam+1))v (m=1,2) to the set of reachable points: 0.171894
  u + lam^2 v reachable (type A_0) for 17 of 17 unitary pairs; lam^2 is not of a printed form m(lam+1) or lam+m(lam+1)
t-values found (kind A: t = m lam^2, kind B: t = m lam^2 - 1) -> number of points: {('A', -3): 2, ('A', -2): 4, ('A', -1): 8, ('A', 0): 34, ('A', 1): 34, ('A', 2): 18, ('A', 3): 12, ('A', 4): 8, ('A', 5): 8, ('A', 6): 8, ('A', 7): 8, ('A', 8): 6, ('A', 9): 4, ('A', 10): 2, ('B', -2): 2, ('B', -1): 4, ('B', 0): 16, ('B', 1): 34, ('B', 2): 22, ('B', 3): 12, ('B', 4): 8, ('B', 5): 8, ('B', 6): 8, ('B', 7): 8, ('B', 8): 6, ('B', 9): 4, ('B', 10): 2}

=== type A_0 points: number of unitary partners inside growing discs (illustration of 'infinitely many') ===
   w with |w|=1.0000 arg=-0.0000: unitary partners u (w = v_1) with |u| <= R/4, R/2, R: [0, 0, 0]
   w with |w|=1.0000 arg=2.0944: unitary partners u (w = v_1) with |u| <= R/4, R/2, R: [3, 6, 11]
   w with |w|=2.6458 arg=0.3335: unitary partners u (w = v_1) with |u| <= R/4, R/2, R: [1, 2, 4]
   w with |w|=2.6458 arg=1.7609: unitary partners u (w = v_1) with |u| <= R/4, R/2, R: [1, 2, 4]
   w with |w|=3.6056 arg=1.2898: unitary partners u (w = v_1) with |u| <= R/4, R/2, R: [0, 1, 3]
   w with |w|=3.6056 arg=0.8046: unitary partners u (w = v_1) with |u| <= R/4, R/2, R: [0, 1, 2]
exact (non-float) decisions used: 11554 ; total time 0.3s
