Vela Mathematics Program: problems · problems.science

Narrowed tonot formalized ×source:plby-lean-proofs ×Clear all

Declared status

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

Formalization

Subject tag

Contributing source

Problem ledger

13 problemsGraph view

declared proved (Lean)erdos:237

Erdős problem 237

number theoryprimesN/A4 sources

declared openerdos:367

Erdős problem 367

number theoryA0575213 sources

declared openerdos:368

Erdős problem 368

number theoryA0743993 sources

declared proved (Lean)erdos:433

Erdős problem 433

number theorypossible4 sources

declared provederdos:485

Erdős problem 485

analysispolynomialspossible2 sources

declared proved (Lean)erdos:490

Erdős problem 490

number theoryA3972054 sources

declared proved (Lean)erdos:658

Erdős problem 658

additive combinatoricspossible4 sources

declared openerdos:866

Estimate the least excess

g_k(N)

k

integers whose pairwise sums all lie in a dense subset of

\{1, \dots, 2N\}

; in particular, determine the positive variant

h_4(n)

number theoryadditive combinatoricspossible5 sources

declared proved (Lean)erdos:947

Erdős problem 947

number theorycovering systemsN/A4 sources

declared proved (Lean)erdos:964

Erdős problem 964

number theorydivisorsN/A4 sources

declared openerdos:1100

Erdős problem 1100

number theorydivisorsA325864 · possible2 sources

declared solvederdos:1187

Erdős problem 1187

number theoryprimesadditive combinatoricsN/A3 sources

declared disproved (Lean)erdos:1197

Erdős problem 1197

analysisN/A5 sources