Harman sieve and Lean-verified certificate for the \(n^{1.323}\) bound on the greatest prime factor of \(n^2+1\).
formal-verification number-theory computer-assisted-proof analytic-number-theory lean4 sieve-methods harman-sieve buchstab-identity landau-problem greatest-prime-factor
-
Updated
Aug 30, 2026 - TeX