give me a list of unsolved problems as equations and questions
- User
give me a list of unsolved problems as equations and questions
- Assistant
Sure! Here is a list of some well-known unsolved problems in mathematics and computer science, presented both as equations and questions:
-
The Riemann Hypothesis
Equation Form: [ \text{Re}(s) = \frac{1}{2} \quad \text{for all non-trivial zeros of} \quad \zeta(s) ] where (\zeta(s)) is the Riemann zeta function.
Question Form:
- Do all non-trivial zeros of the Riemann zeta function (\zeta(s)) have a real part equal to (\frac{1}{2})?
-
P vs NP Problem
Question Form:
- Is ( \mathbf{P} = \mathbf{NP} )?
- In other words, can every problem whose solution can be quickly verified by a computer ((\mathbf{NP})) also be quickly solved by a computer ((\mathbf{P}))?
-
The Hodge Conjecture
Equation/Formulation:
- Let (X) be a non-singular projective algebraic variety over (\mathbb{C}). The Hodge conjecture posits that certain de Rham cohomology classes are algebraic.
Question Form:
- Are all Hodge classes on a non-singular projective algebraic variety rational linear combinations of classes of algebraic cycles?
-
The Yang-Mills Existence and Mass Gap
Equation/Formulation:
- For a compact simple gauge group (G), the Yang-Mills theory seeks non-trivial solutions to the Yang-Mills equations exhibiting a "mass gap" (\Delta > 0).
Question Form:
- Does a quantum Yang-Mills theory exist that is both consistent with the axioms of quantum field theory and exhibits a mass gap?
-
The Navier-Stokes Existence and Smoothness
Equation Form: [ \rho \left( \frac{\partial \mathbf{u}}{\partial t} + (\mathbf{u} \cdot \nabla) \mathbf{u} \right) = -\nabla p + \mu \Delta \mathbf{u} + \mathbf{f} ] where (\mathbf{u}) is the velocity field, (p) the pressure, (\rho) the density, (\mu) the viscosity, and (\mathbf{f}) external forces.
Question Form:
- Do smooth and globally defined solutions exist for the three-dimensional Navier-Stokes equations given arbitrary smooth initial data?
-
The Birch and Swinnerton-Dyer Conjecture
Equation Form:
- For an elliptic curve (E) over (\mathbb{Q}), the conjecture relates the rank of (E(\mathbb{Q})) to the order of zero of its L-function (L(E, s)) at (s = 1): [ \text{rank}(E(\mathbb{Q})) = \text{ord}_{s=1} L(E, s) ]
Question Form:
- Does the rank of an elliptic curve over (\mathbb{Q}) equal the order of the zero of its (L)-function at (s = 1)?
-
The Twin Prime Conjecture
Question Form:
- Are there infinitely many twin primes—primes (p) such that (p + 2) is also prime?
-
The Goldbach Conjecture
Question Form:
- Can every even integer greater than 2 be expressed as the sum of two prime numbers?
- For all even (n > 2), does there exist primes (p) and (q) such that (n = p + q)?
-
The Collatz Conjecture
Equation/Formulation:
- Define a function (f(n)): [ f(n) = \begin{cases} n / 2 & \text{if } n \text{ is even} \ 3n + 1 & \text{if } n \text{ is odd} \end{cases} ]
- The conjecture states that for all positive integers (n), repeated iteration of (f(n)) will eventually reach 1.
Question Form:
- Does the sequence defined by the Collatz function reach 1 for all positive integers (n)?
-
The Hodge Conjecture
(Note: Already listed as item 3. Maybe rephrase or replace.)
Let's replace item 10 with a different unsolved problem to avoid duplication.
-
The Beal Conjecture
Equation Form: [ A^x + B^y = C^z ] where (A), (B), (C), (x), (y), (z) are positive integers with (x, y, z > 2).
Question Form:
- Are there any solutions to (A^x + B^y = C^z) with (A), (B), (C) being pairwise coprime positive integers and exponents (x, y, z > 2), other than the known trivial solutions? The conjecture suggests that (A), (B), and (C) must share a common prime factor.
-
The Erdős Conjecture on Arithmetic Progressions
Question Form:
- Does every set of natural numbers with positive density contain arbitrarily long arithmetic progressions?
-
The Congruent Number Problem
Equation Form:
- A positive integer (n) is congruent if it is the area of a right-angled triangle with rational side lengths. The problem involves the equation: [ y^2 = x^3 - n^2 x ]
Question Form:
- Can we determine whether a given positive integer (n) is a congruent number?
-
The Sensitivity Conjecture
Question Form:
- In theoretical computer science, does the sensitivity of a Boolean function grow polynomially with other complexity measures like block sensitivity or degree?
-
The Jacobian Conjecture
Equation Form:
- Let (F: \mathbb{C}^n \to \mathbb{C}^n) be a polynomial map with polynomial inverses and determinant of the Jacobian matrix equal to 1. Does it imply that (F) is invertible, and its inverse is also polynomial?
Question Form:
- Is every polynomial mapping from (\mathbb{C}^n) to (\mathbb{C}^n) with a non-zero constant Jacobian determinant invertible with a polynomial inverse?
-
Existence of Odd Perfect Numbers
Question Form:
- Does an odd perfect number exist?
- A perfect number (n) satisfies (\sigma(n) = 2n), where (\sigma(n)) is the sum of the positive divisors of (n).
These problems are some of the most famous and enduring challenges in mathematics and computer science. Solving any one of them would be a monumental achievement and could potentially lead to a deeper understanding of fundamental mathematical principles.
Note: The above list is accurate as of my knowledge cutoff in October 2023. For the most recent updates on these problems, please consult the latest mathematical literature or official problem descriptions from reputable mathematical organizations.
-