Back to Problems
erdos_11.variants.finite_bound2
Specification
Every odd $1 < n < 2^50$ is the sum of a squarefree number and a power of 2.
Lean 4 Statement
theorem erdos_11.variants.finite_bound2 (n : ℕ) (hn : Odd n) (h : n < 2^50) (hn' : 1 < n) :
∃ k l : ℕ , Squarefree k ∧ n = k + 2^l
Browse
All Problems
Explore all 300 unsolved conjectures.
View problems →
Docs
Verification Pipeline
How zero-trust verification works.
Read docs →
Evaluation Results
Recent Submissions
No submissions yet. Be the first to attempt this problem.