Number theory
Nobody has attempted this. A complete proof or refutation takes the whole bounty.
Formal statement
Proof target
import FormalConjectures.ErdosProblems.«933»
import TaskSupport
namespace Bounty
theorem target : fcTypeOfName% "Erdos933.erdos_933" := by
sorry
end Bounty
Original conjecture (Lean type)
True ↔ Filter.limsup (fun n => ↑↑(2 ^ Erdos933.k n * 3 ^ Erdos933.l n) / (↑↑n * ↑(Real.log ↑n))) Filter.atTop = ⊤Original conjecture source: FormalConjectures/ErdosProblems/933.lean
References
Something wrong with this formalization?
A statement that does not faithfully capture the original conjecture is the one real risk here, so we would rather hear about it early - before someone spends weeks on it.
Our channel is in the Bittensor Discord server. Join the server first, then open the channel to send your report.