Skip to content

Problems · Vela Mathematics Program

Narrowed toverifiable ×Clear all

Problem ledger

7 problemsGraph view
declared verifiable · formalizederdos:7
Can there be a finite covering system of the integers with distinct moduli, all of which are odd and greater than 11?
number theorycovering systemsN/A4 sources
declared verifiable · formalizederdos:307
sorry ↔ ∃ P Q, (∀ p ∈ P, Nat.Prime p) ∧ (∀ q ∈ Q, Nat.Prime q) ∧ 1 = (∑ p ∈ P, (↑p)⁻¹) * ∑ q ∈ Q, (↑q)⁻¹
number theoryunit fractionsN/A2 sources
declared verifiable · formalizederdos:364
¬∃ n, n.Powerful ∧ (n + 1).Powerful ∧ (n + 2).Powerful
number theoryA060355 · A0764452 sources
declared verifiable · formalizederdos:366
True ↔ ∃ n > 0, Nat.Full 2 n ∧ Nat.Full 3 (n + 1)
number theoryA0603553 sources
declared verifiable · formalized · £25erdos:647
sorry ↔ ∃ n > 24, ⨆ m, ↑m + (ArithmeticFunction.sigma 0) ↑m ≤ n + 2
number theoryA062249 · A0872804 sources
declared verifiable · formalizederdos:672
True ↔ ∀ (k l : ℕ), l > 1 → k ≥ 4 → Erdos672.Erdos672With k l
number theoryN/A2 sources
declared verifiable · formalizederdos:835
∀ {k : ℕ}, 3 ≤ k → k ≤ 8 → ↑k + 1 < (SimpleGraph.johnson (2 * k) k).chromaticNumber
graph theoryhypergraphsN/A3 sources

Search problems.science

Find a Problem, Result, source, or page