Skip to content

Erdős problem 1210

Start work

Let A⊆[1,n)A\subseteq [1,n) be a set of integers such that (a,b)=1(a,b)=1 for all distinct a,b∈Aa,b\in A. Is it true that ∑a∈A1n−a≤∑p<n1p+O(1)\sum_{a\in A}\frac{1}{n-a}\leq \sum_{p < n}\frac{1}{p}+O(1)?

How the state got here

0 of 6 recorded
  1. Prior stateNone retained
  2. WorkNo submitted work retained
  3. VerificationNo check retained
  4. DecisionNo Repository has decided
  5. StandingNothing recorded 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:031dd1f33897a0cd765d4c9d8f6ab42d4118d73b49b470e47e4a1f0e7067a407
Metadata
sha256:f0c1407cb5cb8f8d4ecb2df0afbac38a51d5631a800080d3d775b9218a82402a
Observation
sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:ee6be6e0d0ca391606e1afbdaeefa2a265b9ffff12367fbeef473e860acb3f6d
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb
Upstream sourceInspect recordsSource JSON