Skip to content

Problems · Vela Mathematics Program

Narrowed toproved (Lean) ×not formalized ×source:vibemathed ×Clear all

Problem ledger

2 problemsGraph view
declared proved (Lean)erdos:610
Erdős problem 610
graph theorypossible4 sources
declared proved (Lean)erdos:793
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?
number theorypossible3 sources

Search problems.science

Find a Problem, Result, source, or page