# My Favorite One-Liners: Part 109

I tried a new joke in class recently; it worked gloriously.

I wrote on the board a mathematical conjecture that has yet to be proven or disproven. To emphasize that nobody knows the answer yet despite centuries of effort, I told the class, “If you figure this out, call me and call me collect,” writing my office phone number on the board.

To complete the joke, I said, “Yeah, this is crazy. So here’s my number…”

I thoroughly enjoyed my students’ coruscating groans before I could complete the punch line.

# Five Simple Math Problems No One Can Solve

From Popular Mechanics: 5 Simple Math Problems No One Can Solve. The list:

1. The Collatz conjecture.
2. The moving sofa problem.
3. The perfect cuboid problem.
4. The inscribed square problem.
5. The happy ending problem.

# A nice article on recent progress on solving the twin prime conjecture

The twin prime conjecture (see here, here and here for more information) asserts that there are infinitely many primes that have a difference of 2. For example:

3 and 5 are twin primes;

5 and 7 are twin primes;

11 and 13 are twin primes;

17 and 19 are twin primes;

29 and 31 are twin primes; etc.

While most mathematicians believe the twin prime conjecture is correct, an explicit proof has not been found. Indeed, this has been one of the most popular unsolved problems in mathematics — not necessarily because it’s important, but for the curiosity that a conjecture so simply stated has eluded conquest by the world’s best mathematicians.

Still, research continues, and some major progress has been made in the past few years. (I like sharing this story with my students to convince them that not everything that can be known about mathematics has been figure out yet — a misconception encouraged by the structure of the secondary curriculum — and that research continues to this day.) Specifically, it was recently shown that, for some integer $N$ that is less than 70 million, there are infinitely many pairs of primes that differ by $N$.

http://video.newyorker.com/watch/annals-of-ideas-yitang-zhang-s-discovery-2015-01-28

http://www.newyorker.com/magazine/2015/02/02/pursuit-beauty

For more on recent progress:

# My Favorite One-Liners: Part 35

In this series, I’m compiling some of the quips and one-liners that I’ll use with my students to hopefully make my lessons more memorable for them.

Every once in a while, I’ll discuss something in class which is at least tangentially related to an unsolved problems in mathematics. For example, when discussing infinite series, I’ll ask my students to debate whether or not this series converges:

$1 + \frac{1}{10} + \frac{1}{100} + \frac{1}{1000} + \dots$

Of course, this one converges since it’s an infinite geometric series. Then we’ll move on to an infinite series that is not geometric:

$1 + \frac{1}{4} + \frac{1}{9} + \frac{1}{16} + \dots$,

where the denominators are all perfect squares. I’ll have my students guess about whether or not this one converges. It turns out that it does, and the answer is exactly what my students should expect the answer to be, $\pi^2/6$.

Then I tell my students, that was a joke (usually to relieved laughter).

Next, I’ll put up the series

$1 + \frac{1}{8} + \frac{1}{27} + \frac{1}{64} + \dots$,

where the denominators are all perfect cubes. I’ll have my students guess about whether or not this one converges. Usually someone will see that this one has to converge since the previous one converged and the terms of this one are pairwise smaller than the previous series — an intuitive use of the Dominated Convergence Test. Then, I’ll ask, what does this converge to?

The answer is, nobody knows. It can be calculated to very high precision with modern computers, of course, but it’s unknown whether there’s a simple expression for this sum.

So, concluding the story whenever I present an unsolved problem, I’ll tell my students,

If you figure out the answer, call me, and call me collect.

# What I Learned by Reading “Gamma: Exploring Euler’s Constant” by Julian Havil: Index

I’m doing something that I should have done a long time ago: collecting a series of posts into one single post.

When I was researching for my series of posts on conditional convergence, especially examples related to the constant $\gamma$, the reference Gamma: Exploring Euler’s Constant by Julian Havil kept popping up. Finally, I decided to splurge for the book, expecting a decent popular account of this number. After all, I’m a professional mathematician, and I took a graduate level class in analytic number theory. In short, I don’t expect to learn a whole lot when reading a popular science book other than perhaps some new pedagogical insights.

