Skip to content

Erdős problem 793

Start work

Let F(n)F(n) be the largest A⊆{1,…,n}A\subseteq\{1,\dots,n\} with a∤bca\nmid bc for distinct a,b,c∈Aa,b,c\in A. Is F(n)=π(n)+(C+o(1)) n2/3(log⁡n)−2F(n)=\pi(n)+(C+o(1))\,n^{2/3}(\log n)^{-2} for some constant CC?

Erdős Problems records this as proved (Lean).

No Repository has ruled on it here.

How far the record reaches3 of 6 stages
  1. Sourceerdos-problems
  2. StatementRetained
  3. FormalNone associated
  4. Resolutionproved (Lean)
  5. WorkNone recorded
  6. DecisionNone here
  7. The questionNot reached
What this record is missingFormal declaration

No formal declaration is associated with this question.

A formal statement is the first thing a check can run against.

Read what the sources hold
Where the source files it575 share a topic
Number Theory576
Erdős problem 321accepted
Carrying a Standing. Browse the topic.
Start workOpen sources