Skip to content

Erdős problem 351

Let p(x)∈Q[x]p(x) \in \mathbb{Q}[x] be a non-constant rational polynomial with positive leading coefficient. Is it true that A={p(n)+1/n:n∈N}A=\{ p(n)+1/n : n \in \mathbb{N}\} is strongly complete, in the sense that, for any finite set BB, {∑a∈Xa:X⊆A∖B,X is finite}\left\{\sum_{a \in X} a : X \subseteq A \setminus B, X \textrm{ is finite}\right\} contains all sufficiently large integers?

How the state got here

1 of 6 recorded
  1. Prior stateNone retained
  2. WorkNo submitted work retained
  3. VerificationNo check retained
  4. DecisionNo Repository has decided
  5. StandingA Result stands here
  6. Next gapNot recorded

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:efa9a5262d90ceea6ba431e087a030e85403b674ce4aa8ddc60f5570477a0e3c
Metadata
sha256:e38119d717b9c5d16df6d3b74ccffbb967216da71ce5fb035062e476be54bb45
Observation
sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:33b4a9186bb2ca5ca0f61a4e42c0d58f8a1e642106eb3a33ba75d455df7a8f9f
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb