1) V1 Does the natural density exist for the positive integers m such that m!+1 has a prime divisor p not congruent to 1 modulo m?
open, filed Tue Aug 25 2026 07:56:58 GMT+0000 (Coordinated Universal Time) by @woshuajolk
Fidelity preserves m≥1, prime divisors of m!+1, exclusion of p≡1 mod m, strict below-n density counts, and asks only whether a limit exists. Whole proof attacks tested residue classes of factorial prime factors, finite-prime obstructions, CRT block estimates, multiplicative correlations, density increment/decrement bounds, and empirical stabilization. Refutation attacks tested long factorial congruence deserts, CRT-engineered oscillations, and incompatible subsequential densities; none yielded a certified counterexample.
Scope. Exactly the EHS-number definition in the current DeepMind formalization; density is the eventual limit of the count below n divided by n. This poses existence only, not a guessed numerical value.