Are there any (mathematical) puzzles that are still unresolved? I only mean questions that are accessible to and understandable by the complete layman and which have not been solved, despite serious efforts, by mathematicians (or laymen for that matter)?
My question does not ask for puzzles that have been shown to have either no solution or multiple solutions (or have been shown to be ambiguously formulated).
On
The Collatz conjecture seems to fit the bill.
Consider the function $f : \mathbb{N} \to \mathbb{N}$ (here $0 \not\in \mathbb{N}$) given by
$$f(n) = \begin{cases} \frac{n}{2} &\ \text{if}\ n\ \text{is even,}\\ &\\ 3n+1 &\ \text{if}\ n\ \text{is odd.} \end{cases}$$
The Collatz conjecture states that, for every $n \in \mathbb{N}$, there is $k \in \mathbb{N}$ such that $f^k(n) = 1$ where $f^k = \underbrace{f\circ f\circ \dots \circ f \circ f}_{k\ \text{times}}$. That is, for any positive integer, repeated application of the function $f$ will eventually lead to $1$.
Of course, this conjecture can be stated without the need to refer to the function $f$, but rather the rules of a game as follows.
Does the game always finish, no matter what number we begin with?
On
Frankl's union-closed sets conjecture: if $\mathcal F$ is a nonempty finite collection of nonempty finite sets, and if $X\cup Y\in\mathcal F$ whenever $X,Y\in\mathcal F$, must there be an element which is in more than half the members of $\mathcal F$?
P.S. There is an equivalent form of the conjecture, where the family $\mathcal F$ is permitted to have $\emptyset$ as an element; in this case the condition $\mathcal F\ne\emptyset$ has to be strengthened to $\bigcup\mathcal F\ne\emptyset$, and the conclusion has to be weakened to an element which is in at least half the members of $\mathcal F$.
On
What is a winning first move in the game of Chomp? (The game is known to be a win for the first player, but only by a nonconstructive "strategy-stealing" argument.)
On
Can we cover a unit square with $\dfrac1k \times \dfrac1{k+1}$ rectangles, where $k \in \mathbb{N}$?
Note that the areas sum to $1$ since $\displaystyle \sum_{k \in \mathbb{N}}\dfrac1{k(k+1)} = 1$.
Here is an MO thread discussing some of the progress on this problem.
On
In the spirit of O.L.'s example, I believe that the moving needle problem is still open:
Given a smoothly embedded copy of $\mathbb{R}$ in $\mathbb{R}^3$ containing $\{ (x,0,0) \ | \ x \in (-\infty,-C] \cup [C, \infty) \}$, is it always possible to continuously slide a unit length needle lying on the ray $(-\infty, -C]$ to the ray $[C, \infty)$, while keeping the head and tail of the needle on the curve throughout the process?
On
Does there exist a rectangular cuboid such that the width, height, breadth, length of all the diagonals, i.e., the diagonals on each face, and the body diagonal, are all integers?
On
The twin prime conjecture: there are infinitely many pairs of primes which are a distance $2$ from each other (like 11 and 13).
On
The Inscribed Square Problem seems to fit the bill.
Draw a non-intersecting loop. Is it possible to find four points on the loop which are the corners of a square?
More precisely, by a non-intersecting loop I mean a Jordan curve.
On
From wikpedia: The two envelopes problem, also known as the exchange paradox, is a brain teaser, puzzle, or paradox in logic, philosophy, probability, and recreational mathematics. It is of special interest in decision theory, and for the Bayesian interpretation of probability theory. Historically, it arose as a variant of the necktie paradox.
The problem:
You have two indistinguishable envelopes that each contain money. One contains twice as much as the other. You may pick one envelope and keep the money it contains. You pick at random, but before you open the envelope, you are offered the chance to take the other envelope instead.
It can be argued that it is to your advantage to swap envelopes by showing that your expected return on swapping exceeds the sum in your envelope. This leads to the paradoxical conclusion that it is beneficial to continue to swap envelopes indefinitely.
Example - Assume the amount in my selected envelope is \$20. If I happened to have selected the larger of the two envelopes, that would mean that the amount in my envelope is twice the amount in the other envelope. So in this case the amount in the other envelope would be \$10. However if I happened to have selected the smaller of the two envelopes, that would mean that the amount in the other envelope is twice the amount in my envelope. So in this second scenario the amount in the other envelope would be \$40. The probability of either of these scenarios is one half, since there is a 50% chance that I initially happened to select the larger envelope and a 50% chance that I initially happened to select the smaller envelope. The expected value calculation for how much money is in the other envelope would be the amount in the first scenario times the probability of the first scenario plus the amount in the second scenario times the probability of the second scenario, which is \$10 * 1/2 + \$40 * 1/2. The result of this calculation is that the expected value of money in the other envelope is \$25. Since this is greater than my selected envelope, it would appear to my advantage to always switch envelopes.
A large number of solutions have been proposed. The usual scenario is that one writer proposes a solution that solves the problem as stated, but then another writer discovers that altering the problem slightly revives the paradox. In this way, a family of closely related formulations of the problem have been created, which are discussed in the literature. No proposed solution is widely accepted as correct. Despite this it is common for authors to claim that the solution to the problem is easy, even elementary. However, when investigating these elementary solutions they often differ from one author to the next. In the last two decades, several new papers have been published every year.
On
Existence of odd perfect numbers. (Numbers which are the sum of their own proper divisors). This one has withstood over 2000 years of effort.
On
In his comment, user Vincent Pfenninger referred to a YouTube video that, amongst other fascinating, layman accessible puzzles, discusses packing squares problems proposed by Paul Erdős. I thought I'd include it among the answers (as a community wiki).
How big a square do you need to hold eleven little squares?
We don't even know if this is the best possible [solution.]
Which, to me, comes as a complete surprise. :)
Here is the link to Erich's Packing Center provided in grey below the picture. It contains lots of proposed solutions to packing problems like this one.
On
The einstein problem (in german meaning one stone). Also known as the monotile problem.
Is there a single tile in the plane which can tile the entire plane but can not tile the plane periodically?
Such a tiling with no requirement on the number of tiles is known as an aperiodic tiling and is associated with such famous images as the penrose tiling
and is closely related to the exciting new field of quasicrystals - crystalline structures which give rise to pure point Bragg diffraction patterns with rotational symmetries which are not possible in classical crystals (so not two, three, four, or six-fold symmetry).
The full statement of the monotile problem actually needs a few assumptions on what a tile is, and what it means for it to tile the plane, as certain versions of the problem have been solved. This is discussed in this paper by Socolar and Taylor. But some standard assumptions are that the tile is a connected subspace of the plane homeomorphic to the closed disk and with piecewise linear boundary, and that it can tile the plane if you can rotate and translate the tile in such a way that the union of a set of these transformations covers the plane, and the interior of any two transformed tiles have empty intersection.
For instance, if we allow for disconnected tiles, then the Socolar-Taylor tile is a monotile.
On
Wolfram's "New Kind of Science" book on cellular automata had a large accompanying list of open problems which must surely contain many suitable candidates (although note some of the questions are more in History of Mathematics territory). I'd be surprised if they've been all ticked off in the last decade.
Wolfram's opus also serves as some inspiration as to how simple systems with complex emergent behaviour can create an enormous - and accessible - fresh new landscape of problems ripe for exploration.
On
The lonely runner conjecture is particularly simple; If $k$ runners race around a circular track of length $1$ - all beginning from the same point - at pairwise distinct and constant speeds, then for every runner there will be a time when that runner is a distance of at least $1/k$ from every other runner a.k.a lonely.
The result is known for $k \leq 7$, but a general solution has yet to be discovered.
Image by Claudio Rocchini.
On
Here are two more problems I'd like to mention.
- Does there exist an odd positive integer $n$ (in base 10) satisfying: $$\begin{array} & \text{i})\space n \gt 1 \\ \text{ii})\space n \space \text{is a square} \\ \text{iii})\space \text{The only digits of}\space n \space \text{are} \space 0 \space \text{and} \space 1. \\ \end{array}$$
I've been playing with this on and off for 10 years with no success! $\mathbf {Note}$: There are no such integers less than $10^{50}$.
- Find 3 integers $x$,$y$ and $z$ such that $x^3 + y^3 + z^3 = 33$.
On
Gilbreath's conjecture is an unsolved problem related to primes which is as accessible to the layman as the Goldbach conjecture and twin prime conjecture, if not more so. It says that if we write out the prime numbers in order
$2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, ...$
then take the absolute values of the differences (often called the absolute difference) between consecutive terms,
$1, 2, 2, 4, 2, 4, 2, 4, 6, 2, ...$
and now do the same to the resulting values, then to those values, and so on to infinity i.e.
$1, 0, 2, 2, 2, 2, 2, 2, 4, ...$
$1, 2, 0, 0, 0, 0, 0, 2, ...$
$1, 2, 0, 0, 0, 0, 2, ...$
$1, 2, 0, 0, 0, 2, ...$
$1, 2, 0, 0, 2, ...$
the first term is always $1$. A simple observation utilized by Andrew Odlyzko to verify the conjecture for the first $3.4 \times 10^{11}$ differences is that if a sequence begins with $1$ and continues with only $0$ and $2$ for the next $n$ terms, then the next $n$ iterated differences must also begin with $1$, since the absolute difference between any combination of $0$ and $2$ is also $0$ or $2$, and the absolute difference between $1$ and either $0$ or $2$ is necessarily equal to $1$. Kyle Sturgill-Simon gives a nice exposition of the problem written specifically for the layman here.
Precisely the same conjecture has been made for the practical numbers, which have other significant analogies with prime numbers as well (see link). For intuition's sake the practical numbers can be seen as complementary to the primes in the sense that, whereas a prime number has no prime factors less than itself, a practical number typically has many prime factors which are small in comparison with the number itself. As a consequence, small multiples of practical numbers are also practical. In particular, if $n$ is practical and $1\leq m\leq 2n$, then $nm$ is practical. They begin:
$1, 2, 4, 6, 8, 12, 16, 18, 20, 24, 28, 30, 32, 36, 40, 42, 48, 54, ...$
The sofa problem.
From Wikipedia:
Author of the picture: Claudio Rocchini, see this link