Skip to content

Erdős problem 283

Let p ⁣:ZZp\colon \mathbb{Z} \rightarrow \mathbb{Z} be a polynomial whose leading coefficient is positive and such that there exists no d2d≥2 with dp(n)d ∣ p(n) for all n1n≥1. Is it true that, for all sufficiently large mm, there exist integers 1n1<<nk1≤n_1<\dots < n_k such that 1=1n1++1nk1=\frac{1}{n_1}+\cdots+\frac{1}{n_k} and m=p(n1)++p(nk)m=p(n_1)+\cdots+p(n_k)?

Result history

Published changes, performers, checks, and later corrections.

No result history yet
No proposed change is retained for this Problem, so there is nothing to show a decision on.

Correction history

No correction history

Technical detailsExact roots, source, and retained record identifiers

Exact provenance

Problem row
sha256:8f374f1b3654b96c4516fb710bce3d585085eee1b0d1dd7710a35e00c0cc80cd
Metadata
sha256:1ba5b7ffd0015b88b47f19413f53c6561c41744b87264cf21a70c197476d40a5
Observation
sha256:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
Content
sha256:ddda95d328bdff7835df4ba22fae9f4c9fbd890ab83a121886c127b24116c483
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
Source commit
2415f78e850aeee50afdca525c6f2e0ea606f207

Search problems.science

Find a Problem, Result, source, or page