Boy, was I wrong. As I turned every page, it seemed I hit a new factoid that I had not known before.

In this series, I’d like to compile some of my favorites along with the page numbers in the book — while giving the book a very high recommendation.

Part 1: The smallest value of $n$ so that $1 + \frac{1}{2} + \dots + \frac{1}{n} > 100$ (page 23).

Part 2: Except for a couple select values of $m, the sum $\frac{1}{m} + \frac{1}{m+1} + \dots + \frac{1}{n}$ is never an integer (pages 24-25).

Part 3: The sum of the reciprocals of the twin primes converges (page 30).

Part 4: Euler somehow calculated $\zeta(26)$ without a calculator (page 41).

Part 5: The integral called the Sophomore’s Dream (page 44).

Part 6: St. Augustine’s thoughts on mathematicians — in context, astrologers (page 65).

Part 7: The probability that two randomly selected integers have no common factors is $6/\pi^2$ (page 68).

Part 8: The series for quickly computing $\gamma$ to high precision (page 89).

Part 9: An observation about the formulas for $1^k + 2^k + \dots + n^k$ (page 81).

Part 10: A lower bound for the gap between successive primes (page 115).

Part 11: Two generalizations of $\gamma$ (page 117).

Part 12: Relating the harmonic series to meteorological records (page 125).

Part 13: The crossing-the-desert problem (page 127).

Part 14: The worm-on-a-rope problem (page 133).

Part 15: An amazingly nasty formula for the $n$th prime number (page 168).

Part 16: A heuristic argument for the form of the prime number theorem (page 172).

Part 17: Oops.

Part 18: The Riemann Hypothesis can be stated in a form that can be understood by high school students (page 207).

# What I Learned from Reading “Gamma: Exploring Euler’s Constant” by Julian Havil: Part 18

The Riemann Hypothesis (see here, here, and here) is perhaps the most famous (and also most important) unsolved problems in mathematics. Gamma (page 207) provides a way of writing down this conjecture in a form that only uses notation that is commonly taught in high school:

If $\displaystyle \sum_{r=1}^\infty \frac{(-1)^r}{r^a} \cos(b \ln r) = 0$ and $\displaystyle \sum_{r=1}^\infty \frac{(-1)^r}{r^a} \sin(b \ln r) = 0$ for some pair of real numbers $a$ and $b$, then $a = \frac{1}{2}$.

As noted in the book, “It seems extraordinary that the most famous unsolved problem in the whole of mathematics can be phrased so that it involves the simplest of mathematical ideas: summation, trigonometry, logarithms, and [square roots].”

When I researching for my series of posts on conditional convergence, especially examples related to the constant $\gamma$, the reference Gamma: Exploring Euler’s Constant by Julian Havil kept popping up. Finally, I decided to splurge for the book, expecting a decent popular account of this number. After all, I’m a professional mathematician, and I took a graduate level class in analytic number theory. In short, I don’t expect to learn a whole lot when reading a popular science book other than perhaps some new pedagogical insights.

Boy, was I wrong. As I turned every page, it seemed I hit a new factoid that I had not known before.

In this series, I’d like to compile some of my favorites — while giving the book a very high recommendation.

# Win $1,000,000 by Playing Minesweeper! Yes, you read that headline correctly: it is possible for a mathematician to win$1,000,000 by playing Minesweeper. Here’s how:

First, the source of the $1,000,000. In 2000, the Clay Mathematics Institute created a list of important unsolved problems in mathematics (see also Wikipedia), offering each one a prize of$1,000,000 for a solution. Specifically, according to the rules,

[A] proposed solution must be published in a refereed mathematics publication of worldwide repute… and it must also have general acceptance in the mathematics community two years after.

Of the eight problems on the list, one (the Poincare conjecture) has been solved so far. Incredibly, the mathematician who produced the proof turned down the $1,000,000. He was also awarded the Fields Medal, considered the Nobel Prize of mathematics, but he refused that as well. The Millennium Problems parallel the famous 23 Hilbert problems posed by eminent mathematician David Hilbert in 1900. The Hilbert problems were unsolved at the time and were posed as a challenge to the mathematicians of the 20th century. These problems certainly generated a lot of buzz in the mathematical community, and most have been solved since 1900. (Sadly, none of the solvers won$1,000,000 for their work!)

