Skip to content

Problems · Vela Mathematics Program

Narrowed tonot formalized ×source:erdos-problems ×Clear all

Problem ledger

613 problems · 8/13NumberSourcesGraph view
declared provederdos:748
Erdős problem 748
number theoryA007865
declared provederdos:752
Erdős problem 752
graph theorycyclesN/A
declared provederdos:754
Erdős problem 754
geometrydistancespossible
declared solvederdos:758
Erdős problem 758
graph theorychromatic numberpossible
declared solvederdos:759
Erdős problem 759
graph theorychromatic numberpossible
declared openerdos:761
Erdős problem 761
graph theorychromatic numberN/A
declared disprovederdos:763
Erdős problem 763
number theoryadditive combinatoricsN/A
declared disprovederdos:764
Erdős problem 764
number theoryadditive combinatoricsN/A
declared solved (Lean)erdos:765
Erdős problem 765
graph theoryturan numberA0068553 sources
declared openerdos:766
Erdős problem 766
graph theoryturan numberpossible
declared provederdos:767
Erdős problem 767
graph theoryturan numberpossible
declared openerdos:768
Let A(x)A(x) count n≤xn \le x such that every prime p∣np \mid n has a divisor d>1d > 1 of nn with d≡1(modp)d \equiv 1 \pmod p. Erdos asked whether A(x)/x=exp⁡(−(c+o(1))log⁡xlog⁡log⁡x)A(x)/x = \exp(-(c+o(1))\sqrt{\log x}\log\log x). It does, with c=1/(2log⁡2)c = 1/(2\sqrt{\log 2}).
number theoryA001034 · A3522873 sources
declared provederdos:771
Erdős problem 771
number theorypossible
declared provederdos:772
Erdős problem 772
number theorysidon setsadditive combinatoricspossible
declared openerdos:773
Erdős problem 773
number theorysidon setssquaresA390813
declared openerdos:776
Erdős problem 776
combinatoricspossible2 sources
declared solvederdos:777
Erdős problem 777
graph theorycombinatoricsN/A
declared openerdos:778
Erdős problem 778
graph theoryN/A
declared provederdos:780
Erdős problem 780
combinatoricshypergraphschromatic numberN/A
declared disprovederdos:781
Erdős problem 781
additive combinatoricspossible
declared openerdos:782
Erdős problem 782
number theoryN/A
declared solvederdos:783
Erdős problem 783
number theoryN/A3 sources
declared solvederdos:784
Erdős problem 784
number theoryN/A
declared openerdos:787
Erdős problem 787
additive combinatoricspossible
declared openerdos:788
Erdős problem 788
additive combinatoricspossible3 sources
declared openerdos:790
Erdős problem 790
additive combinatoricspossible
declared openerdos:791
Erdős problem 791
additive combinatoricsA066063
declared openerdos:792
Erdős problem 792
additive combinatoricspossible2 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 provederdos:795
Erdős problem 795
number theorypossible
declared provederdos:797
Erdős problem 797
graph theorychromatic numberpossible
declared provederdos:799
Erdős problem 799
graph theorychromatic numberN/A
declared provederdos:800
Erdős problem 800
graph theoryramsey theoryN/A
declared provederdos:801
Erdős problem 801
graph theoryramsey theoryN/A
declared openerdos:802
Erdős problem 802
graph theoryN/A
declared disprovederdos:803
Erdős problem 803
graph theoryN/A
declared disprovederdos:804
Erdős problem 804
graph theorypossible
declared openerdos:805
Erdős problem 805
graph theorypossible
declared provederdos:806
Erdős problem 806
additive combinatoricspossible
declared disprovederdos:807
Erdős problem 807
graph theoryN/A
declared disprovederdos:808
Erdős problem 808
additive combinatoricsgraph theoryN/A
declared openerdos:809
Erdős problem 809
graph theoryramsey theorypossible
declared openerdos:810
Erdős problem 810
graph theoryramsey theorypossible
declared openerdos:811
Erdős problem 811
graph theoryramsey theorypossible
declared openerdos:813
Erdős problem 813
graph theorypossible
declared provederdos:814
Erdős problem 814
graph theorypossible
declared disprovederdos:815
Erdős problem 815
graph theoryN/A
declared provederdos:816
Erdős problem 816
graph theoryN/A
declared openerdos:819
Erdős problem 819
additive combinatoricspossible2 sources
declared openerdos:820
Erdős problem 820
number theoryA263647

Search problems.science

Find a Problem, Result, source, or page