Vela Mathematics Program: problems

Narrowed toproved ×source:erdos-problems ×Clear all

Problem ledger

210 problems · 4/5Number SourcesGraph view

declared provederdos:842

Erdős problem 842

graph theorychromatic numberN/A

declared provederdos:843

Erdős problem 843

number theoryN/A

declared proved · formalizederdos:851

∀ ε ∈ Set.Ioo 0 1, ∃ r d, (Erdos851.TwoPowAddSet r).HasDensity d ∧ 1 - ε ≤ d

number theoryN/A4 sources

declared provederdos:863

Erdős problem 863

number theorysidon setsadditive combinatoricsN/A3 sources

declared provederdos:874

Erdős problem 874

number theoryadditive combinatoricspossible

declared provederdos:877

Erdős problem 877

additive combinatoricsA121269 · possible

declared provederdos:880

Erdős problem 880

number theoryadditive basisN/A

declared provederdos:894

Erdős problem 894

number theoryramsey theoryN/A

declared provederdos:895

Erdős problem 895

additive combinatoricsgraph theoryN/A

declared proved · formalizederdos:899

True ↔ ∀ (A : Set ℕ), A.Infinite → Filter.Tendsto (fun N => ↑(A ∩ Set.Icc 1 N).ncard / ↑N) Filter.atTop (nhds 0) → Filter.limsup (fun N => ↑((A - A) ∩ Set.Icc 1 N).ncard / ↑(A ∩ Set.Icc 1 N).ncard) Filter.atTop = ⊤

additive combinatoricsN/A2 sources

declared provederdos:900

Erdős problem 900

graph theoryN/A

declared provederdos:903

Erdős problem 903

combinatoricsN/A

declared provederdos:908

Erdős problem 908

analysisN/A

declared provederdos:909

Erdős problem 909

analysistopologyN/A

declared provederdos:916

Erdős problem 916

graph theorycyclesN/A

declared provederdos:921

Erdős problem 921

graph theorychromatic numbercyclespossible

declared provederdos:922

Erdős problem 922

graph theorychromatic numberN/A

declared provederdos:924

Erdős problem 924

graph theoryramsey theoryN/A

declared provederdos:926

Erdős problem 926

graph theorypossible

declared proved · formalizederdos:937

True ↔ {p | Erdos937.IsCoprimePowerfulAP4 p.1 p.2}.Infinite

number theorypossible2 sources

declared provederdos:941

Erdős problem 941

number theoryA056828

declared proved · formalizederdos:946

{n | (ArithmeticFunction.sigma 0) n = (ArithmeticFunction.sigma 0) (n + 1)}.Infinite

number theorydivisorsA005237 · A2847832 sources

declared provederdos:957

Erdős problem 957

geometrydistancesN/A

declared provederdos:977

Erdős problem 977

number theoryA005420 · A002583

declared provederdos:980

Erdős problem 980

number theoryA053760 · A098990 · possible

declared provederdos:981

Erdős problem 981

number theoryN/A

declared provederdos:984

Erdős problem 984

arithmetic progressionsadditive combinatoricsN/A

declared provederdos:986

Erdős problem 986

graph theoryramsey theoryA000791 · A0594423 sources

declared proved · formalizederdos:987

True ↔ ∀ (x : ℕ → ℝ), (∀ (j : ℕ), x j ∈ Set.Ioo 0 1) → Filter.limsup (fun k => Erdos987.A x k) Filter.atTop = ⊤

analysisdiscrepancyN/A4 sources

declared provederdos:991

Erdős problem 991

discrepancyN/A

declared provederdos:998

Erdős problem 998

analysisdiophantine approximationN/A

declared provederdos:999

Erdős problem 999

number theorydiophantine approximationN/A

declared provederdos:1009

Erdős problem 1009

graph theoryN/A

declared provederdos:1010

Erdős problem 1010

graph theoryN/A

declared provederdos:1019

Erdős problem 1019

graph theoryplanar graphsN/A

declared provederdos:1021

Erdős problem 1021

graph theoryN/A2 sources

declared provederdos:1027

Erdős problem 1027

combinatoricsN/A

declared provederdos:1031

Erdős problem 1031

graph theorypossible

declared provederdos:1042

Erdős problem 1042

analysisN/A

declared provederdos:1050

Erdős problem 1050

irrationalityA331372

declared provederdos:1058

Erdős problem 1058

number theoryN/A

declared proved · formalizederdos:1064

{n | n.totient > (n - n.totient).totient}.HasDensity 1

number theoryA051488 · A0514872 sources

declared provederdos:1076

Erdős problem 1076

hypergraphspossible

declared provederdos:1078

Erdős problem 1078

graph theoryN/A

declared proved · formalizederdos:1096

True ↔ ∃ ε > 0, ∀ (q : ℝ), 1 < q → q < 1 + ε → ∀ (x : ℕ → ℝ), StrictMono x → Set.range x = {x | ∃ S, ∑ i ∈ S, q ^ i = x} → Filter.Tendsto (fun k => x (k + 1) - x k) Filter.atTop (nhds 0)

number theoryN/A2 sources

declared provederdos:1099

Erdős problem 1099

number theorydivisorsN/A

declared proved · formalizederdos:1105

True ↔ ∀ (k : ℕ), 3 ≤ k → (fun n => ↑((SimpleGraph.cycleGraph k).antiRamseyNum n) - ((↑k - 2) / 2 + 1 / (↑k - 1)) * ↑n) =O[Filter.atTop] fun x => 1

graph theoryramsey theorypossible3 sources

declared provederdos:1114

Erdős problem 1114

analysispolynomialsN/A

declared provederdos:1124

Erdős problem 1124

geometryN/A

declared provederdos:1129

Erdős problem 1129

analysispolynomialsN/A2 sources

Problems · Vela Mathematics Program

Problem ledger

Search problems.science