Unsolved Problems

Showing 1-50 of 496 problems (Page 1 of 10)

PreviousNext
NT-001
Open

Odd Perfect Numbers

Does there exist an odd perfect number? A perfect number is a positive integer that is equal to the sum of its proper divisors (excluding itself). For...

L3
Number Theory
COMB-001
Open

The Hadwiger-Nelson Problem

What is the minimum number of colors needed to color the points of the plane such that no two points at distance 1 have the same color?...

L3
Combinatorics
GT-002
Open

Reconstruction Conjecture

Every finite simple graph on at least 3 vertices is uniquely determined by its vertex-deleted subgraphs....

L3
Graph Theory
NT-006
Open

Legendre's Conjecture

For every positive integer $n$, there exists a prime number between $n^2$ and $(n+1)^2$....

L3
Number Theory
NT-008
Open

Are there infinitely many perfect powers in the Fibonacci sequence?

Besides 1, 8, and 144, are there any other perfect powers (numbers of the form $a^b$ where $a, b > 1$) in the Fibonacci sequence?...

L3
Number Theory
NT-009
Open

Gilbreath's Conjecture

Starting with the sequence of primes and repeatedly taking absolute differences of consecutive terms, the first term of each row is always 1....

L3
Number Theory
COMB-003
Open

Ramsey Number R(5,5)

What is the exact value of $R(5,5)$, the smallest number $n$ such that any 2-coloring of the edges of $K_n$ contains a monochromatic $K_5$?...

L3
Combinatorics
COMB-004
Open

The Lonely Runner Conjecture

For any $n$ runners on a circular track with distinct constant speeds, each runner is "lonely" (distance at least $1/n$ from all others) at some time....

L3
Combinatorics
GT-003
Open

The Graceful Tree Conjecture

