Top Open Problems
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.
15,944 records · Search and filter
- Math-11601 Are there infinitely many Fibonacci primes
- Math-11602 Are there infinitely many Kummer primes
- Math-11603 Are there infinitely many Kynea primes
- Math-11604 Are there infinitely many Lucas primes
- Math-11605 Are there infinitely many Newman–Shanks–Williams primes
- Math-11606 Are there infinitely many palindromic primes to every base
- Math-11607 Are there infinitely many Pell primes
- Math-11608 Are there infinitely many Pierpont primes
- Math-11609 Are there infinitely many prime quadruplets
- Math-11610 Are there infinitely many prime triplets
- Math-11611 Siegel's conjecture
- Math-11612 Are there infinitely many sexy primes
- Math-11613 Are there infinitely many Wagstaff primes
- Math-11614 Are there infinitely many Wieferich primes
- Math-11615 Are there infinitely many Wilson primes
- Math-11616 Are there infinitely many Wolstenholme primes
- Math-11617 Are there infinitely many Woodall primes
- Math-11618 Can a prime p satisfy $2^{p-1}\equiv 1\pmod{p^2}$ and $3^{p-1}\equiv 1\pmod{p^2}$ simultaneously
- Math-11619 Does every prime number appear in the Euclid–Mullin sequence
- Math-11620 What is the smallest Skewes's number
- Math-11621 For any given integer a > 0, are there infinitely many primes p such that a^{p − 1} ≡ 1 (mod p^{2})
- Math-11622 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-11623 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-11624 Is every Fermat number $2^{2^n} + 1$ composite for $n > 4$
- Math-11625 Is 509,203 the lowest Riesel number
- Math-11626 Pollock's octahedral-number conjecture
- Math-11627 Greenberg's p-rationality conjecture
- Math-11628 Brumer–Stark conjecture
- Math-11629 Second Hardy–Littlewood zeta-function conjecture
- Math-11630 Efficient couplings in acute triangles
- Math-11631 Are shy couplings necessarily rigid?
- Math-11632 Constant-factor online scheduling of subadditive batches
- Math-11633 Sharp phase transition for SIS epidemics on general networks
- Math-11634 Mixing of branch rotation and triangulation chains
- Math-11635 Stretch-length exponent in spatial networks
- Math-11636 Percolation criteria for merging planar empires
- Math-11637 Unbalanced regimes of the spatial city-growth model
- Math-11638 Growth exponents in the balanced city-growth regime
- Math-11639 Feasible statistic triples for SIRSNs
- Math-11640 Optimal length-route tradeoff for SIRSNs
- Math-11641 Local finiteness of SIRSN traffic intensity
- Math-11642 Converse implications among SIRSN properties
- Math-11643 Unbounded component uniqueness in a SIRSN
- Math-11644 Integrability of all routes to random points in a SIRSN
- Math-11645 Expected length of a SIRSN spanning subnetwork
- Math-11646 SIRSN subnetworks cannot be trees
- Math-11647 Scaling total life in a null-recurrent renewal process
- Math-11648 Joint limit of total life and relative age
- Math-11649 Setwise convergence versus total-variation convergence of shifted processes
- Math-11650 Coupling characterization of setwise asymptotic stationarity