n=5 R=80.0: 3289 reachable points (85065 nodes), types: A0:1861, A1:714, A2:714
Conj 2.6: 5759 (point, l, eps) instances tested, 0 failures, 0 parallel points not found (must be 0)
Conj 2.7: 5759 pairs of parallel short trajectories tested, 0 failures
pairs (u,v) of reachable points with det(u,v) = sin(2 pi/n): 4269
  their (type u, type v) distribution: {(0, 0): 1421, (0, 2): 1424, (1, 0): 1424}
Conj 2.3: 335 reachable n-gons inside radius R examined, 0 with wrong vertex types (3272 pairs undecided because a vertex leaves the disc)
  unitary pairs (types A0,A0): 335 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): 1421 unitary pairs, 12534 predicted points inside the disc, 0 missing, 0 reachable points on the lines not of the predicted form/type
Conj 2.5 literal (a), m=1, point u+(lambda+1)v: 270 unitary pairs tested, 0 failures (= not a reachable point of type A0)
Conj 2.4: examined all reachable points with |w| <= R0 = 10.0: 53 points; a-priori bound for the vertices of an n-gon through w: |v_i| <= 3.8042 |w|; search exhaustive for types != A0: True
  points by type: {0: 29, 1: 12, 2: 12}
  points lying on NO reachable n-gon, by type: {1: 4, 2: 4}
  maximal number of reachable n-gons through a point of type != A0: {1: 1, 2: 1}
  shortest points on no reachable n-gon (ring coordinates in Z[zeta_10], type, radius):
     (1, 2, 1, 1) type A1 |w| = 4.040574 (x,y) = (2.618034, 3.077684)
     (1, 1, 2, 1) type A2 |w| = 4.040574 (x,y) = (2.118034, 3.440955)
     (2, 3, 2, 1) type A1 |w| = 6.613822 (x,y) = (4.736068, 4.616525)
     (1, 2, 3, 2) type A2 |w| = 6.613822 (x,y) = (2.927051, 5.930853)
     (3, 2, 4, 1) type A2 |w| = 8.119297 (x,y) = (5.545085, 5.930853)
     (1, 4, 2, 3) type A1 |w| = 8.119297 (x,y) = (3.927051, 7.106424)
total time 13.7s
