Skip to content

Erdős problem 56

Suppose A{1,,N}A \subseteq \{1,\dots,N\} is such that there are no k+1k+1 elements of AA which are relatively prime. An example is the set of all multiples of the first kk primes. Is this the largest such set? To avoid trivial counterexamples, we must insist that NN be at least the kkth prime.
Retained from Formal Conjectures · not edited here
Formal statements
5 api · 1 solved · 5 test
Erdős Problems says
disproved (Lean)
Decision here
No current contribution
Checks
0 checks · 11 formal

Current Result

Accepted in Vela Mathematics Program

Current Result

No result has been accepted here yet.

Type
Evidence
0 artifacts
Decision
None
Reviewed
No date retained

Search problems.science

Find a Problem, Result, source, or page