Erdős problem 477
Does there exist an integer polynomial of degree at least two and a set such that every integer has a unique representation ? A manuscript claims the thirteenth powers admit a tiling complement.
No current result
No reviewed Result is current in Vela Mathematics Program. Retained source material is shown below.
Retained declaration
FormalConjectures/ErdosProblems/477.leanTrue ↔ ∃ f, 2 ≤ f.degree ∧ ∃ A, ∀ (z : ℤ), ∃! ab, ab ∈ A ×ˢ ((fun x => Polynomial.eval x f) '' {n | 0 < n}) ∧ z = ab.1 + ab.2OpenStatement only, no proof
Reported activity
Work these sources record against this Problem. Source-reported attribution, not reviewed here.
AI standalone
- Machine
argument
- Machine
- Reported outcome