Back to Problems

erdos_351.variants.X_sq

Specification

Let $p(x) = x ^ 2 \in \mathbb{Q}[x]$. It has been shown that \[A=\{ p(n)+1/n : n \in \mathbb{N}\}\] is strongly complete, in the sense that, for any finite set $B$, \[\left\{\sum_{a \in X} a : X \subseteq A \setminus B, X \textrm{ is finite}\right\}\] contains all sufficiently large integers.

Actions

Submit a Proof

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

Submit Proof
Lean 4 Statement
theorem erdos_351.variants.X_sq : HasCompleteImage (X ^ 2)
ID: ErdosProblems__351__erdos_351.variants.X_sq
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.