Mathoverflow 75792
Is 2n the complexity of 2^n for 0 < n?
Questions, not proof records
Each statement record keeps the mathematical question, a dated status source, accessible references, and any pinned Lean formulation separate from proof verification.
sorry marks an admitted statement, not a proof. Source indexing does not mean the formulation has been independently built or certified by Therefore.Is 2n the complexity of 2^n for 0 < n?
The Riemann Hypothesis: all non-trivial zeros of the Riemann zeta function have real part . That is, if , , and is not a trivial zero for some , then .
This is the official Millennium Prize Problem as posed by the Clay Mathematics Institute.
This uses the RiemannHypothesis type from Mathlib, which is defined as
∀ (s : ℂ), riemannZeta s = 0 → (¬∃ n : ℕ, s = -2 * (n + 1)) → s ≠ 1 → s.re = 1 / 2.
The Generalized Riemann Hypothesis asserts that all the non-trivial zeros of the Dirichlet -function of a primitive Dirichlet character have real part .
Conjecture: the sequence A228828 is infinite.
The conjecture for sequence A231201: for any , there exist such that and is prime.
*Zhi-Wei Sun's Conjecture (A232174)**: Any integer can be written as with such that both and are prime.
*Zhi-Wei Sun's Conjecture (A239957)**: Every prime has a primitive root of the form , where is an integer.
*Zhi-Wei Sun's 1680-Conjecture (A280831)**: Any nonnegative integer can be written as with nonnegative integers such that is a square.
*Zhi-Wei Sun's Conjecture (A281976)**: Any integer can be written as with nonnegative integers and , such that both and are squares.
*Zhi-Wei Sun's Conjecture (A287616)**: Any nonnegative integer can be written as the sum of a triangular number , a generalized pentagonal number , and a generalized heptagonal number , where are nonnegative integers.
*Zhi-Wei Sun's Conjecture (A303656)**: Any integer can be written as the sum of two squares, a power of 3, and a power of 5.
*Zhi-Wei Sun's 2-4-6-8 Conjecture (A306477)**: Any integer can be written as for nonnegative integers .
*Zhi-Wei Sun's Four-Square Conjecture (A308734)**: Any integer can be written as for nonnegative integers .
Conjecture: for every there exists a number such that is a prime.
A stronger conjecture: for every n there exists a number such that is a prime.
Conjecture: .
Counter-conjecture to a_isBigO: is unbounded.
We conjecture that for all primes , with a finite number of exceptions that depend on .
There are no partition numbers of the form , with integers . See comment by Zhi-Wei Sun (Dec 02 2013).
All members of the sequence A56777 come from prime quadruples.