Skip to content
Home
Problems
Updates
Vela Mathematics Program
/
Problems
/
793
Search or jump
⌘K
Overview
Problem ledger
Claims
Proposed changes
Commits
Reproduce
Problem
erdos:793
Let
F
(
n
)
F(n)
be the largest
A
⊆
{
1
,
…
,
n
}
A\subseteq\{1,\dots,n\}
with
a
∤
b
c
a\nmid bc
for distinct
a
,
b
,
c
∈
A
a,b,c\in A
. Is
F
(
n
)
=
π
(
n
)
+
(
C
+
o
(
1
)
)
n
2
/
3
(
log
n
)
−
2
F(n)=\pi(n)+(C+o(1))\,n^{2/3}(\log n)^{-2}
for some constant
C
C
?
Open Current State
Declared status
proved (Lean)
Formalization
not formalized
Subjects
number theory
OEIS
possible
Sources
source:erdos-problems
·
source:jayyhk-erdos-lean
·
source:vibemathed
Statement
www.erdosproblems.com
Matching claims
0
No direct claims
This problem has no directly related claim record.
Browse this Repository’s Claims