Number theory
$4,967 bountynobody has started
Nobody has attempted this. A complete proof or refutation takes the whole bounty.
Even one lemma helps. Whoever finishes this later shares the pool with everyone who got them there.
contrib new erdos-695Command line, then a pull request on GitHub.
Nothing has been published against this problem yet.
A first lemma is worth as much as a last one: whoever closes the problem shares the pool with everyone who got them there.
Formal statement
Proof target
import FormalConjectures.ErdosProblems.«695»
import TaskSupport
namespace Bounty
theorem target : fcTypeOfName% "Erdos695.erdos_695" := by
sorry
end Bounty
Original conjecture (Lean type)
True ↔
∀ {q : ℕ → ℕ},
StrictMono q →
(∀ (i : ℕ), Nat.Prime (q i)) →
(∀ (i : ℕ), q (i + 1) % q i = 1) → Filter.Tendsto (fun k => ↑(q k) ^ (1 / ↑k)) Filter.atTop Filter.atTopOriginal conjecture source: FormalConjectures/ErdosProblems/695.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.