Number theory
Provisional editorial order for Top Open Problems: Millennium Prize Problems first, followed by assessed difficulty tiers; the unassessed remainder keeps its previous catalogue order. About rankings
Browse by subject
Search this collection by problem ID, title, classification, subject, provider, or model.
Search results
No matching problems. Try another search or clear a filter.
572 records · Search and filter
- Math-4214 Are there infinitely many Pierpont primes
- Math-4215 Are there infinitely many prime quadruplets
- Math-4216 Are there infinitely many prime triplets
- Math-4217 Siegel's conjecture
- Math-4218 Are there infinitely many sexy primes
- Math-4219 Are there infinitely many Wagstaff primes
- Math-4220 Are there infinitely many Wieferich primes
- Math-4221 Are there infinitely many Wilson primes
- Math-4222 Are there infinitely many Wolstenholme primes
- Math-4223 Are there infinitely many Woodall primes
- Math-4224 Can a prime p satisfy $2^{p-1}\equiv 1\pmod{p^2}$ and $3^{p-1}\equiv 1\pmod{p^2}$ simultaneously
- Math-4225 Does every prime number appear in the Euclid–Mullin sequence
- Math-4226 What is the smallest Skewes's number
- Math-4227 For any given integer a > 0, are there infinitely many primes p such that a^{p − 1} ≡ 1 (mod p^{2})
- Math-4228 Wikipedia number-theory item 173: For any given integer b which is not a perfect power and not of the form −4k^{4} for integer k, are…
- Math-4229 Wikipedia number-theory item 174: For any given integers $k\geq 1, b\geq 2, c\neq 0$, with gcd(k, c) = 1 and gcd(b, c) = 1, are there…
- Math-4230 Is every Fermat number $2^{2^n} + 1$ composite for $n > 4$
- Math-4231 Is 509,203 the lowest Riesel number
- Math-4232 Pollock's octahedral-number conjecture
- Math-4233 Greenberg's p-rationality conjecture
- Math-4234 Brumer–Stark conjecture
- Math-4235 Second Hardy–Littlewood zeta-function conjecture