Skip to content
1011 problems

Open problems

Each problem states how progress is verified and what counts as a contribution. Besides the problems curated here, the catalogue includes open conjectures from Formal Conjectures (with Lean statements), optimization constants and the AlphaEvolve problems. Know one that belongs here? Propose a problem.

24 shown

B Number theory · Optimization constants

Asymptotic Dobrowolski constant for Lehmer’s problem

Let α be a nonzero algebraic number of degree d, with minimal polynomial over ℤ f(X)=a_dΠ_i=1^d (X-α_i), where a_d>0 and α_1,…,α_d are the conjugates of α. Define the Mahler measure of α by M(α) := a_dΠ_i=1^d max1,lvert α_irvert.

0claims
0verified
B Number theory · Optimization constants

Bounded prime gap constant

Let p_n denote the n-th prime. The bounded prime gap constant is C_88a = H_1 := liminf_n → ∞ (p_n+1 - p_n), the least limit point of the sequence of gaps between consecutive primes.

0claims
0verified
B Number theory · Optimization constants

Brun's Constant

C_81a, Brun's Constant, is the sum of the reciprocals of the twin primes.

0claims
0verified
B Number theory · Optimization constants

Burgess-quality subconvexity exponent for Dirichlet L-functions

A Dirichlet character of level q is an arithmetic function χ that is multiplicative, is defined by a character on (ℤ/qℤ)^ast on integers coprime to q, and is 0 on integers not coprime to q.

0claims
0verified
B Number theory · Optimization constants

Classical zero-free region constant

C_8 = R is the least constant such that there are no zeroes σ+it of the Riemann zeta function with lvert t rvert ≥ 2 and σ > 1 - 1/R log lvert t rvert.

0claims
0verified
B Number theory · Optimization constants

Dirichlet divisor problem exponent

Let d(n) be the divisor function. The Dirichlet divisor problem concerns the error term Δ(x) := Σ_n≤ x d(n) - x(log x + 2γ -1), where γ is Euler's constant. <a href="#Tsa2010-def-Delta">[Tsa2010-def-Delta]</a> Define the divisor-problem exponent α := infBigla≥ 0: Δ(x)=O(x^a+ε) for all ε>0Bigr.

0claims
0verified
B Number theory · Optimization constants

Essential minimum of the Zhang-Zagier height

Let overlineℚ be the set of all algebraic numbers. The naïve height h : overlineℚ → ℝ is defined as follows. Let α ∈ overlineℚ and let P(x) be an irreducible primitive polynomial with integers coefficients such that P(α)=0. Let n be the degree and a be the leading coefficient of P(x).

0claims
0verified
B Number theory · Optimization constants

Exponent for bounded gaps between many primes

Let p_n denote the n-th prime and, for m ≥ 1, write H_m := liminf_n → ∞ (p_n+m - p_n) for the least limit point of the gaps between primes m apart.

0claims
0verified
B Number theory · Optimization constants

Gauss circle problem exponent

Let N(t) := \#(m,n)∈ℤ^2: m^2+n^2≤ t^2 be the number of integer lattice points inside the (closed) disk of radius t centered at the origin. The Gauss circle problem is to find the smallest exponent θ such that, for every ε>0, N(t) = π t^2 + O(t^θ+ε).

0claims
0verified
B Number theory · Optimization constants

GL_2 Ramanujan conjecture exponent

We define C_56 = δ_2 to be the smallest real number δ ≥ 0 such that the following uniform bound toward the Generalized Ramanujan Conjecture holds.

0claims
0verified
B Number theory · Optimization constants

Ihara constant over 𝔽_2

C_33=A(2) is the Ihara constant over 𝔽_2. <a href="#DM2013-def-Aq">[DM2013-def-Aq]</a> For each integer g≥ 1, let N_2(g) := maxbigl\#X(𝔽_2) : X/𝔽_2 a smooth projective geometrically integral curve of genus gbigr. <a href="#DM2013-def-Nqg">[DM2013-def-Nqg]</a> Then A(2) := limsup_g→inftyN_2(g)/g.

0claims
0verified
B Number theory · Optimization constants

Lehmer’s Mahler measure constant

Let f(x)=Σ_i=0^n a_i x^i = a_nΠ_i=1^n (x-α_i) be a polynomial with complex coefficients. The Mahler measure of f is M(f) := |a_n|Π_i=1^n max1,|α_i|.

