Abc conjecture

The abc conjecture (also known as Oesterlé–Masser conjecture) is a conjecture in number theory, first proposed by and as an integer analogue of the Mason–Stothers theorem for polynomials.

The abc conjecture (also known as Oesterlé–Masser conjecture) is a conjecture in number theory, first proposed by and as an integer analogue of the Mason–Stothers theorem for polynomials.

Andrica's conjecture

Andrica's conjecture (named after Dorin Andrica) is a conjecture regarding the gaps between prime numbers.

Andrica's conjecture (named after Dorin Andrica) is a conjecture regarding the gaps between prime numbers.

Arithmetic number

In number theory, an arithmetic number is an integer for which the arithmetic mean of its positive divisors, is an integer.

In number theory, an arithmetic number is an integer for which the arithmetic mean of its positive divisors, is an integer.

Balanced prime

A balanced prime is a prime number that is equal to the arithmetic mean of the nearest primes above and below.

A balanced prime is a prime number that is equal to the arithmetic mean of the nearest primes above and below.

Beal's conjecture

Beal's conjecture is a conjecture in number theory proposed by Andrew Beal in 1993.

Beal's conjecture is a conjecture in number theory proposed by Andrew Beal in 1993.

Birch and Swinnerton-Dyer conjecture

In mathematics, the Birch and Swinnerton-Dyer conjecture is an open problem in the field of number theory.

In mathematics, the Birch and Swinnerton-Dyer conjecture is an open problem in the field of number theory.

Bloch's theorem (complex variables)

In complex analysis, a field within mathematics, Bloch's theorem is a result that gives a lower bound on the size of the image of a certain class of holomorphic functions.

In complex analysis, a field within mathematics, Bloch's theorem is a result that gives a lower bound on the size of the image of a certain class of holomorphic functions.

Bunyakovsky conjecture

The Bunyakovsky conjecture (or Bouniakowsky conjecture) stated in 1857 by the Russian mathematician Viktor Bunyakovsky, claims that an irreducible polynomial of degree two or higher with i...

The Bunyakovsky conjecture (or Bouniakowsky conjecture) stated in 1857 by the Russian mathematician Viktor Bunyakovsky, claims that an irreducible polynomial of degree two or higher with i...

Burnside's problem

The Burnside problem, posed by William Burnside in 1902 and one of the oldest and most influential questions in group theory, asks whether a finitely generated group in which every element has f...

The Burnside problem, posed by William Burnside in 1902 and one of the oldest and most influential questions in group theory, asks whether a finitely generated group in which every element has f...

Carmichael's totient function conjecture

In mathematics, Carmichael's totient function conjecture concerns the multiplicity of values of Euler's totient function φ, which counts the number of integers less than and coprime to n.

In mathematics, Carmichael's totient function conjecture concerns the multiplicity of values of Euler's totient function φ, which counts the number of integers less than and coprime to n.

Cherlin-Zilber conjecture

In model theory, a stable group is a group that is stable in the sense of stability theory.

In model theory, a stable group is a group that is stable in the sense of stability theory.

Collatz conjecture

The Collatz conjecture is a conjecture in mathematics named after Lothar Collatz, who first proposed it in 1937.

The Collatz conjecture is a conjecture in mathematics named after Lothar Collatz, who first proposed it in 1937.

Congruent number

In mathematics, a congruent number is a positive integer that is the area of a right triangle with three rational number sides.

In mathematics, a congruent number is a positive integer that is the area of a right triangle with three rational number sides.

Constant problem

In mathematics, the constant problem is the problem of deciding if a given expression is equal to zero.

In mathematics, the constant problem is the problem of deciding if a given expression is equal to zero.

Covering problem of Rado

The covering problem of Rado is an unsolved problem in geometry concerning covering planar sets by squares.

The covering problem of Rado is an unsolved problem in geometry concerning covering planar sets by squares.

Cullen number

In mathematics, a Cullen number is a natural number of the form n · 2

In mathematics, a Cullen number is a natural number of the form n · 2

^{n}+ 1 (written C_{n}).Discrepancy of hypergraphs

