ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let p:Z→Zp:\mathbb{Z}\to \mathbb{Z} be a polynomial whose leading coefficient is positive and such that there exists no d≥2d\geq 2 with d∣p(n)d\mid p(n) for all n≥1n\geq 1. Is it true that, for all sufficiently large mm, there exist integers 1≤n1<⋯<nk1\leq n_1<\cdots <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)?

Record

Added
Links

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.