n=10 R=80.0: 3391 reachable points (42260 nodes), types: A0:1566, A1:441, A2:233, A3:163, A4:151, A5:163, A6:233, A7:441
Conj 2.6: 2267 (point, l, eps) instances tested, 0 failures, 0 parallel points not found (must be 0)
Conj 2.7: 2267 pairs of parallel short trajectories tested, 0 failures
pairs (u,v) of reachable points with det(u,v) = sin(2 pi/n): 2607
  their (type u, type v) distribution: {(0, 0): 863, (0, 7): 872, (1, 0): 872}
Conj 2.3: 19 reachable n-gons inside radius R examined, 0 with wrong vertex types (2556 pairs undecided because a vertex leaves the disc)
  unitary pairs (types A0,A0): 19 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): 863 unitary pairs, 6112 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 = 10.0: 53 points; a-priori bound for the vertices of an n-gon through w: |v_i| <= 23.4164 |w|; search exhaustive for types != A0: False
  points by type: {0: 24, 1: 7, 2: 3, 3: 3, 4: 3, 5: 3, 6: 3, 7: 7}
  points lying on NO reachable n-gon, by type: {0: 8, 1: 3, 2: 2, 3: 2, 4: 2, 5: 2, 6: 2, 7: 3}
  maximal number of reachable n-gons through a point of type != A0: {1: 1, 2: 1, 3: 1, 4: 1, 5: 1, 6: 1, 7: 1}
  shortest points on no reachable n-gon (ring coordinates in Z[zeta_10], type, radius):
     (2, 3, 1, 0) type A7 |w| = 5.458789 (x,y) = (4.736068, 2.714412)
     (-2, 2, -1, 5) type A1 |w| = 5.458789 (x,y) = (-2.236068, 4.979797)
     (2, 2, 2, 1) type A0 |w| = 5.626053 (x,y) = (3.927051, 4.028740)
     (-2, 3, 0, 4) type A0 |w| = 5.626053 (x,y) = (-0.809017, 5.567582)
     (1, 3, 1, 3) type A0 |w| = 6.236068 (x,y) = (2.809017, 5.567582)
     (-1, 4, 0, 4) type A0 |w| = 6.236068 (x,y) = (1.000000, 6.155367)
total time 12.5s
