Combinatorics
Date added
$1,041 bounty
Nobody has attempted this. A complete proof or refutation takes the whole bounty.
Formal statement
Proof target
import Mathlib
import FormalConjectures.ErdosProblems.«423»
import TaskSupport
namespace Bounty
theorem target : fcTypeOfName% "Erdos423.erdos_423" := by
sorry
end Bounty
Original conjecture (Lean type)
∀ (a : ℕ → ℕ), Erdos423.IsHofstadterSeq a → (fun n => ↑(a n) - ↑n) =o[Filter.atTop] fun n => ↑nOriginal conjecture source: FormalConjectures/ErdosProblems/423.lean
The audit patch changes this file, so the upstream version can differ from the statement above.
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.