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

624 of 1194 statement records

17 source collections · 43 mathematical fields

Clear filters
Source labels openWikipedia · Number theory

Sum of three cubes

An integer n : ℤ can be written as a sum of three cubes (of integers) if and only if n is not 4 or 5 mod 9.

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

(m,k)-perfect numbers

There does not exist a (2,5)(2,5)-perfect number

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

Taxicab numbers

Taxicab number for k=5k=5, m=2m=2, and n=2n=2 is not known. Whether such a number exists is also not known.

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

Taxicab numbers

Taxicab number for k=5k=5 and m=2m=2 is not-known for any n2n ≥ 2. Whether such a number exists is also not known.

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

Open questions on transcendence of numbers

ππππ\pi^{\pi^{\pi^\pi}} is not an integer.

This would follow from ππππ\pi^{\pi^{\pi^\pi}} being transcendental, but this formulation is of interest in its own right, as it could in principle be proven by direct computation. Reference:* YouTube

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

Open questions on transcendence of numbers

log(log(2))\log(\log(2)) is transcendental.

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

Twin prime conjecture

Are there infinitely many primes p such that p + 2 is prime?

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

Infinitude of Wall–Sun–Sun primes

A prime pp is a Wall–Sun–Sun prime if and only if Lp1(modp2)L_p \equiv 1 \pmod{p^2}, where LpL_p is the pp-th Lucas number. It is conjectured that there is at least one Wall–Sun–Sun prime.

Source checked Jul 26, 20261 pinned Lean statementInspect problem