Discrepancy of hypergraphs is an area of discrepancy theory.

Discrepancy of hypergraphs is an area of discrepancy theory.

Discrepancy theory

In mathematics, discrepancy theory describes the deviation of a situation from the state one would like it to be.

In mathematics, discrepancy theory describes the deviation of a situation from the state one would like it to be.

Divisor summatory function

In number theory, the divisor summatory function is a function that is a sum over the divisor function.

In number theory, the divisor summatory function is a function that is a sum over the divisor function.

Euclid number

In mathematics, Euclid numbers are integers of the form E

In mathematics, Euclid numbers are integers of the form E

_{n}= p_{n}# + 1, where p_{n}# is the nth primorial, i.e. the product of the first n primes.Euclid-Mullin sequence

The Euclid–Mullin sequence is an infinite sequence of distinct prime numbers, in which each element is the least prime factor of one plus the product of all earlier elements.

The Euclid–Mullin sequence is an infinite sequence of distinct prime numbers, in which each element is the least prime factor of one plus the product of all earlier elements.

Euclid–Mullin sequence

The Euclid–Mullin sequence is an infinite sequence of distinct prime numbers, in which each element is the least prime factor of one plus the product of all earlier elements.

The Euclid–Mullin sequence is an infinite sequence of distinct prime numbers, in which each element is the least prime factor of one plus the product of all earlier elements.

Euler brick

In mathematics, an Euler brick, named after Leonhard Euler, is a cuboid whose edges and face diagonals all have integer lengths.

In mathematics, an Euler brick, named after Leonhard Euler, is a cuboid whose edges and face diagonals all have integer lengths.

Euler-Mascheroni constant

