Erdős Problems

Browse all problems

↑ ↓ to move↵ to openesc to close

Loading problem…

Status

On this page

Status

Topics

Terms Privacy info@plasma.ai

Problem 1210 — Erdős Problems

Problem 1210

Let $A\subseteq [1,n)$ be a set of integers such that $(a,b)=1$ for all distinct $a,b\in A$ . Is it true that

\sum_{a\in A}\frac{1}{n-a}\leq \sum_{p<n}\frac{1}{p}+O(1)?

Source: erdosproblems.com/1210

Number theory

Wiki page

Status

Open

No claim settles this problem.

Er77c: Erdős, Paul, Problems and results on combinatorial number theory. III. Number theory day (Proc. Conf., Rockefeller Univ., New York, 1976) (1977), 43-72.
Er80: Erdős, Paul, A survey of problems in combinatorial number theory. Ann. Discrete Math. (1980), 89-115.

Proof claims

Loading proof claims…

Discussion

Loading discussion…

PreviousProblem 1209 NextProblem 1211

On this page

Statement
Status
References
Proof claims
Discussion

Status: Open
Topics: Number theory
In the wiki: Wiki page