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

1194 of 1194 statement records

17 source collections · 43 mathematical fields

Source labels openPapers · Number theory

Zagier's Conjecture on Multiple Zeta Values

Zagier's conjecture*

The Q\mathbb{Q}-dimension of the vector space spanned by all multiple zeta values of weight nn equals dnd_n, where dnd_n is the Zagier dimension sequence satisfying d0=1d_0 = 1, d1=0d_1 = 0, d2=1d_2 = 1, and dn=dn2+dn3d_n = d_{n-2} + d_{n-3} for n3n \geq 3.

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

*abc* conjecture

For every positive real number ε, there exist only finitely many triples (a, b, c) of coprime positive integers, with a + b = c, such that c > rad(abc)^(1+ε)

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

*abc* conjecture: Lt Constant Mul

For every positive real number ε, there exists a constant K_ε such that for all triples (a, b, c) of coprime positive integers, with a + b = c we have c < K_ε rad(abc)^(1+ε).

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

*abc* conjecture: Quality

For every positive real number ε, there exist only finitely many triples (a, b, c) of coprime positive integers with a + b = c such that q(a, b, c) > 1 + ε.

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

Agoh-Giuga conjecture

The Agoh-Giuga Conjecture, Agoh's formulation

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

Agoh-Giuga conjecture

The Agoh-Giuga Conjecture, Giuga's formulation

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

Agrawal's conjecture

Agrawal's Primality Conjecture.*

Does the congruence (X1)nXn1(modn,Xr1)(X-1)^n \equiv X^n - 1 \pmod{n, X^r-1} imply nn is prime (with a specific exception for n21(modr)n^2 \equiv 1 \pmod{r})?

While the "if" direction is a known theorem, the "only if" direction remains a conjecture.

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

Agrawal's conjecture: Popovych

Roman B. Popovych Conjecture.* A stronger version of Agrawal's conjecture, which also considers the congruence (X+2)nXn+2(modn,Xr1)(X+2)^n \equiv X^n + 2 \pmod{n, X^r-1}. If both congruences hold, then nn is either prime or n21(modr)n^2 \equiv 1 \pmod{r}. This variant was proposed by Roman B. Popovych in 2018.

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

Non-Power-of-2 Almost Perfect Numbers Conjecture

Non-Power-of-2 Almost Perfect Numbers Conjecture.* Does there exist an almost perfect number that is not a power of 2?

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

Amicable numbers

Relatively prime amicable numbers conjecture.* Do there exist amicable numbers (a,b)(a, b) with gcd(a,b)=1\gcd(a, b) = 1?

All known amicable pairs share a common factor. It is an open question whether a pair of relatively prime amicable numbers can exist. Reference:* Wikipedia

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

Amicable numbers

Infinitely many amicable numbers conjecture.*

Are there infinitely many pairs of amicable numbers?

While many amicable pairs are known, it remains open whether there are infinitely many. Reference:* Wikipedia, erdosproblems.com/830

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

Amicable numbers

Amicable numbers with opposite parity conjecture.* Do there exist amicable numbers (a,b)(a, b) where one is even and the other is odd?

All known amicable pairs are either both even or both odd. It is widely believed that mixed-parity amicable pairs do not exist, but this remains open. Reference:* Wikipedia

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

Andrica's conjecture

Andrica's conjecture* The inequality pn+1pn<1\sqrt{p_{n+1}}-\sqrt{p_n} < 1 holds for all nn, where pnp_n is the nn-th prime number.

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

Artin's conjecture on primitive roots

Artin's Conjecture on Primitive Roots*, first half. Let aa be an integer that is not a square number and not 1−1. Then the set S(a)S(a) of primes pp such that aa is a primitive root modulo pp has a positive asymptotic density inside the set of primes. In particular, S(a)S(a) is infinite.

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

Artin's conjecture on primitive roots: Ii

Artin's Conjecture on Primitive Roots*, second half. Write a=a0b2a = a_0 b^2 where a0a_0 is squarefree. Under the conditions that aa is not a perfect power and a0≢1(mod4)a_0\not\equiv 1\pmod{4} (sequence A85397 in the OEIS), the density of the set S(a)S(a) of primes pp such that aa is a primitive root modulo pp is independent of aa and equals Artin's constant.

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

Artin's conjecture on primitive roots: Part Ii Power Squarefree Part Not Modeq One

Artin's Conjecture on Primitive Roots*, second half, power version If a=bma = b^m is a perfect odd power of a number bb whose squarefree part b0≢1(mod4)b_0\not\equiv 1 \pmod{4}, then the density of the set S(a)S(a) of primes pp such that aa is a primitive root modulo pp is given by Cpmp(p2)p2p1C\prod_{p \mid m} \frac{p(p - 2)}{p^2 - p - 1}, where CC is Artin's constant.

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

Artin's conjecture on primitive roots: Part Ii Power Squarefree Part Modeq One

Artin's Conjecture on Primitive Roots*, second half, power version If a=bma = b^m is a perfect power of a number bb whose squarefree part b01(mod4)b_0\equiv 1 \pmod{4}, then the density of the set S(a)S(a) of primes pp such that aa is a primitive root modulo pp is given by

\left(1 - \prod_{p \mid \gcd(b_0, m)} \frac{1}{2 - p} \prod_{p \mid b_0, p\nmid m} \frac{1}{(1 + p - p ^ 2)}\right),$$ where $C$ is Artin's constant.
Source checked Jul 26, 20261 pinned Lean statementInspect problem
Source labels openWikipedia · Number theory

Balanced prime conjecture

Let pkp_k be the kk-th prime number. Are there infinitely many nn such that (pn+pn+2)/2(p_n + p_{n+2}) / 2 is prime?

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

Balanced prime conjecture

Let pkp_k be the kk-th prime number. Are there infinitely many nn such that pn=i=1kpni+pn+i2kp_n = \dfrac{\sum_{i = 1} ^ k p_{n - i} + p_{n + i}}{2*k}?

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

Bateman-Horn Conjecture

The Bateman-Horn Conjecture* Given a finite collection of distinct irreducible polynomials non-constant f1,f2,,fkZ[x]f_1, f_2, \dots, f_k \in \mathbb{Z}[x] with positive leading coefficients that satisfy the Schinzel condition, the number of positive integers n ≤ x for which all polynomials fif_i are simultaneously prime is asymptotic to: C(f1,f2,,fk)x/(logx)kC(f_1, f_2, \dots, f_k) x / (log x)^k where CC is the Bateman-Horn constant given by the convergent infinite product: C=1DpP(11/p)(k)(1ωp/p)C = \frac{1}{D}\prod_{p\in\mathbb{P}} (1 - 1/p)^(-k) · (1 - \omega_p/p) Here ωp/p\omega_p/p is the number of residue classes modulo pp for which at least one polynomial vanishes.

The Schinzel condition ensures that for each prime pp, there exists some integer nn such that pp does not divide the product f(n)f2(n)f(n)f_(n) f_2(n) \dotsb f_(n), which guarantees the infinite product converges to a positive value.

Source checked Jul 26, 20261 pinned Lean statementInspect problem