List of Difficult Math Problems
Recommended post: 【Modern Mathematics】 Modern Mathematics Table of Contents
1. Unsolved difficult problems
a. List of Math Exploration Topics
b. ProofAtlas
1. Unsolved Difficult Problems
⑴ Wikipedia List of Unsolved Problems
⑵ Collatz conjecture
① Prove that when transforming a number n by dividing by 2 if it is even, and transforming to 3n+1 if it is odd, this sequence eventually converges to 1.
⑸ Triangulation Orchard Problem
⑹ Mathematical formula that explains the number of structural isomers of alkanes (ref)
⑺ kissing number: What is the maximum kissing number that an n-dimensional sphere can have in (n + 1)-dimensional Euclidean space? AlphaEvolve derived a better solution in 11 dimensions.
⑻ Brown number: Do there exist natural-number pairs (n, m) such that $n! + 1 = m^2$ other than (4, 5), (5, 11), and (7, 71)?
⑼ Theory on power towers: Despite multifaceted efforts, we know very little about this function (‘Euler’)
⑽ Erdős’ minimum overlap problem
① Problem: Partition the set {$1,2,\ldots,2n$} into two sets $A$ and $B$ of equal size $n$. For each integer $k$, define $M_k=$#{$(a_i,b_j): a_i\in A,\ b_j\in B,\ a_i-b_j=k$}, the number of pairs whose difference equals $k$. For a given partition $(A,B)$, consider $\max_k M_k,$ the maximum overlap over all differences. Define $M(n)=\min_{A,B}\max_k M_k.$ The constant of interest is $c=\lim_{n\to\infty}\frac{M(n)}{n},$ and the goal is to tighten the best known lower and upper bounds on $c$.
② Recent Result: According to a recent paper (TTT-Discover), the current bound is $0.379005 < c < 0.380876.$
⑾ Conway’s Problem: When 9 randomly scattered points are connected, choosing any two connected points always allows one to form a planar triangle, and choosing any two unconnected points always allows one to form a planar quadrilateral. Then, what happens if this is extended to 99 points? (ref)
⒀ Extension of Lagrange’s Four-Square Theorem: Whether every nonnegative integer $n$ can be expressed as the sum of four cubes (ref)
⒁ Brocard’s problem: n! + 1 = m2 (ref)
⒂ Dürer’s Conjecture: Whether there exists a polyhedron whose faces overlap when unfolded into a planar net.
⒃ Goldbach’s Strong Conjecture: Every even integer greater than 2 can be expressed as the sum of two prime numbers.
2. Solved Difficult Problems
⑴ Fermat’s Last Theorem: Proven by Professor Andrew Wiles
⑶ Read Conjecture
① A combinatorics problem proposed in 1968 by British mathematician Ronald Read
② The conjecture that the absolute values of the coefficients of a chromatic polynomial can increase and then decrease, but cannot decrease and then increase
③ A chromatic polynomial is an expression that represents the number of ways to color a graph using at most n colors so that adjacent vertices are colored different colors
⑷ Rota Conjecture
① A problem proposed in 1971 by American mathematician Gian-Carlo Rota by generalizing the Read conjecture
② Expands the scope to a general setting that includes not only graphs from the Read conjecture but also the characteristic polynomials of finite sets in vector spaces
① What is the area of the largest sofa that can be moved through an L-shaped bent corridor? The shape of the sofa can be chosen freely.
② Proven in November 2024 by Korean researcher Baek Jineon.
⑹ Pancake sorting problem: Proven by Bill Gates
① Every odd integer can be expressed as the sum of three prime numbers.
② The statement is proved analytically for integers above a certain threshold (by estimating the distribution of prime numbers using analytic methods), while integers below that threshold are verified computationally.
⑾ Hilbert’s Tenth Problem over the Rational Numbers
Input: 2022.07.07 01:32