Skip to content

Home
Problems
Frontiers
Updates

Overview
Problem ledger
Assertions
Proposed changes
Commits
Reproduce

Add contribution

/Problems

Problems · Vela Mathematics Program

Narrowed toverifiable ×number theory ×Clear all

Declared status

open214 / 316
proved23 / 83
proved (Lean)60 / 66
solved6 / 34
disproved (Lean)29 / 30
disproved4 / 21
solved (Lean)9 / 10
falsifiable8 / 8
verifiable6 / 6
decidable1 / 2

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

Subject tag

number theory6
covering systems1
graph theory1
hypergraphs1
unit fractions1

Contributing source

source:erdos-problems6
source:formal-conjectures6
source:erdos-ai-contributions-wiki3
source:gpt-erdos1
source:vibemathed1

Problem ledger

6 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: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

Search problems.science

Find a Problem, Result, source, or page