What does this have to do with Minesweeper?

One of the problems is the famed P vs. NP problem. From Clay Mathematics:

Suppose that you are organizing housing accommodations for a group of four hundred university students. Space is limited and only one hundred of the students will receive places in the dormitory. To complicate matters, the Dean has provided you with a list of pairs of incompatible students, and requested that no pair from this list appear in your final choice. This is an example of what computer scientists call an NP-problem, since it is easy to check if a given choice of one hundred students proposed by a coworker is satisfactory (i.e., no pair taken from your coworker’s list also appears on the list from the Dean’s office), however the task of generating such a list from scratch seems to be so hard as to be completely impractical. Indeed, the total number of ways of choosing one hundred students from the four hundred applicants is greater than the number of atoms in the known universe! Thus no future civilization could ever hope to build a supercomputer capable of solving the problem by brute force; that is, by checking every possible combination of 100 students. However, this apparent difficulty may only reflect the lack of ingenuity of your programmer. In fact, one of the outstanding problems in computer science is determining whether questions exist whose answer can be quickly checked, but which require an impossibly long time to solve by any direct procedure. Problems like the one listed above certainly seem to be of this kind, but so far no one has managed to prove that any of them really are so hard as they appear, i.e., that there really is no feasible way to generate an answer with the help of a computer. Stephen Cook and Leonid Levin formulated the P (i.e., easy to find) versus NP (i.e., easy to check) problem independently in 1971.

In 2000, Richard Kaye (University of Birmingham, UK) made connected Minesweeper to the P vs. NP problem. Famed mathematical journalist Ian Stewart did a very nice job of describing the connection between the two, so I’ll simply refer to his post for a detailed description. Dr. Kaye’s website also gives a lot of information about the connection.

# Proving theorems and special cases (Part 9): The Riemann hypothesis

In a recent class with my future secondary math teachers, we had a fascinating discussion concerning how a teacher should respond to the following question from a student:

Is it ever possible to prove a statement or theorem by proving a special case of the statement or theorem?

Usually, the answer is no. In this series of posts, we’ve already seen that a conjecture could be true for the first 40 cases or even the first $10^{316}$ yet ultimately prove false for all cases.

For the next few posts, I thought I’d share a few of the most famous unsolved problems in mathematics… and just how much computational work has been done to check for a counterexample.

4. The Riemann hypothesis (see here, here, and here for more information) is perhaps the outstanding unsolved problem in pure mathematics, and a prize of \$1 million has been offered for its proof.

The Riemann zeta function is defined by

$\zeta(s) = \displaystyle \sum_{n=1}^\infty \frac{1}{n^s}$

for complex numbers $s$ with real part greater than 1. For example,

$\zeta(2) = \displaystyle \frac{1}{1^2} + \frac{1}{2^2} + \frac{1}{3^2} + \dots = \displaystyle \frac{\pi^2}{6}$

and

$\zeta(4) = \displaystyle \frac{1}{1^4} + \frac{1}{2^4} + \frac{1}{3^4} + \dots = \displaystyle \frac{\pi^4}{90}$

The definition of the Riemann zeta function can be extended to all complex numbers (except a pole at $s = 1$) by the integral

$\zeta(s) = \displaystyle \frac{1}{\Gamma(s)} \int_0^\infty \frac{x^{s-1}}{e^s - 1} dx$

and also analytic continuation.

The Riemann hypothesis conjectures to all solutions of the equation $\zeta(s) = 0$ other than negative even integers occur on the line $s = \frac{1}{2} + i t$. At present, it is known that the first 10 trillion solutions are on this line, so that every solution with $t < 2.4 \times 10^{12}$ is on this line. Of course, that’s not a proof that all solutions are on this line.

A full description of known results concerning the Riemann hypothesis requires much more than a single post. I’ll refer the interested reader to the links above from MathWorld, Wikipedia, and Claymath and the references embedded in those links. An excellent book for the layman concerning the Riemann hypothesis is Prime Obsession: Bernhard Riemann and the Greatest Unsolved Problem in Mathematics, by John Derbyshire.