The Euler–Mascheroni constant (also called Euler's constant) is a mathematical constant recurring in analysis and number theory, usually denoted by the lowercase Greek letter γ (gamma).

The Euler–Mascheroni constant (also called Euler's constant) is a mathematical constant recurring in analysis and number theory, usually denoted by the lowercase Greek letter γ (gamma).

Euler–Mascheroni constant

The Euler–Mascheroni constant (also called Euler's constant) is a mathematical constant recurring in analysis and number theory, usually denoted by the lowercase Greek letter γ (gamma).

The Euler–Mascheroni constant (also called Euler's constant) is a mathematical constant recurring in analysis and number theory, usually denoted by the lowercase Greek letter γ (gamma).

Fibonacci prime

A Fibonacci prime is a Fibonacci number that is prime, a type of integer sequence prime.

A Fibonacci prime is a Fibonacci number that is prime, a type of integer sequence prime.

Four exponentials conjecture

In mathematics, specifically the field of transcendental number theory, the four exponentials conjecture is a conjecture which, given the right conditions on the exponents, would guarantee the t...

In mathematics, specifically the field of transcendental number theory, the four exponentials conjecture is a conjecture which, given the right conditions on the exponents, would guarantee the t...

Friendly number

In number theory, friendly numbers are two or more natural numbers with a common abundancy, the ratio between the sum of divisors of a number and the number itself.

In number theory, friendly numbers are two or more natural numbers with a common abundancy, the ratio between the sum of divisors of a number and the number itself.

Gauss circle problem

In mathematics, the Gauss circle problem is the problem of determining how many integer lattice points there are in a circle centred at the origin and with radius r.

In mathematics, the Gauss circle problem is the problem of determining how many integer lattice points there are in a circle centred at the origin and with radius r.

Gaussian moat

In number theory, the Gaussian moat problem asks whether it is possible to find an infinite sequence of distinct Gaussian prime numbers such that the difference between consecutive numbers in th...

In number theory, the Gaussian moat problem asks whether it is possible to find an infinite sequence of distinct Gaussian prime numbers such that the difference between consecutive numbers in th...

Generalized star height problem

The generalized star-height problem in formal language theory is the open question whether all regular languages can be expressed using generalized regular expressions with a limited nesting dep...

The generalized star-height problem in formal language theory is the open question whether all regular languages can be expressed using generalized regular expressions with a limited nesting dep...

Gilbreath's conjecture

Gilbreath's conjecture is a hypothesis, or a conjecture, in number theory regarding the sequences generated by applying the forward difference operator to consecutive prime numbers and leaving t...

Gilbreath's conjecture is a hypothesis, or a conjecture, in number theory regarding the sequences generated by applying the forward difference operator to consecutive prime numbers and leaving t...

Goldbach's conjecture

Goldbach's conjecture is one of the oldest and best-known unsolved problems in number theory and in all of mathematics.

Goldbach's conjecture is one of the oldest and best-known unsolved problems in number theory and in all of mathematics.

Goldbach's weak conjecture

In number theory, Goldbach's weak conjecture, also known as the odd Goldbach conjecture, the ternary Goldbach problem, or the 3-primes problem, states that: : Every odd number ...

In number theory, Goldbach's weak conjecture, also known as the odd Goldbach conjecture, the ternary Goldbach problem, or the 3-primes problem, states that: : Every odd number ...

Goormaghtigh conjecture

In mathematics, the Goormaghtigh conjecture is a conjecture in number theory named for the Belgian mathematician René Goormaghtigh.

In mathematics, the Goormaghtigh conjecture is a conjecture in number theory named for the Belgian mathematician René Goormaghtigh.

Grothendieck-Katz p-curvature conjecture

In mathematics, the Grothendieck–Katz p-curvature conjecture is a problem on linear ordinary differential equations, related to differential Galois theory and in a loose sense analogous to the r...

In mathematics, the Grothendieck–Katz p-curvature conjecture is a problem on linear ordinary differential equations, related to differential Galois theory and in a loose sense analogous to the r...

Grothendieck–Katz p-curvature conjecture

In mathematics, the Grothendieck–Katz p-curvature conjecture is a problem on linear ordinary differential equations, related to differential Galois theory and in a loose sense analogous to the r...

In mathematics, the Grothendieck–Katz p-curvature conjecture is a problem on linear ordinary differential equations, related to differential Galois theory and in a loose sense analogous to the r...

Hadamard matrix

In mathematics, a Hadamard matrix, named after the French mathematician Jacques Hadamard, is a square matrix whose entries are either +1 or −1 and whose rows are mutually orthogonal.

In mathematics, a Hadamard matrix, named after the French mathematician Jacques Hadamard, is a square matrix whose entries are either +1 or −1 and whose rows are mutually orthogonal.

Hadamard's maximal determinant problem

Hadamard's maximal determinant problem, named after Jacques Hadamard, asks for the largest determinant of a matrix with elements equal to 1 or −1.

Hadamard's maximal determinant problem, named after Jacques Hadamard, asks for the largest determinant of a matrix with elements equal to 1 or −1.

Hadwiger-Nelson problem

In geometric graph theory, the Hadwiger–Nelson problem, named after Hugo Hadwiger and Edward Nelson, asks for the minimum number of colors required to color the plane such that no two points at ...

In geometric graph theory, the Hadwiger–Nelson problem, named after Hugo Hadwiger and Edward Nelson, asks for the minimum number of colors required to color the plane such that no two points at ...

Hadwiger–Nelson problem

In geometric graph theory, the Hadwiger–Nelson problem, named after Hugo Hadwiger and Edward Nelson, asks for the minimum number of colors required to color the plane such that no two points at ...

In geometric graph theory, the Hadwiger–Nelson problem, named after Hugo Hadwiger and Edward Nelson, asks for the minimum number of colors required to color the plane such that no two points at ...

Hermite's problem

Hermite's problem is an open problem in mathematics posed by Charles Hermite in 1848.

Hermite's problem is an open problem in mathematics posed by Charles Hermite in 1848.

Hilbert's ninth problem

Hilbert's ninth problem, from the list of 23 Hilbert's problems (1900), asked to find the most general reciprocity law for the norm residues of k-th order in a general algebraic number field...

Hilbert's ninth problem, from the list of 23 Hilbert's problems (1900), asked to find the most general reciprocity law for the norm residues of k-th order in a general algebraic number field...

Hilbert's problems

Hilbert's problems form a list of twenty-three problems in mathematics published by German mathematician David Hilbert in 1900.

Hilbert's problems form a list of twenty-three problems in mathematics published by German mathematician David Hilbert in 1900.

Hilbert's sixteenth problem

Hilbert's 16th problem was posed by David Hilbert at the Paris conference of the International Congress of Mathematicians in 1900, as part of his list of 23 problems in mathematics.

Hilbert's 16th problem was posed by David Hilbert at the Paris conference of the International Congress of Mathematicians in 1900, as part of his list of 23 problems in mathematics.

Hilbert's twelfth problem

Kronecker's Jugendtraum or Hilbert's twelfth problem, of the 23 mathematical Hilbert problems, is the extension of the Kronecker–Weber theorem on abelian extensions of the rational numbers...

Kronecker's Jugendtraum or Hilbert's twelfth problem, of the 23 mathematical Hilbert problems, is the extension of the Kronecker–Weber theorem on abelian extensions of the rational numbers...

Hodge conjecture

The Hodge conjecture is a major unsolved problem in algebraic geometry which relates the algebraic topology of a non-singular complex algebraic variety and the subvarieties of that variety.

The Hodge conjecture is a major unsolved problem in algebraic geometry which relates the algebraic topology of a non-singular complex algebraic variety and the subvarieties of that variety.

Idoneal number

In mathematics, Euler's idoneal numbers (also called suitable numbers or convenient numbers) are the positive integers D such that any integer expressible in only one way as x...

In mathematics, Euler's idoneal numbers (also called suitable numbers or convenient numbers) are the positive integers D such that any integer expressible in only one way as x...

Inscribed square problem

The inscribed square problem, also known as the square peg problem or the Toeplitz' conjecture, is an unsolved question in geometry: Does every plane simple closed curve contain al...

The inscribed square problem, also known as the square peg problem or the Toeplitz' conjecture, is an unsolved question in geometry: Does every plane simple closed curve contain al...

Invariant subspace problem

In the field of mathematics known as functional analysis, the invariant subspace problem for a complex Banach space H of dimension > 1 is the question whether every bounded linear operator...

In the field of mathematics known as functional analysis, the invariant subspace problem for a complex Banach space H of dimension > 1 is the question whether every bounded linear operator...

Inverse Galois problem

In Galois theory, the inverse Galois problem concerns whether or not every finite group appears as the Galois group of some Galois extension of the rational numbers Q.

In Galois theory, the inverse Galois problem concerns whether or not every finite group appears as the Galois group of some Galois extension of the rational numbers Q.

Jacobian conjecture

In mathematics, the Jacobian conjecture is a celebrated problem on polynomials in several variables.

In mathematics, the Jacobian conjecture is a celebrated problem on polynomials in several variables.

Khabibullin's conjecture on integral inequalities

In mathematics, Khabibullin's conjecture, named after B. N. Khabibullin, is related to Paley's problem for plurisubharmonic functions and to various extremal problems in the theory of entire fun...

In mathematics, Khabibullin's conjecture, named after B. N. Khabibullin, is related to Paley's problem for plurisubharmonic functions and to various extremal problems in the theory of entire fun...

Kobon triangle problem

The Kobon triangle problem is an unsolved problem in combinatorial geometry first stated by Kobon Fujimura.

The Kobon triangle problem is an unsolved problem in combinatorial geometry first stated by Kobon Fujimura.

Kummer–Vandiver conjecture

In mathematics, the Kummer–Vandiver conjecture concerns a property of algebraic number fields.

In mathematics, the Kummer–Vandiver conjecture concerns a property of algebraic number fields.

Landau's constants

In complex analysis, a branch of mathematics, Landau's constants are certain mathematical constants that describe the behaviour of holomorphic functions defined on the unit disk.

In complex analysis, a branch of mathematics, Landau's constants are certain mathematical constants that describe the behaviour of holomorphic functions defined on the unit disk.

Landau's problems

These problems were characterised in his speech as "unattackable at the present state of science" and are now known as Landau's problems.

These problems were characterised in his speech as "unattackable at the present state of science" and are now known as Landau's problems.

Legendre's conjecture

Legendre's conjecture, proposed by Adrien-Marie Legendre, states that there is a prime number between n

Legendre's conjecture, proposed by Adrien-Marie Legendre, states that there is a prime number between n

^{2}and (n + 1)^{2}for every positive integer n.Lindelöf hypothesis

In mathematics, the Lindelöf hypothesis is a conjecture by Finnish mathematician Ernst Leonard Lindelöf (see) about the rate of growth of the Riemann zeta function on the critical line that is i...

In mathematics, the Lindelöf hypothesis is a conjecture by Finnish mathematician Ernst Leonard Lindelöf (see) about the rate of growth of the Riemann zeta function on the critical line that is i...

Lonely runner conjecture

In number theory, and especially the study of diophantine approximation, the lonely runner conjecture is a conjecture originally due to J. M. Wills in 1967.

In number theory, and especially the study of diophantine approximation, the lonely runner conjecture is a conjecture originally due to J. M. Wills in 1967.

Lychrel number

A Lychrel number is a natural number that cannot form a palindrome through the iterative process of repeatedly reversing its digits and adding the resulting numbers.

A Lychrel number is a natural number that cannot form a palindrome through the iterative process of repeatedly reversing its digits and adding the resulting numbers.

M/G/k queue

In queueing theory, a discipline within the mathematical theory of probability, an M/G/k queue is a queue model where arrivals are Markovian (modulated by a Poisson process), service times...

In queueing theory, a discipline within the mathematical theory of probability, an M/G/k queue is a queue model where arrivals are Markovian (modulated by a Poisson process), service times...

Magic square

In recreational mathematics, a magic square is an arrangement of numbers (usually integers) in a square grid, where the numbers in each row, and in each column, and the numbers in the forward an...

In recreational mathematics, a magic square is an arrangement of numbers (usually integers) in a square grid, where the numbers in each row, and in each column, and the numbers in the forward an...

McMullen problem

The McMullen problem is an open problem in discrete geometry named after Peter McMullen.

The McMullen problem is an open problem in discrete geometry named after Peter McMullen.

Mersenne conjectures

In mathematics, the Mersenne conjectures concern the characterization of prime numbers of a form called Mersenne primes, meaning prime numbers that are a power of two minus one.

In mathematics, the Mersenne conjectures concern the characterization of prime numbers of a form called Mersenne primes, meaning prime numbers that are a power of two minus one.

Millennium Prize Problems

The Millennium Prize Problems are seven problems in mathematics that were stated by the Clay Mathematics Institute in 2000.

The Millennium Prize Problems are seven problems in mathematics that were stated by the Clay Mathematics Institute in 2000.

Moser's worm problem

Moser's worm problem was formulated by the Austrian-Canadian mathematician Leo Moser in 1966.

Moser's worm problem was formulated by the Austrian-Canadian mathematician Leo Moser in 1966.

Moving sofa problem

The moving sofa problem was formulated by the Austrian-Canadian mathematician Leo Moser in 1966.

The moving sofa problem was formulated by the Austrian-Canadian mathematician Leo Moser in 1966.

Navier-Stokes existence and smoothness

This is called the Navier–Stokes existence and smoothness problem.

This is called the Navier–Stokes existence and smoothness problem.

Navier–Stokes existence and smoothness

This is called the Navier–Stokes existence and smoothness problem.

This is called the Navier–Stokes existence and smoothness problem.

Odd greedy expansion

In number theory, the odd greedy expansion problem concerns a method for forming Egyptian fractions in which all denominators are odd.

In number theory, the odd greedy expansion problem concerns a method for forming Egyptian fractions in which all denominators are odd.

Palindromic prime

A palindromic prime (sometimes called a palprime) is a prime number that is also a palindromic number.

A palindromic prime (sometimes called a palprime) is a prime number that is also a palindromic number.

Perfect number

In number theory, a perfect number is a positive integer that is equal to the sum of its proper positive divisors, that is, the sum of its positive divisors excluding the number itself (also kno...

In number theory, a perfect number is a positive integer that is equal to the sum of its proper positive divisors, that is, the sum of its positive divisors excluding the number itself (also kno...

Prime quadruplet

A prime quadruplet (sometimes called prime quadruple) is a set of four primes of the form {p, p+2, p+6, p+8}.

A prime quadruplet (sometimes called prime quadruple) is a set of four primes of the form {p, p+2, p+6, p+8}.

Prime triplet

In mathematics, a prime triplet is a set of three prime numbers of the form or.

In mathematics, a prime triplet is a set of three prime numbers of the form or.

Quasiperfect number

In mathematics, a quasiperfect number is a theoretical natural number n for which the sum of all its divisors (the divisor function σ(n)) is equal to 2n + 1.

In mathematics, a quasiperfect number is a theoretical natural number n for which the sum of all its divisors (the divisor function σ(n)) is equal to 2n + 1.

Regular prime

In number theory, a regular prime is a special kind of prime number, defined by Ernst Kummer in 1850 to prove certain cases of Fermat's Last Theorem.

In number theory, a regular prime is a special kind of prime number, defined by Ernst Kummer in 1850 to prove certain cases of Fermat's Last Theorem.

Resolution of singularities

In algebraic geometry, the problem of resolution of singularities asks whether every algebraic variety V has a resolution, a non-singular variety W with a proper birational map W→V. For varieties over fields of characteristic 0 this was proved in, while for varieties over fields of characteristic...

In algebraic geometry, the problem of resolution of singularities asks whether every algebraic variety V has a resolution, a non-singular variety W with a proper birational map W→V. For varieties over fields of characteristic 0 this was proved in, while for varieties over fields of characteristic...

Riemann hypothesis

In mathematics, the Riemann hypothesis, proposed by is a conjecture that the nontrivial zeros of the Riemann zeta function all have real part 1/2.

In mathematics, the Riemann hypothesis, proposed by is a conjecture that the nontrivial zeros of the Riemann zeta function all have real part 1/2.

Riesel number

In mathematics, a Riesel number is an odd natural number k for which the integers of the form k·2

In mathematics, a Riesel number is an odd natural number k for which the integers of the form k·2

^{n}− 1 are composite for all natural numbers n.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...

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...

Second Hardy–Littlewood conjecture

In number theory, the second Hardy–Littlewood conjecture concerns the number of primes in intervals.

In number theory, the second Hardy–Littlewood conjecture concerns the number of primes in intervals.

Sierpinski number

In number theory, a Sierpinski or Sierpiński number is an odd natural number k such that k2

In number theory, a Sierpinski or Sierpiński number is an odd natural number k such that k2

^{n}+ 1 is composite, for all natural numbers n; in 1960, Wacław Sierpiński p...Smale's problems

Smale's problems are a list of eighteen unsolved problems in mathematics that was proposed by Steve Smale in 1998, republished in 1999.

Smale's problems are a list of eighteen unsolved problems in mathematics that was proposed by Steve Smale in 1998, republished in 1999.

Star height problem

The star height problem in formal language theory is the question whether all regular languages can be expressed using regular expressions of limited star height, i.e. with a limited nesting dep...

The star height problem in formal language theory is the question whether all regular languages can be expressed using regular expressions of limited star height, i.e. with a limited nesting dep...

Supersingular prime (for an elliptic curve)

In algebraic number theory, a supersingular prime is a prime number with a certain relationship to a given elliptic curve.

In algebraic number theory, a supersingular prime is a prime number with a certain relationship to a given elliptic curve.

Szpiro's conjecture

In number theory, Szpiro's conjecture concerns a relationship between the conductor and the discriminant of an elliptic curve.

In number theory, Szpiro's conjecture concerns a relationship between the conductor and the discriminant of an elliptic curve.

Tarski's exponential function problem

In model theory, Tarski's exponential function problem asks whether the usual theory of the real numbers together with the exponential function is decidable.

In model theory, Tarski's exponential function problem asks whether the usual theory of the real numbers together with the exponential function is decidable.

Twin prime

A twin prime is a prime number that has a prime gap of two, in other words, differs from another prime number by two, for example the twin prime pair (41, 43).

A twin prime is a prime number that has a prime gap of two, in other words, differs from another prime number by two, for example the twin prime pair (41, 43).

Unsolved problems in statistics

The unsolved problems in statistics are generally of a different flavor; according to John Tukey, "difficulties in identifying problems have delayed statistics far more than difficulties in sol...

The unsolved problems in statistics are generally of a different flavor; according to John Tukey, "difficulties in identifying problems have delayed statistics far more than difficulties in sol...

Untouchable number

An untouchable number is a positive integer that cannot be expressed as the sum of all the proper divisors of any positive integer.

An untouchable number is a positive integer that cannot be expressed as the sum of all the proper divisors of any positive integer.

Vandiver's conjecture

In mathematics, Vandiver's conjecture concerns a property of algebraic number fields.

In mathematics, Vandiver's conjecture concerns a property of algebraic number fields.

Wall-Sun-Sun prime

In number theory, a Wall–Sun–Sun prime or Fibonacci–Wieferich prime is a certain kind of prime number which is conjectured to exist although none are known.

In number theory, a Wall–Sun–Sun prime or Fibonacci–Wieferich prime is a certain kind of prime number which is conjectured to exist although none are known.

Wall-Sun–Sun prime

In number theory, a Wall–Sun–Sun prime or Fibonacci–Wieferich prime is a certain kind of prime number which is conjectured to exist although none are known.

In number theory, a Wall–Sun–Sun prime or Fibonacci–Wieferich prime is a certain kind of prime number which is conjectured to exist although none are known.

Wall–Sun–Sun prime

In number theory, a Wall–Sun–Sun prime or Fibonacci–Wieferich prime is a certain kind of prime number which is conjectured to exist although none are known.

In number theory, a Wall–Sun–Sun prime or Fibonacci–Wieferich prime is a certain kind of prime number which is conjectured to exist although none are known.

Waring's prime number conjecture

In mathematics, Waring's prime number conjecture is a conjecture in number theory, closely related to Vinogradov's theorem.

In mathematics, Waring's prime number conjecture is a conjecture in number theory, closely related to Vinogradov's theorem.

Water retention on mathematical surfaces

Water retention on mathematical surfaces refers to the water caught in ponds on a surface of cells of various heights on a regular array such as a square lattice, where water is rained down on e...

Water retention on mathematical surfaces refers to the water caught in ponds on a surface of cells of various heights on a regular array such as a square lattice, where water is rained down on e...

Wieferich prime

In number theory, a Wieferich prime is a prime number p such that p

In number theory, a Wieferich prime is a prime number p such that p

^{2}divides 2^{p − 1}− 1, therefore connecting these primes with Fermat's little theore...Wolstenholme prime

In number theory, a Wolstenholme prime is a special type of prime number satisfying a stronger version of Wolstenholme's theorem.

In number theory, a Wolstenholme prime is a special type of prime number satisfying a stronger version of Wolstenholme's theorem.

Woodall number

In number theory, a Woodall number (W

In number theory, a Woodall number (W

_{n}) is any natural number of the form :W_{n}= n × 2^{n}− 1 for some natural number n.Yang-Mills existence and mass gap

In mathematical physics, the Yang–Mills existence and mass gap problem is an unsolved problem and one of the seven Millennium Prize Problems defined by the Clay Mathematics Institute which has o...

In mathematical physics, the Yang–Mills existence and mass gap problem is an unsolved problem and one of the seven Millennium Prize Problems defined by the Clay Mathematics Institute which has o...

Zarankiewicz problem

The Zarankiewicz problem, an unsolved problem in mathematics, asks for the largest possible number of edges in a bipartite graph that has a given number of vertices but has no complete bipartite...

The Zarankiewicz problem, an unsolved problem in mathematics, asks for the largest possible number of edges in a bipartite graph that has a given number of vertices but has no complete bipartite...