Skip to content

Problems · Vela Mathematics Program

Narrowed tonot formalized ×source:jayyhk-erdos-lean ×Clear all

Problem ledger

17 problemsGraph view
declared solved (Lean)erdos:192
Erdős problem 192
arithmetic progressionscombinatoricsN/A3 sources
declared disproved (Lean)erdos:231
Erdős problem 231
combinatoricsN/A3 sources
declared proved (Lean)erdos:237
Erdős problem 237
number theoryprimesN/A4 sources
declared proved (Lean)erdos:433
Erdős problem 433
number theorypossible4 sources
declared proved (Lean)erdos:490
Erdős problem 490
number theoryA3972054 sources
declared disproved (Lean)erdos:608
Erdős problem 608
graph theoryN/A2 sources
declared proved (Lean)erdos:610
Erdős problem 610
graph theorypossible4 sources
declared proved (Lean)erdos:658
Erdős problem 658
additive combinatoricspossible4 sources
declared solved (Lean)erdos:696
Erdős problem 696
number theorydivisorspossible4 sources
declared proved (Lean)erdos:716
Erdős problem 716
graph theoryhypergraphspossible3 sources
declared solved (Lean)erdos:765
Erdős problem 765
graph theoryturan numberA0068553 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
declared disproved (Lean)erdos:927
Erdős problem 927
graph theorypossible3 sources
declared proved (Lean)erdos:947
Erdős problem 947
number theorycovering systemsN/A4 sources
declared proved (Lean)erdos:964
Erdős problem 964
number theorydivisorsN/A4 sources
declared disproved (Lean) · £10erdos:1134
Erdős problem 1134
number theoryA1856613 sources
declared disproved (Lean)erdos:1197
Erdős problem 1197
analysisN/A5 sources

Search problems.science

Find a Problem, Result, source, or page