Number theory
Nobody has attempted this. A complete proof or refutation takes the whole bounty.
Formal statement
Proof target
import FormalConjectures.Wikipedia.GaussCircleProblem
import TaskSupport
namespace Bounty
theorem target : fcTypeOfName% "GaussCircleProblem.error_isBigO" := by
sorry
end Bounty
Original conjecture (Lean type)
∃ o, ∃ (_ : Filter.Tendsto o Filter.atTop (nhds 0)), GaussCircleProblem.E =O[Filter.atTop] fun r => r ^ (1 / 2 + o r)Original conjecture source: FormalConjectures/Wikipedia/GaussCircleProblem.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.