Skip to content

Home
Problems
Frontiers
Updates

Overview
Problem ledger
Assertions
Proposed changes
Commits
Reproduce

Add contribution

/Problems

Problems · Vela Mathematics Program

Narrowed toverifiable ×source:erdos-ai-contributions-wiki ×Clear all

Declared status

open63 / 122
proved (Lean)103 / 111
disproved (Lean)55 / 59
solved (Lean)20 / 23
solved2 / 13
proved5 / 11
disproved2 / 5
falsifiable3 / 4
verifiable4 / 4
decidable1 / 1

Status and formalization as the source record declares them, across two upstream serializations this product does not merge. Neither is a Vela standing. These 4 are source-native problems, not Claims: no Claim binds them and none carries a Verification.

Subject tag

number theory3
covering systems1
graph theory1
hypergraphs1

Contributing source

source:erdos-problems7
source:formal-conjectures7
source:erdos-ai-contributions-wiki4
source:gpt-erdos1
source:vibemathed1

Problem ledger

4 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

1

number theorycovering systemsN/A4 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: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