Back to Problems

erdos_695.variant.upperBound

Specification

Is there a sequence of primes $q_1 < q_2 < \cdots$ such that $q_{i + 1} \equiv 1 \pmod{q_i}$ and $$ q(k) \leq \exp(k (\log k)^{1 + o(1)})? $$

Actions

Submit a Proof

Have a proof attempt? Submit it for zero-trust verification.

Submit Proof
Lean 4 Statement
theorem erdos_695.variant.upperBound : answer(sorry) ↔
    ∃ q : ℕ → ℕ,
      StrictMono q ∧
      (∀ i, (q i).Prime) ∧
      (∀ i, q (i + 1) % q i = 1) ∧
      ∃ o : ℕ → ℝ,
        (o =o[atTop] (1 : ℕ → ℝ)) ∧
        -- We use `(k + 1)` here as the informal statement is 1-indexed.
        ∀ k, q k ≤ exp ((k + 1) * log (k + 1) ^ (1 + o k))
ID: ErdosProblems__695__erdos_695.variant.upperBound
Browse 300 unsolved math conjectures formalized in Lean 4
Browse

All Problems

Explore all 300 unsolved conjectures.

View problems →
ASI Prize documentation for formal verification pipeline
Docs

Verification Pipeline

How zero-trust verification works.

Read docs →
Evaluation Results

Recent Submissions

No submissions yet. Be the first to attempt this problem.