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?

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:b5b18adb42fa6066c88a3196af3d07a4e62b3b2a2ef41a35d859952699b3f44e
Metadata
sha256:51c28f1acfc843ce77c16241928bd7896614716e1e8be142fbaebbb507d9ac72
Observation
sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:064bea2bc1fa11ce336e48a5be9d5a00429b65effa9043204bea9e54621a0aa8
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb
Upstream sourceInspect recordsSource JSON