Every tree can be gracefully labeled: vertices can be assigned distinct labels from $\{0, 1, \ldots, |E|\}$ such that edge labels (absolute difference...

L3
Graph Theory
GEO-004
Open

The Moving Sofa Problem

What is the largest area of a shape that can be maneuvered through an L-shaped corridor of unit width?...

L3
Geometry
ALG-003
Open

The Köthe Conjecture

A ring has no non-zero nil ideal (an ideal all of whose elements are nilpotent) if and only if it has no non-zero nil one-sided ideal....

L3
Algebra
CS-002
Open

The Polynomial Hirsch Conjecture

The diameter of the graph of a $d$-dimensional polytope with $n$ facets is bounded by a polynomial in $d$ and $n$....

L3
Computer Science
SMA-007
Open

Smale's 7th Problem: Distribution of Points on the 2-Sphere

What is the optimal arrangement of $n$ points on the 2-sphere to minimize energy for various potential functions?...

L3
Geometry
COMB-005
Open

Frankl's Union-Closed Sets Conjecture

For every finite union-closed family of sets (other than the empty family), there exists an element that belongs to at least half of the sets....

L3
Combinatorics
NT-010
Open

Brocard's Problem

Find all integer solutions to $n! + 1 = m^2$....

L3
Number Theory
NT-012
Open

The Erdős-Straus Conjecture

For every integer $n \geq 2$, the equation $\frac{4}{n} = \frac{1}{x} + \frac{1}{y} + \frac{1}{z}$ has a solution in positive integers x, y, z....

L3
Number Theory
HIL-017
Open

Hilbert's 17th Problem: Expression of Definite Forms

Can every non-negative rational function be expressed as a sum of squares of rational functions?...

L3
Algebra
HIL-018
Open

Hilbert's 18th Problem: Polyhedra and Space-Filling

Are there only finitely many essentially different space-filling convex polyhedra? Is there a polyhedron which tiles space but not in a lattice arrang...

L3
Geometry
ALG-007
Open

Casas-Alvero Conjecture

If a univariate polynomial $f$ of degree $d$ over a field of characteristic 0 shares a common factor with each of its first $d-1$ derivatives, must $f...

L3
Algebra
ALG-010
Open

Herzog-Schönheim Conjecture

If a finite system of left cosets of subgroups of a group $G$ partitions $G$, then must at least two of the subgroups have the same index in $G$?...

L3
Algebra
ALG-012
Open

Existence of Perfect Cuboids

Does there exist a rectangular cuboid where all edges, face diagonals, and space diagonals have integer lengths?...

L3
Algebra
GEO-005
Open

Bellman's Lost in a Forest Problem

What is the shortest path that guarantees escape from a forest of known shape and size, starting from an unknown location?...

L3
Geometry
COMB-004
Open

Singmaster's Conjecture

Does there exist a finite upper bound on how many times a number (other than 1) can appear in Pascal's triangle?...

L3
Combinatorics
GT-008
Open

Cereceda's Conjecture

For any $k$-chromatic graph, can its $k$-colorings be transformed into each other by recoloring one vertex at a time, staying within $k$ colors, in po...

L3
Graph Theory
NT-024
Open

Erdős-Straus Conjecture

For every integer $n \geq 2$, can $\frac{4}{n}$ be expressed as the sum of three unit fractions $\frac{1}{x} + \frac{1}{y} + \frac{1}{z}$?...

L3
Number Theory
GT-010
Open

The Total Coloring Conjecture

Can every graph be totally colored with at most $\Delta + 2$ colors, where $\Delta$ is the maximum degree?...

L3
Graph Theory
ALG-029
Open

Infinitude of Leinster Groups

Are there infinitely many Leinster groups?...

L3
Algebra
GEO-017
Open

The Closed Curve Problem

What are necessary and sufficient conditions for an integral curve defined by two periodic functions to be closed?...

L3
Geometry
NT-049
Open

Lychrel Numbers in Base 10

Do Lychrel numbers exist in base 10?...

L3
Number Theory
NT-053
Open

Is 10 a Solitary Number?

Is 10 a solitary number (no other number shares its abundancy index)?...

L3
Number Theory
NT-060
Open

Recamán's Sequence Completeness

Does every nonnegative integer appear in Recamán's sequence?...

L3
Number Theory
ALG-006
Open

Perfect Cuboid

Does there exist a rectangular cuboid with integer edges, face diagonals, and space diagonal?...

L3
Algebra
COMB-004
Open

No-Three-in-Line Problem

What is the maximum number of points in an $n \times n$ grid with no three collinear?...

L3
Combinatorics
GAME-004
Open

Tic-Tac-Toe Winning Dimension

Given the width of a tic-tac-toe board, what is the smallest dimension guaranteeing X has a winning strategy?...

L3
Combinatorics
GAME-005
Open

Perfect Chess

What is the outcome of a perfectly played game of chess?...

L3
Combinatorics
GAME-006
Open

Perfect Komi in Go

What is the perfect value of komi (compensation points) in Go?...

L3
Combinatorics
GAME-008
Open

Octal Games Periodicity

Are the nim-sequences of all finite octal games eventually periodic?...

L3
Combinatorics
GAME-009
Open

Grundy's Game Periodicity

Is the nim-sequence of Grundy's game eventually periodic?...

L3
Combinatorics
GAME-010
Open

Rendezvous Problem

What is the optimal strategy for two agents to meet on a network without communication?...

L3
Combinatorics
GEOM-013
Open

Tammes Problem

For n > 14 points (except n=24), what is the maximum minimum distance between points on a unit sphere?...

L3
Geometry
GEOM-023
Open

Orchard-Planting Problem

What is the maximum number of 3-point lines attainable by a configuration of $n$ points in the plane?...

L3
Geometry
GEOM-025
Open

Bellman's Lost-in-a-Forest Problem

What is the shortest path that guarantees reaching the boundary of a given shape, starting from an unknown point with unknown orientation?...

L3
Geometry
GEOM-026
Open

Borromean Rings Question

Can three unknotted space curves (not all circles) be arranged as Borromean rings?...

L3
Geometry
GRAPH-002
Open

Eternal Domination vs Domination Number

Does there exist a graph where the dominating number equals the eternal dominating number and both are less than the clique covering number?...

L3
Graph Theory
GRAPH-005
Open

Graph Coloring Game Monotonicity

If Alice has a winning strategy for the vertex coloring game with k colors, does she have one for k+1 colors?...

L3
Graph Theory
GRAPH-009
Open

Earth-Moon Problem

What is the maximum chromatic number of biplanar graphs?...

L3
Graph Theory
GRAPH-016
Open

Conway's Thrackle Conjecture

Does every thrackle have at most as many edges as vertices?...

L3
Graph Theory
GRAPH-035
Open

Cubic Graph Pathwidth

What is the maximum pathwidth of an n-vertex cubic graph?...

L3
Graph Theory
GRAPH-036
Open

Snake-in-the-Box Problem

What is the longest induced path in an n-dimensional hypercube graph?...

L3
Graph Theory
GRAPH-043
Open

Word-Representable Graphs: Letter Copies Bound

Are there graphs on n vertices requiring more than floor(n/2) copies of each letter for word-representation?...

L3
Graph Theory
PreviousNext