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

Perfect numbers

Infinitely many perfect numbers conjecture.* Are there infinitely many perfect numbers? Reference:* Wikipedia

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

Perfect numbers

Infinitely many even perfect numbers conjecture.* Are there infinitely many even perfect numbers?

This is equivalent to asking whether there are infinitely many Mersenne primes, since by the Euclid–Euler theorem an even number is perfect if and only if it has the form 2p1(2p1)2^{p-1}(2^p - 1) where 2p12^p - 1 is a Mersenne prime. Reference:* Wikipedia

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

Perfect numbers

Odd Perfect Number Conjecture.* The Odd Perfect Number Conjecture states that all perfect numbers are even. Reference:* Wikipedia

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

Pollock's (tetrahedral numbers) conjecture

Pollock's (tetrahedral numbers) conjecture: every integer is the sum of at most 55 tetrahedral numbers.

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

Pollock's (tetrahedral numbers) conjecture: Salzer Levine

Salzer–Levine strengthening (as stated on Wikipedia/OEIS): there are exactly 241241 integers that are not a sum of 44 tetrahedral numbers, and the largest is 343867343867.

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

Primes and perfect squares

Are there infinitely many primes pp such that p1p - 1 is a perfect square? In other words: Are there infinitely many primes of the form n2+1n^2 + 1?

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

Prime Triplet Conjecture

Are there infinitely many tuples of three consecutive primes (p,q,r)(p, q, r) such that rp=6r - p = 6?

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

Quasiperfect Numbers

Quasiperfect Numbers Conjecture.* Do quasiperfect numbers exist?

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

Ramanujan τ-function

Lehmer's conjecture: τ(n)0\tau(n) \ne 0 for all n>0n > 0.

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

Rational distance problem

Does there exist a point in the plane at rational distance from all four vertices of the unit square?

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

Infinite Regular Primes

Conjecture: The set of regular primes is infinite.

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

Particular values of the Riemann zeta function

ζ(2n+1)\zeta(2n + 1) is irrational for any nN+n\in\mathbb{N}^{+}.

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

Rudin's conjecture on squares in arithmetic progressions

Rudin's conjecture.* The maximal number of squares among the first NN terms of a non-trivial arithmetic progression grows at most like N\sqrt{N}: Q(N)=O(N).Q(N) = O(\sqrt{N}).

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

Rudin's conjecture on squares in arithmetic progressions

A stronger form of Rudin's conjecture: for every N6N \ge 6, the arithmetic progression 24n+124 n + 1 attains the maximum Q(N)Q(N).

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

Rudin's conjecture on squares in arithmetic progressions

The strongest form of Rudin's conjecture also asserts uniqueness: for N6N \ge 6, any non-trivial arithmetic progression attaining the maximum Q(N)Q(N) has common difference 2424. (Its initial term is then forced by gcd(24,a)=1\gcd(24, a) = 1; the progression 24n+124n + 1 is the canonical representative.)

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

Schanuel's Conjecture

Given any set of nn complex numbers {z1,...,zn}\{z_1, ..., z_n\} that are linearly independent over Q\mathbb{Q}, the field extension Q(z1,...,zn,ez1,...,ezn)\mathbb{Q}(z_1, ..., z_n, e^{z_1}, ..., e^{z_n}) has transcendence degree at least nn over Q\mathbb{Q}.

Source checked Jul 26, 20261 pinned Lean statementInspect problem