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.
1 topic

741 of 1194 statement records

17 source collections · 43 mathematical fields

Clear filters
Source labels openOEIS · Number theory

Primes of the form 2^n + 2^i + 1

*Conjecture (A81091)**: There are infinite primes of the form 2n+2i+12^n + 2^i + 1, with 0<i<n0 < i < n.

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

The Catch-Up game and conjecture

Let TN=k=1Nk=N(N+1)2T_N = \sum_{k=1}^{N} k = \frac{N(N+1)}{2}. If TNT_N is even (equivalently N0(mod4)N \equiv 0 \pmod 4 or N3(mod4)N \equiv 3 \pmod 4), then under optimal play the game Catch-Up($\{1, \ldots, N\}$) ends in a draw.

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

Dubner's conjecture

Every even number greater than 4208 is the sum of two twin primes.

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

Kurepa's conjecture

Kurepa's conjecture

For all nn, !n≢0modn!n\not\equiv 0 \mod n

This appears as B44 "Sums of factorials." in Unsolved Problems in Number Theory by Richard K. Guy

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

Kurepa's conjecture: Prime

This statement can be reduced to the prime case only.

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

Kurepa's conjecture: Gcd

An equivalent formulation in terms of the gcd of n!n! and !n!n.

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

Prime Tuples Conjecture

For any k ≥ 2, let a₁,...,aₖ and b₁,...,bₖ be integers with aᵢ > 0. Suppose that for every prime p there exists an integer n such that p ∤ ∏ i, (aᵢ n + bᵢ). Then there exist infinitely many n such that aᵢ n + bᵢ is prime for all i.

Source checked Jul 26, 20261 pinned Lean statementInspect problem
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