Questions, not proof records

Open-problem statements, with their sources attached.

Each statement record keeps the mathematical question, a dated status source, accessible references, and any pinned Lean formulation separate from proof verification.

“Open” is a dated source assertion. In these pinned sources, sorry marks an admitted statement, not a proof. Source indexing does not mean the formulation has been independently built or certified by Therefore.
All topics

234 of 1194 statement records

17 source collections · 43 mathematical fields

Clear filters
Source labels openWikipedia · Number theory

Hypothesis H

Schinzel conjecture (H hypothesis)* If a finite set of polynomials fif_i satisfies both Schinzel and Bunyakovsky conditions, there exist infinitely many natural numbers nn such that fi(n)f_i(n) are primes for all ii.

Source checked Jul 26, 20261 pinned Lean statementInspect problem
Source labels openWikipedia · Number theory

Scholz conjecture on addition chains

The Scholz conjecture, also known as the Scholz-Brauer conjecture, asserts that for every positive integer nn, the addition-chain length of 2n12^n - 1 is at most n1+(n)n - 1 + \ell(n).

Source checked Jul 26, 20261 pinned Lean statementInspect problem
Source labels openWikipedia · Number theory

Selfridge's conjectures

PSW conjecture* (Selfridge's test) Let pp be an odd number, with p±2(mod5)p \equiv \pm 2 \pmod{5}, 2p11(modp)2^{p-1} \equiv 1 \pmod{p} and Fp+10(modp)F_{p+1} \equiv 0 \pmod{p}, then pp is a prime number.

Source checked Jul 26, 20261 pinned Lean statementInspect problem
Source labels openWikipedia · Number theory

Selfridge's conjectures

Selfridge conjectured that the number of prime factors of the n-th Fermat number does not grow monotonically in nn.

Source checked Jul 26, 20261 pinned Lean statementInspect problem
Source labels openWikipedia · Number theory

Sierpiński number

The Sierpiński problem (Selfridge's conjecture).* Is 78557 the smallest Sierpiński number?

Selfridge conjectured that 78557 is the smallest Sierpiński number. He proved in 1962 that 78557 is indeed a Sierpiński number by showing that all numbers of the form 785572n+178557 \cdot 2^n + 1 have a factor in the covering set {3,5,7,13,19,37,73}\{3, 5, 7, 13, 19, 37, 73\}.

Source checked Jul 26, 20261 pinned Lean statementInspect problem
Source labels openWikipedia · Number theory

Sierpiński number

The prime Sierpiński problem.* Is 271129 the smallest prime Sierpiński number?

In 1976, Nathan Mendelsohn determined that the second provable Sierpiński number is the prime k=271129k = 271129.

Source checked Jul 26, 20261 pinned Lean statementInspect problem
Source labels openWikipedia · Number theory

Sierpiński number

The extended Sierpiński problem.* Is 271129 the second-smallest Sierpiński number?

Even if 78557 is confirmed as the smallest Sierpiński number, there could exist a composite Sierpiński number kk with 78557<k<27112978557 < k < 271129. We formalize "second-smallest" as: the least Sierpiński number kk such that there exists exactly one Sierpiński number below it.

Source checked Jul 26, 20261 pinned Lean statementInspect problem
Source labels openWikipedia · Number theory

Singmaster's conjecture

Singmaster's conjecture: the number of times any number t>1t > 1 appears in Pascal's triangle is bounded.

Source checked Jul 26, 20261 pinned Lean statementInspect problem
Source labels openWikipedia · Number theory

Solitary Numbers

Is 10 a solitary number?* The smallest positive integer whose solitary status is currently unresolved is 1010, with abundancy index σ(10)/10=9/5\sigma(10) / 10 = 9/5.

Source checked Jul 26, 20261 pinned Lean statementInspect problem
Source labels openWikipedia · Number theory

Solitary Numbers

Existence of an infinite club.* A club is an abundancy equivalence class, i.e. the set of all positive integers friendly with a given nn. It is unknown whether any club is infinite.

Source checked Jul 26, 20261 pinned Lean statementInspect problem
Source labels openWikipedia · Number theory

Sum of three cubes

An integer n : ℤ can be written as a sum of three cubes (of integers) if and only if n is not 4 or 5 mod 9.

Source checked Jul 26, 20261 pinned Lean statementInspect problem
Source labels openWikipedia · Number theory

(m,k)-perfect numbers

There does not exist a (2,5)(2,5)-perfect number

Source checked Jul 26, 20261 pinned Lean statementInspect problem
Source labels openWikipedia · Number theory

Taxicab numbers

Taxicab number for k=5k=5, m=2m=2, and n=2n=2 is not known. Whether such a number exists is also not known.

Source checked Jul 26, 20261 pinned Lean statementInspect problem
Source labels openWikipedia · Number theory

Taxicab numbers

Taxicab number for k=5k=5 and m=2m=2 is not-known for any n2n ≥ 2. Whether such a number exists is also not known.

Source checked Jul 26, 20261 pinned Lean statementInspect problem