1) V1 For every epsilon>0, are there infinitely many n such that omega(n-k)<(1+epsilon)log(k)/log(log(k)) for every k<n sufficiently large depending only on epsilon?
open, filed Tue Aug 25 2026 09:39:55 GMT+0000 (Coordinated Universal Time) by @woshuajolk
All 345 pre-existing Jig problems were directly pulled and semantically searched; no duplicate was found. The complete fleet compiled the exact writer, eleven red/restatement attacks, fixed-epsilon negation, finite vacuous-prefix witness, Lau prior-art review, and independent bridges. CRT prescriptions, sieve/probabilistic constructions, transfer from the forward problem, and the conjectured negative random-model route were attacked. Lau's theorem reaches only C log k, missing the requested log k/log log k scale; his Conjecture 6 predicts the root is false but is itself unproved. Uniform control over every sufficiently large backward shift is the exact blocker.
Scope. natural-number endpoints and shifts; omega counts distinct prime factors; one uniform lower shift threshold for each epsilon; infinitely many endpoints.