Mystery
•
Unsolved problems
•
History of mathematics
•
Mathematics and culture
•
Open problem
•
Unsolved problems in mathematics
Conjecture
Mathematical problem solving
Lists of unsolved problems
Mathematics-related lists
List of unsolved problems in mathematics
This article reiterates the Millennium Prize list of unsolved problems in mathematics as of October 2014, and lists further unsolved problems in algebra, additive and algebraic number theories, analys...
Computational problem
•
Mathematics paradoxes
•
Named probability problems
•
Packing problem
•
Unsolved problems in mathematics
A New Hope for a Perplexing Mathematical Proof
Three years ago, a solitary mathematician released an impenetrable proof of the famous abc conjecture. At a recent conference dedicated to the work, optimism mixed with bafflement.
The Biggest Mystery In Mathematics: Shinichi Mochizuki And The Impenetrable Proof
A Japanese mathematician claims to have solved one of the most important problems in his field. The trouble is, hardly anyone can work out whether he's right. Sometime on the morning of 30 August 201...
Whitehead problem - Slideshow
Hilbert's ninth problem - Slideshow
Wall–Sun–Sun prime - Slideshow
Hilbert's twenty-first problem - Slideshow
Deligne conjecture - Slideshow
Computational problem
In theoretical computer science, a computational problem is a mathematical object representing a collection of questions that computers might be able to solve. For example, the problem of factoringis...
Computational problem - Wikipedia
Mathematics paradoxes
Named probability problems
Named probability problems - Wikipedia
Packing problem
Packing problems are a class of optimization problems in mathematics that involve attempting to pack objects together into containers. The goal is to either pack a single container as densely as possi...
Packing problem - Wikipedia
Unsolved problems in mathematics
This article reiterates the Millennium Prize list of unsolved problems in mathematics as of October 2014, and lists further unsolved problems in algebra, additive and algebraic number theories, analys...
A New Hope for a Perplexing Mathematical Proof
Three years ago, a solitary mathematician released an impenetrable proof of the famous abc conjecture. At a recent conference dedicated to the work, optimism mixed with bafflement.
Milnor conjecture
In mathematics, the Milnor conjecture was a proposal by John Milnor (1970) of a description of the Milnor K-theory (mod 2) of a general field F with characteristic different from 2, by m...
Takeuti's conjecture
In mathematics, Takeuti's conjecture is the conjecture of Gaisi Takeuti that a sequent formalisation of second-order logic has cut-elimination (Takeuti 1953). It was settled positively:Takeuti's conj...
The Biggest Mystery In Mathematics: Shinichi Mochizuki And The Impenetrable Proof
A Japanese mathematician claims to have solved one of the most important problems in his field. The trouble is, hardly anyone can work out whether he's right. Sometime on the morning of 30 August 201...
Circle packing in a square
Circle packing in a square is a packing problem in recreational mathematics, where the aim is to pack n unit circles into the smallest possible square; or, equivalently, to arrange n points in a unit ...
Circle packing
In geometry, circle packing is the study of the arrangement of circles (of equal or varying sizes) on a given surface such that no overlapping occurs and so that all circles touch another. The associa...
Circle packing - Wikipedia
Szpiro's conjecture
In number theory, Szpiro's conjecture concerns a relationship between the conductor and the discriminant of an elliptic curve. In a general form, it is equivalent to the well-known abc conjecture. I...
Szpiro's conjecture - Wikipedia
Hurwitz problem
Znám's problem
In number theory, Znám's problem asks which sets of k integers have the property that each integer in the set is a proper divisor of the product of the other integers in the set, plus 1. Znám's proble...
Znám's problem - Wikipedia
Nakai conjecture
In mathematics, the Nakai conjecture is an unproven characterization of smooth algebraic varieties, conjectured by Japanese mathematician Yoshikazu Nakai in 1961.It states that if V is a complex algeb...
Maximum flow problem
In optimization theory, maximum flow problems involve finding a feasible flow through a single-source, single-sink flow network that is maximum.The maximum flow problem can be seen as a special case o...
Maximum flow problem - Wikipedia
Knight's tour
A knight's tour is a sequence of moves of a knight on a chessboard such that the knight visits every square only once. If the knight ends on a square that is one knight's move from the beginning squar...
Knight's tour - Wikipedia
Hamburger moment problem
In mathematics, the Hamburger moment problem, named after Hans Ludwig Hamburger, is formulated as follows: given a sequence { mn : n = 1, 2, 3, ... }, does...
Hamburger moment problem - Wikipedia
Schoenflies problem
In mathematics, the Schoenflies problem or Schoenflies theorem, of geometric topology is a sharpening of the Jordan curve theorem by Arthur Schoenflies. For Jordan curves in the plane it is often ref...
Seventeen or Bust
Seventeen or Bust is a distributed computing project started in March 2002 to solve the last seventeen cases in the Sierpinski problem. The project has solved eleven cases, and continues to search fo...
Seventeen or Bust - Wikipedia
Schanuel's conjecture
In mathematics, specifically transcendence theory, Schanuel's conjecture is a conjecture made by Stephen Schanuel in the 1960s concerning the transcendence degree of certain field extensions of the r...
Moment problem
In mathematics, a moment problem arises as the result of trying to invert the mapping that takes a measure μ to the sequences of momentsMore generally, one may considerfor an arbitrary sequence o...
Boundary value problem
In mathematics, in the field of differential equations, a boundary value problem is a differential equation together with a set of additional constraints, called the boundary conditions. A solution to...
Boundary value problem - Wikipedia