0claims
0verified
B Number theory · Optimization constants

Lindelof (pointwise growth) exponent for the Riemann zeta function

Define the infimal exponent μ_ζ by μ_ζ := infBiglθ≥ 0: lvertζ(1/2+it)rvert≪_ε(1+lvert trvert)^θ+ε for all ε>0Bigr. We define C_62a := μ_ζ, the Lindelof (pointwise growth) exponent for ζ(1/2+it).

0claims
0verified
B Number theory · Optimization constants

Linnik's constant

For integers q≥ 2 and a with gcd(a,q)=1, let P(a,q) denote the least prime in the arithmetic progression a bmod q. <a href="#Xyl2011-def-Paq">[Xyl2011-def-Paq]</a> Linnik's theorem asserts that there exist constants C,L>0 such that P(a,q) ≤ C q^L (gcd(a,q)=1), uniformly for all q≥ 2.

0claims
0verified
B Number theory · Optimization constants

Martinet's constant for totally real number fields

For a number field K, let Δ_K denote the absolute value of its discriminant and let [K:ℚ] denote its degree. The root discriminant of K is rd(K) := Δ_K^1/[K:ℚ].

0claims
0verified
B Number theory · Optimization constants

Polya-Vinogradov best constant (squarefree asymptotic)

Let χ be a primitive Dirichlet character modulo q, and define S(χ) := max_N≤ q lvertΣ_1≤ n≤ Nχ(n)rvert. The Polya-Vinogradov inequality states that S(χ) ≤ c √(q) log q for some absolute constant c. <a href="#BK2020-def-PV">[BK2020-def-PV]</a> For squarefree moduli, define C_72^even (resp.

0claims
0verified
B Number theory · Optimization constants

Romanoff's constant

C_45 is the asymptotic density (if it exists) of the set of odd integers that can be expressed as the sum of a prime number and a power of two.

0claims
0verified
B Number theory · Optimization constants

Schur–Siegel–Smyth trace constant

An algebraic integer α of degree d, with conjugates α_1,…,α_d, is totally positive if all of its conjugates are real and strictly positive. Its absolute trace (or trace-to-degree ratio) is overlinetr(α) := tr(α)/deg(α) = 1/dΣ_i=1^d α_i . Let A denote the set of totally positive algebraic integers.

0claims
0verified
B Number theory · Optimization constants

Selberg congruence spectral-gap constant

Let Γ⊂ SL_2(ℤ) be a congruence subgroup. Denote by 0=λ_0<λ_1(Γ)≤ λ_2(Γ)≤ ⋯ the eigenvalues of the (non-Euclidean) Laplacian acting on L^2(ΓbackslashH).

0claims
0verified
B Number theory · Optimization constants

The irrationality measure of Γ(1/4)

For a real number γ, its irrationality exponent μ(γ) is defined by μ(γ) := infBiglc∈ℝ: Bigllvertγ-a/bBigrrvert≤ lvert brvert^-c has only finitely many solutions (a,b)∈ℤ^2Bigr. <a href="#Zud2004-def-mu">[Zud2004-def-mu]</a> We define C_7b := μbigl(Γ(1/4)bigr).

0claims
0verified
B Number theory · Optimization constants

The irrationality measure of π

We define C_7a to be the irrationality measure of π: C_7a := sup_μ∈ℝ μ such that lvert π - p/q rvert < q^-μ for infinitely many rationals p/q. Equivalently, C_7a is the infimum of all ν such that for every ε>0 there exists q_0(ε) with |π-p/q| > 1/q^ν+ε for all integers p and all integers q ≥ q_0(ε).

0claims
0verified
B Number theory · Optimization constants

The Wirsing Constant

The Gauss–Kuzmin–Wirsing (GKW) operator acts on suitable function spaces on [0,1] by (L f)(x) = Σ_k=1^∞ 1/(x+k)^2 f (1/x+k). This is the transfer operator of the Gauss map T(x) = \1/x\, which generates the continued fraction expansion.

0claims
0verified
B Number theory · Optimization constants

Zaremba’s conjecture constant

Zaremba’s conjecture concerns denominators of rational numbers b/d∈(0,1) whose finite continued fraction expansions have all partial quotients bounded by an absolute constant.

0claims
0verified

Browse by field