## prefix n = 66: L = 4313, slots 9419..13721 uniform w = 1: sum_q max_b W(q,b) = 67, W(D) = 66, F1 = |D| - sum_q M(q) = -1 min-max search: min f(w) <= 0.891393 (at iter 5654); fractional-cover slack = -674 CERTIFICATE (integer w, deficit 108604 of 999966): sum_q max_b W(q,b) = 891362 < sum_s w_s = 999966 per-prime maxima: 101:42418, 103:55659, 107:56821, 109:50798, 113:53975, 127:47781, 131:47086, 137:43540, 139:48690, 149:40934, 151:47136, 157:42260, 163:45767, 167:50256, 173:41812, 179:46984, 181:41872, 191:44464, 193:43109 w_s x 10^6: 20387 17919 22729 9472 4106 10449 20296 7126 20595 13909 22033 23966 15363 11605 14166 4664 4424 7729 19279 14299 0 16222 20951 21997 3620 21972 20728 19092 11092 22133 22667 22762 7078 25114 20072 23471 20847 6726 7310 12383 19968 20847 19143 8029 23725 13387 21174 6701 11199 18261 13468 15574 21115 6259 18280 13216 22603 13895 2903 10319 9468 11901 9864 18937 18244 20733 dead slot x = 9719; mikecann w(x)=3, others 2: sum_q max_b W(q,b) = 134 < W(D) = 133 -> no deficit per-prime maxima: 101:6, 103:8, 107:8, 109:8, 113:8, 127:6, 131:8, 137:6, 139:6, 149:8, 151:6, 157:8, 163:8, 167:6, 173:6, 179:8, 181:8, 191:6, 193:6