# Proving theorems and special cases (Part 8): The Collatz conjecture

In a recent class with my future secondary math teachers, we had a fascinating discussion concerning how a teacher should respond to the following question from a student:

Is it ever possible to prove a statement or theorem by proving a special case of the statement or theorem?

Usually, the answer is no. In this series of posts, we’ve already seen that a conjecture could be true for the first 40 cases or even the first $10^{316}$ cases yet ultimately prove false for all cases.

For the next few posts, I thought I’d share a few of the most famous unsolved problems in mathematics… and just how much computational work has been done to check for a counterexample.

3. The Collatz conjecture (see here and here for more information) is an easily stated unsolved problem that can be understood by most fourth and fifth graders. Restated from a previous post:

Here’s the statement of the problem.

• If the integer is even, divide it by $2$. If it’s odd, multiply it by $3$ and then add $1$.
• Repeat until (and if) you reach $1$.

Here’s the question: Does this sequence eventually reach $1$ no matter the starting value? Or is there a number out there that you could use as a starting value that has a sequence that never reaches $1$?

For every integer less than $5 \times 2^{60} = 5,764,607,523,034,234,880$, this sequence returns to 1. Of course, this is not a proof that the conjecture will hold for every integer.

# Proving theorems and special cases (Part 7): The twin prime conjecture

In a recent class with my future secondary math teachers, we had a fascinating discussion concerning how a teacher should respond to the following question from a student:

Is it ever possible to prove a statement or theorem by proving a special case of the statement or theorem?

Usually, the answer is no. In this series of posts, we’ve already seen that a conjecture could be true for the first 40 cases or even the first $10^{316}$ cases yet ultimately prove false for all cases.

For the next few posts, I thought I’d share a few of the most famous unsolved problems in mathematics… and just how much computational work has been done to check for a counterexample.

2. The twin prime conjecture (see here and here for more information) asserts that there are infinitely many primes that have a difference of 2. For example:

3 and 5 are twin primes;

5 and 7 are twin primes;

11 and 13 are twin primes;

17 and 19 are twin primes;

29 and 31 are twin primes; etc.

While most mathematicians believe the twin prime conjecture is correct, an explicit proof has not been found. The largest known twin primes are

$3,756,801,695,685 \times 2^{666,669} \pm 1$,

numbers which have 200,700 decimal digits. Also, there are 808,675,888,577,436 twin prime pairs less than $10^{18}$.

Most mathematicians also believe that there are infinitely many cousin primes, which differ by 4:

3 and 7 are cousin primes;

7 and 11 are cousin primes;

13 and 17 are cousin primes;

19 and 23 are cousin primes;

37 and 41 are cousin primes; etc.

Most mathematicians also believe that there are infinitely many sexy primes (no, I did not make that name up), which differ by 6:

5 and 11 are sexy primes;

7 and 13 are sexy primes;

11 and 17 are sexy primes;

13 and 19 are sexy primes;

17 and 23 are sexy primes; etc.

(Parenthetically, a “sexy” prime is probably the most unfortunate name in mathematics ever since Paul Dirac divided a bracket into a “bra” and a “ket,” thereby forever linking women’s underwear to quantum mechanics.)

While it is unknown if there are infinitely many twin primes, it was recently shown — in 2013 — that, for some integer $N$ that is less than 70 million, there are infinitely many pairs of primes that differ by $N$. In 2014, this upper bound was reduced to 246. Furthermore, if a certain other conjecture is true, the bound has been reduced to 6. In other words, there are infinitely many twin primes or cousin primes or sexy primes… but, at this moment, we don’t know which one (or ones) is infinite.

In November 2014, Dr. Terence Tao of the UCLA Department of Mathematics was interviewed on the Colbert Report to discuss the twin prime conjecture… and he does a good job explaining to Stephen Colbert how we can know one of the three categories is infinite without knowing which category it is.

From the Colbert Report: http://thecolbertreport.cc.com/videos/6wtwlg/terence-tao