Answers are grounded in this paper and cite their sources.
Let E be a finite set of primes, W_E the positive integers with no prime factor in E (for E = {2,5}: the outputs of the mod-100 wheel G(n,k) = 100n + k), and π_k^E(N) the number of n ≤ N in W_E with exactly k prime factors, counted with multiplicity. From an explicit Selberg–Delange expansion of Σ z^Ω(n) over W_E, valid for |z| < q(E), we obtain a Sathe–Selberg formula, the mean and variance of Ω with their 1/ln N terms, an effective mean bound 3/ln N for E = {2,5}, and a crossing law: the level k+1 overtakes the level k at ln ln N = λ_k(E), where λ_k(E) = k + 1 − C_1(E) + c_2(E)/k + d(E)/k² + O(k⁻³), with C_1(E) the constant in the mean of Ω on W_E and c_2(E), d(E) explicit (d = −0.778 for E = {2,5}). Every change of sign of πₖ₊₁^E − π_k^E in |ln ln N − k| ≤ D lies within O(k3/2e⁻ᵏ) of λ_k(E): below this band level k is larger, above it level k+1. Exact counts for five sets E (to 1.65·10^11, independently checked) confirm the law: for E = {2,5} levels 2 and 3 cross at N = 2.9425·10^9, and the crossing of levels 3 and 4 for all integers, predicted before the count at 1.5114·10^11, was observed at 1.5117·10^11. We also prove asymptotic unimodality of k ↦ π_k^E(N) for k ≤ (q(E) − ε) ln ln N, with leading level ⌊ln ln N + C_1 − c_2/ln ln N⌋, and an effective sign criterion whose remainder constant was tested numerically for k ≤ 13, N ≤ 1.65·10^11.
No takes yet. Share an insight, caveat, or question.
Ahmed Mohammed (2026) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: