Papex

Unsolved problems in mathematics

Each problem comes from a named list, with the status its source gives it. Papex does not decide whether a problem is solved.

  • Andrews–Curtis conjecture Open Can every balanced presentation of the trivial group be reduced to the trivial presentation using only Nielsen moves and conjugations of relators?
  • Antihydra Open Starting from 4 and repeatedly applying n ↦ ⌊3n/2⌋ + 2, do the odd values ever outnumber twice the even values?
  • Beal conjecture Open If A^x + B^y = C^z in positive integers with all three exponents greater than 2, must A, B and C share a prime factor?
  • Bellman’s lost-in-a-forest problem Open For a forest of known shape, what path guarantees escape in the shortest worst-case distance, starting from an unknown point facing an unknown direction?
  • Binary constant-weight codes A(n, d, w) Open What is A(n, d, w), the largest number of binary words of length n, each with exactly w ones, any two differing in at least d places?
  • Birch and Swinnerton-Dyer conjecture Open Does an elliptic curve’s L-function tell how many rational points it has?
  • Bonnesen–Fenchel conjecture on Meissner tetrahedra Open Are the two Meissner tetrahedra the three-dimensional shapes of constant width with the smallest volume?
  • Bounded Burnside problem Open For which m and n is the free Burnside group B(m, n) finite, and in particular, is B(2, 5) finite?
  • Brocard’s problem Open Is n! + 1 a perfect square for any n other than 4, 5 and 7?
  • Carmichael’s totient function conjecture Open Is every value of Euler’s totient function taken by at least two different numbers?
  • Class number one problem for real quadratic fields Open Are there infinitely many real quadratic number fields with unique factorisation (class number 1)?
  • Collatz conjecture Open Does the 3n + 1 process always reach 1, whatever number it starts from?
  • Conway’s 99-graph problem Open Is there a graph on 99 vertices in which every two adjacent vertices have exactly one common neighbour and every two non-adjacent vertices have exactly two?
  • Danzer’s problem Open Is there a set of points of bounded density that meets every convex region of unit area or volume?
  • Dürer’s unfolding problem (Shephard’s conjecture) Open Can every convex polyhedron be cut along some of its edges and unfolded flat into a single piece without overlaps?
  • Earth–Moon problem Open How many colours are needed for maps on the Earth and the Moon if each country and its lunar colony must share a colour?
  • Erdős Problem #583 Open Can every connected graph on n vertices be partitioned into at most ⌈n/2⌉ edge-disjoint paths?
  • Erdős Problem 382 (bad intervals of consecutive integers, Erdős and Graham) Open Let u <= v be such that the largest prime dividing the product u(u+1)...v appears in it with exponent at least 2. Can v - u be arbitrarily large?
  • Erdős–Gyárfás conjecture Open Does every graph in which each vertex has at least three neighbours contain a cycle whose length is a power of two?
  • Erdős–Hajnal conjecture Open For each graph H, is there a constant c > 0 such that every n-vertex graph with no induced copy of H has a clique or an independent set of at least n^c vertices?
  • Erdős–Moser equation Open Is 1 + 2 = 3 the only solution of 1^k + 2^k + ⋯ + (m − 1)^k = m^k in positive integers?
  • Erdős–Straus conjecture Open Can 4/n be written as 1/x + 1/y + 1/z with positive whole numbers x, y and z for every n ≥ 2?
  • Erdős–Turán conjecture on additive bases Open If every sufficiently large integer is a sum of two elements of a set B of natural numbers, must the number of such representations be unbounded?
  • Erdős–Ulam problem Open Is there a dense set of points in the plane whose pairwise distances are all rational numbers?
  • Existence of a Moore graph of degree 57 Open Is there a graph with 3,250 vertices, each of degree 57, in which any two vertices are at most two steps apart and no cycle is shorter than 5?
  • Existence of Lychrel numbers Open In base 10, is there a number that never reaches a palindrome when it is repeatedly added to its own digit reversal?
  • Fermat primes beyond 65,537 Open Is every Fermat number 2^(2^n) + 1 composite for n > 4?
  • Fermat–Catalan conjecture Open Are there only finitely many distinct triples (a^m, b^n, c^k) with a^m + b^n = c^k, where a, b, c are coprime positive integers, m, n, k are positive integers and 1/m + 1/n + 1/k < 1?
  • Gauss circle problem Open How far can the number of integer points inside a circle of radius r centred at the origin differ from the circle’s area πr²?
  • Gilbreath’s conjecture Open If you repeatedly take absolute differences of neighbouring terms, starting from the primes, does every resulting row begin with 1?
  • Goldbach’s conjecture Open Is every even number greater than 2 the sum of two primes?
  • Graceful tree conjecture Open Can the vertices of every tree with m edges be labelled with distinct numbers from 0 to m so that the edge differences are exactly 1 to m?
  • Gyárfás–Sumner conjecture Open For every tree T and every number t, can all graphs with no induced copy of T and no clique of t vertices be coloured with a number of colours that depends only on T and t?
  • Hadamard’s maximal determinant problem Open What is the largest possible determinant of an n × n matrix whose entries are all 1 or −1?
  • Hadwiger conjecture Open Does every graph that needs k colours contain the complete graph on k vertices as a minor?
  • Hadwiger covering conjecture Open Can every convex body in n-dimensional space be covered by at most 2^n smaller copies of itself, each only shrunk and shifted, not rotated?
  • Hadwiger–Nelson problem Open How many colours are needed to colour the plane so that no two points at distance 1 have the same colour?
  • Halving lines and k-sets Open What is the largest number of ways a line can split n points in the plane into two equal halves, or cut off exactly k of them?
  • Happy ending problem (Erdős–Szekeres conjecture) Open Does every set of 2^(n−2) + 1 points in the plane, no three on a line, contain n points that form a convex polygon?
  • Harborth’s conjecture Open Can every planar graph be drawn without crossings using straight edges whose lengths are all whole numbers?
  • Hilbert–Pólya conjecture Open Is there a self-adjoint operator whose eigenvalues are exactly the numbers t for which ½ + it is a non-trivial zero of the Riemann zeta function?
  • Hilbert’s sixteenth problem Open How can the ovals of a real plane algebraic curve be arranged, and how many limit cycles can a planar polynomial vector field of degree n have?
  • Hodge conjecture Open Is every Hodge class on a projective variety a combination of algebraic cycles?
  • Infinitely many Mersenne primes Open Are there infinitely many Mersenne primes, that is, primes of the form 2^n − 1?
  • Infinitely many Sophie Germain primes Open Are there infinitely many primes p for which 2p + 1 is also prime?
  • Inscribed square problem Open Does every closed curve in the plane that does not cross itself pass through all four corners of some square?
  • Inverse Galois problem Open Is every finite group the Galois group of some extension of the rational numbers?
  • Irrationality of Euler’s constant Open Is Euler’s constant γ ≈ 0.5772 an irrational number?
  • Kissing number problem Open In a given dimension, how many equal spheres can touch a central sphere of the same size without overlapping?
  • Kobon triangle problem Open What is the largest number of non-overlapping triangles whose sides lie on an arrangement of k lines?
  • Lebesgue’s universal covering problem Open What is the smallest-area convex shape that can cover every plane set of diameter one?
  • Legendre’s conjecture Open Is there always a prime number between two consecutive perfect squares?
  • Lehmer’s conjecture Open Is the Mahler measure of every integer polynomial either exactly 1 or at least some fixed constant greater than 1?
  • Lehmer’s totient problem Open Is there a composite number n for which Euler’s totient φ(n) divides n − 1?
  • List colouring conjecture Open If each edge of a graph has a list of allowed colours, as many as an ordinary edge colouring of the graph needs, can edges that meet always get different colours from their lists?
  • Littlewood conjecture Open For every pair of real numbers α and β, does n·‖nα‖·‖nβ‖ get arbitrarily close to 0, where ‖x‖ is the distance from x to the nearest integer?
  • Local connectivity of the Mandelbrot set (MLC) Open Is the Mandelbrot set locally connected?
  • Lonely runner conjecture Open If n runners with distinct constant speeds circle a track of length 1, is each of them at some moment at least 1/n away from all the others?
  • Lovász conjecture on Hamiltonian paths Open Does every finite connected vertex-transitive graph have a path that visits each vertex exactly once?
  • Magic square of squares Open Is there a 3 × 3 magic square whose nine entries are distinct perfect squares?
  • Mahler’s 3/2 problem Open Is there a positive real number x such that the fractional part of x·(3/2)^n is below 1/2 for every positive integer n?
  • Montgomery’s pair correlation conjecture Open Do the zeros of the Riemann zeta function, rescaled to unit average spacing, have the same pair correlation as the eigenvalues of large random Hermitian matrices?
  • Navier–Stokes existence and smoothness Under review Do smooth solutions of the 3D Navier–Stokes equations always exist?
  • No-three-in-line problem Open What is the largest number of points that can be placed in an n × n grid with no three of them on a common straight line?
  • Normality of π Open Does every finite string of digits appear in the decimal expansion of π as often as it would in a random sequence?
  • Novikov conjecture Open Are the higher signatures of a closed oriented manifold, numbers built from its Pontryagin classes and its fundamental group, unchanged under orientation-preserving homotopy equivalence?
  • Odd perfect numbers Open Is there an odd number that equals the sum of its divisors other than itself?
  • Perfect cuboid Open Is there a rectangular box whose edges, face diagonals and space diagonal all have whole-number lengths?
  • Periodicity of Grundy’s game Open In Grundy’s game, where players take turns splitting a heap into two unequal heaps, does the sequence of nim-values eventually repeat?
  • Primes of the form n² + 1 Open Are there infinitely many prime numbers that are one more than a perfect square?
  • Ramsey number R(5, 5) Open What is the smallest group size that guarantees five people who all know each other or five who are all strangers?
  • Recamán’s sequence Open Does every non-negative integer eventually appear in Recamán’s sequence?
  • Reconstruction conjecture Open Is every graph with at least three vertices determined by its collection of subgraphs with one vertex removed?
  • Resolution of singularities in positive characteristic Open Does every algebraic variety of dimension 4 or more over a field of positive characteristic have a resolution of singularities, a smooth variety mapping onto it properly and birationally?
  • Riemann hypothesis Open Do all non-trivial zeros of the Riemann zeta function have real part ½?
  • Rota’s basis conjecture Open Given n disjoint bases of an n-dimensional vector space, can they be arranged as the rows of an n × n grid whose columns are also bases?
  • Schanuel’s conjecture Open If z₁, …, zₙ are complex numbers linearly independent over the rationals, are at least n of z₁, …, zₙ, e^z₁, …, e^zₙ algebraically independent?
  • Schur numbers Open For k colours, what is the largest N such that the whole numbers 1, ..., N can be coloured so that no colour contains numbers x, y and x + y (x = y allowed)?
  • Shortest opaque set (opaque forest problem) Open What is the shortest system of curves that blocks every line of sight through a given shape, such as the unit square?
  • Smallest Sierpiński number Open Is 78,557 the smallest odd number k for which k·2^n + 1 is composite for every n?
  • Smooth Poincaré conjecture Open In which dimensions is every smooth manifold that is topologically a sphere also smoothly the standard sphere?
  • Snake-in-the-box problem Open What is the longest path along the edges of an n-dimensional cube that never comes next to a corner it visited earlier, other than the one it just left?
  • Solving chess Open With perfect play from both sides, does a game of chess end in a win for White, a win for Black or a draw?
  • Subsets of the grid with no isosceles triangles Open How many points can be chosen from the n × n grid so that no three of them form an isosceles triangle, flat ones included?
  • Sum of four cubes problem Open Can every integer be written as a sum of four cubes of integers, negative cubes allowed?
  • Sums of three cubes Open Can every whole number that does not leave remainder 4 or 5 on division by 9 be written as a sum of three integer cubes?
  • Sunflower conjecture Open For a fixed r, does every family of more than Cᵏ sets of size k contain r sets that all share the same pairwise intersection?
  • Tammes problem Open How should n points be placed on a sphere so that the smallest distance between any two of them is as large as possible?
  • Tarski’s exponential function problem Open Is there an algorithm that decides every first-order statement about the real numbers with addition, multiplication and the exponential function?
  • The no 5 on a sphere problem Open How many points can be chosen from the n × n × n grid so that no 5 of them lie on one sphere or one plane?
  • The ring loading problem Open What is the ring loading constant β of Schrijver, Seymour and Winkler: the smallest α such that for any nonnegative u_i, v_i with u_i + v_i ≤ 1 one can choose each z_i as v_i or −u_i with |(z_1 + … + z_k) − (z_{k+1} + … + z_m)| ≤ α for every k?
  • Total colouring conjecture Open Can the vertices and edges of every graph be coloured with at most Δ + 2 colours, Δ being the maximum degree, so that no adjacent or incident elements match?
  • Tuza’s conjecture Open In any graph, can all triangles be destroyed by deleting at most twice as many edges as the largest number of edge-disjoint triangles?
  • Twin prime conjecture Open Are there infinitely many pairs of primes that differ by 2?
  • Ulam’s packing conjecture Open Among all convex solids, is the ball the one whose densest packing leaves the most empty space?
  • Union-closed sets conjecture Open In every finite family of sets that contains the union of any two of its members, does some element belong to at least half of the sets?
  • Unknotting problem Open Can a computer decide in polynomial time whether a knot diagram shows a loop that can be untangled into a circle?
  • Vizing’s conjecture Open Is the domination number of the Cartesian product of two graphs always at least the product of their domination numbers?
  • Volume conjecture Open For a hyperbolic knot, does the growth rate of its coloured Jones polynomials at certain roots of unity give the hyperbolic volume of the space around the knot?
  • Weak Schur numbers Open For each number of colours k, what is the largest N such that 1, 2, ..., N can be coloured with k colours with no colour holding distinct x, y and x + y?
  • Zauner’s conjecture Open Does a symmetric informationally complete quantum measurement (SIC-POVM) exist in every finite dimension?