n=12 R=80.0: 3339 reachable points (36918 nodes), types: A0:1522, A1:409, A2:205, A3:139, A4:107, A5:97, A6:107, A7:139, A8:205, A9:409
Conj 2.6: 2051 (point, l, eps) instances tested, 0 failures, 0 parallel points not found (must be 0)
Conj 2.7: 2051 pairs of parallel short trajectories tested, 0 failures
pairs (u,v) of reachable points with det(u,v) = sin(2 pi/n): 2451
  their (type u, type v) distribution: {(0, 0): 817, (0, 9): 817, (1, 0): 817}
Conj 2.3: 7 reachable n-gons inside radius R examined, 0 with wrong vertex types (2428 pairs undecided because a vertex leaves the disc)
  unitary pairs (types A0,A0): 7 span a reachable n-gon, 0 do not (must be 0); non-unitary pairs spanning a reachable n-gon: 0 (must be 0)
Conj 2.5 (corrected form: steps lambda^2, offsets 0 and lambda^2-1): 817 unitary pairs, 5606 predicted points inside the disc, 0 missing, 0 reachable points on the lines not of the predicted form/type
Conj 2.5 literal (a): n even, lambda=2cos(pi/n) is not in Q(zeta_n), so u+m(lambda+1)v is never a vertex of the development for m != 0
Conj 2.4: examined all reachable points with |w| <= R0 = 2.0: 4 points; a-priori bound for the vertices of an n-gon through w: |v_i| <= 39.3949 |w|; search exhaustive for types != A0: True
  points by type: {0: 2, 1: 1, 9: 1}
  points lying on NO reachable n-gon, by type: {}
  maximal number of reachable n-gons through a point of type != A0: {1: 1, 9: 1}
  shortest points on no reachable n-gon (ring coordinates in Z[zeta_12], type, radius):
total time 12.1s
