CLOSE

3 Solved Math Mysteries (and 2 That Still Plague Us)

Mathematics has fascinated the human race nearly as long as our existence. Some of the coincidences between numbers and their applications are incredibly neat, and some of the most deceptively simple ones continue to stump us and even our modern computers. Here are three famous math problems that people struggled with for a long time but were finally resolved, followed by two simple concepts that continue to boggle mankind's best minds.

1. Fermat's Last Theorem

In 1637, Pierre de Fermat scribbled a note in the margin of his copy of the book Arithmetica. He wrote (conjectured, in math terms) that for an integer n greater that two, the equation an + bn = cn had no whole number solutions. He wrote a proof for the special case n = 4, and claimed to have a simple, "marvellous" proof that would make this statement true for all integers. However, Fermat was fairly secretive about his mathematic endeavors, and no one discovered his conjecture until his death in 1665. No trace was found of the proof Fermat claimed to have for all numbers, and so the race to prove his conjecture was on. For the next 330 years, many great mathematicians, such as Euler, Legendre, and Hilbert, stood and fell at the foot of what came to be known as Fermat's Last Theorem. Some mathematicians were able to prove the theorem for more special cases, such as n = 3, 5, 10, and 14. Proving special cases gave a false sense of satisfaction; the theorem had to be proved for all numbers. Mathematicians began to doubt that there were sufficient techniques in existence to prove theorem. Eventually, in 1984, a mathematician named Gerhard Frey noted the similarity between the theorem and a geometrical identity, called an elliptical curve. Taking into account this new relationship, another mathematician, Andrew Wiles, set to work on the proof in secrecy in 1986. Nine years later, in 1995, with help from a former student Richard Taylor, Wiles successfully published a paper proving Fermat's Last Theorem, using a recent concept called the Taniyama-Shimura conjecture. 358 years later, Fermat's Last Theorem had finally been laid to rest.

Enigma2. The Enigma Machine

The Enigma machine was developed at the end of World War I by a German engineer, named Arthur Scherbius, and was most famously used to encode messages within the German military before and during World War II.
The Enigma relied on rotors to rotate each time a keyboard key was pressed, so that every time a letter was used, a different letter was substituted for it; for example, the first time B was pressed a P was substituted, the next time a G, and so on. Importantly, a letter would never appear as itself-- you would never find an unsubstituted letter. The use of the rotors created mathematically driven, extremely precise ciphers for messages, making them almost impossible to decode. The Enigma was originally developed with three substitution rotors, and a fourth was added for military use in 1942. The Allied Forces intercepted some messages, but the encoding was so complicated there seemed to be no hope of decoding.

Enter mathematician Alan Turing, who is now considered the father of modern computer science. Turing figured out that the Enigma sent its messages in a specific format: the message first listed settings for the rotors. Once the rotors were set, the message could be decoded on the receiving end. Turing developed a machine called the Bombe, which tried several different combinations of rotor settings, and could statistically eliminate a lot of legwork in decoding an Enigma message. Unlike the Enigma machines, which were roughly the size of a typewriter, the Bombe was about five feet high, six feet long, and two feet deep. It is often estimated that the development of the Bombe cut the war short by as much as two years.
AprilFourColoring_900
3. The Four Color Theorem

The four color theorem was first proposed in 1852. A man named Francis Guthrie was coloring a map of the counties of England when he noticed that it seemed he would not need more than four ink colors in order to have no same-colored counties touching each other on the map. The conjecture was first credited in publication to a professor at University College, who taught Guthrie's brother. While the theorem worked for the map in question, it was deceptively difficult to prove. One mathematician, Alfred Kempe, wrote a proof for the conjecture in 1879 that was regarded as correct for 11 years, only to be disproven by another mathematician in 1890.

By the 1960s a German mathematician, Heinrich Heesch, was using computers to solve various math problems. Two other mathematicians, Kenneth Appel and Wolfgang Haken at the University of Illinois, decided to apply Heesch's methods to the problem. The four-color theorem became the first theorem to be proved with extensive computer involvement in 1976 by Appel and Haken.

...and 2 That Still Plague Us

Picture 11. Mersenne and Twin Primes

Prime numbers are a ticklish business to many mathematicians. An entire mathematic career these days can be spent playing with primes, numbers divisible only by themselves and 1, trying to divine their secrets. Prime numbers are classified based on the formula used to obtain them. One popular example is Mersenne primes, which are obtained by the formula 2n - 1 where n is a prime number; however, the formula does not always necessarily produce a prime, and there are only 47 known Mersenne primes, the most recently discovered one having 12,837,064 digits. It is well known and easily proved that there are infinitely many primes out there; however, what mathematicians struggle with is the infinity, or lack thereof, of certain types of primes, like the Mersenne prime. In 1849, a mathematician named de Polignac conjectures that there might be infinitely many primes where p is a prime, and p + 2 is also a prime. Prime numbers of this form are known as twin primes. Because of the generality if this statement, it should be provable; however, mathematicians continue to chase its certainty. Some derivative conjectures, such as the Hardy-Littlewood conjecture, have offered a bit of progress in the pursuit of a solution, but no definitive answers have arisen so far.

Picture 32. Odd Perfect Numbers

Perfect numbers, discovered by the Euclid of Greece and his brotherhood of mathematicians, have a certain satisfying unity. A perfect number is defined as a positive integer that is the sum of its positive divisors; that is to say, if you add up all the numbers that divide a number, you get that number back. One example would be the number28— it is divisible by 1, 2, 4, 7, and 14, and 1 + 2 + 4 + 7 + 14 = 28. In the 18th century, Euler proved that the formula 2(n-1)(2n-1) gives all even perfect numbers. The question remains, though, whether there exist any odd perfect numbers. A couple of conclusions have been drawn about odd perfect numbers, if they do exist; for example, an odd perfect number would not be divisible by 105, its number of divisors must be odd, it would have to be of the form 12m + 1 or 36m + 9, and so on. After over two thousand years, mathematicians still struggle to pin down the odd perfect number, but seem to still be quite far from doing so.

twitterbanner.jpg

nextArticle.image_alt|e
iStock
arrow
fun
See If You Can Solve This Tricky Coin-Flipping Riddle
iStock
iStock

Make sure your head is in working order before trying to solve this riddle from TED-Ed, because it's a stumper.

Here's the scenario: You're an explorer who's just stumbled upon a trove of valuable coins in a remote dungeon. Each coin has a gold side and a silver side, each with an identical scorpion seal. The wizard who guards the coins agrees to let you have them, but he won't let you leave the room unless you separate the hoard into two piles with an equal number of coins with the silver side facing up in each. You've just counted the total number of silver-side-up coins—20—when the lights go out. In the dark, you have no way of knowing which half of a coin is silver and which half is gold. How do you divide the pile without looking at it?

As TED-Ed explains, the task is fairly easy to complete, no psychic powers required. All you need to do is remove any 20 coins from the pile at random and flip them over. No matter what combination of coins you choose, you will suddenly have a number of silver-side-up coins that's equal to whatever is left in the pile. If every coin you pulled was originally gold-side-up, flipping them would give you 20 more silver-side-up coins. If you chose 13 gold-side-up coins and seven of the silver-side coins, you'd be left with 13 silver coins in the first pile and 13 silver ones in your new stack after flipping it over.

The solution is simple, but the algebra behind it may take a little more effort to comprehend. For the full explanation and a bonus riddle, check out the video from TED-Ed below.

[h/t TED-Ed]

nextArticle.image_alt|e
iStock
arrow
fun
No One Can Figure Out This Second Grade Math Problem
iStock
iStock

Angie Werner got a lot more than she bargained for on January 24, when she sat down to help her 8-year-old daughter, Ayla, with her math homework. As Pop Sugar reports, the confusion began when they got to the following word problem:

“There are 49 dogs signed up to compete in the dog show. There are 36 more small dogs than large dogs signed up to compete. How many small dogs are signed up to compete?”

Many people misread the problem and thought it was a trick question: if there are 36 more small dogs and the question is how many small dogs are competing, then maybe the answer is 36?

Wrong!

Frustrated by the confusing problem, Angie took to a private Facebook group to ask fellow moms to weigh in on the question, which led to even more confusion, including whether medium-sized dogs should somehow be accounted for. (No, they shouldn’t.) Another mom chimed in with an answer that she thought settled the debate:

"Y'all. A mom above figured it out. We were all wrong. If there is a total of 49 dogs and 36 of them are small dogs then there are 13 large dogs. That means 36 small dogs subtracted by 13 large dogs then there are 23 more small dogs than large dogs. 36-13=23. BOOM!!! WOW! Anyone saying there's half and medium dogs tho just no!"

It was a nice try, but incorrect. A few others came up with 42.5 dogs as the answer, with one woman explaining her method as follows: "49-36=13. 13/2=6.5. 36+6.5=42.5. That's how I did it in my head. Is that the right way to do it? Lol I haven't done math like this since I was in school!"

Though commenters understandably took issue with the .5 part of the answer—an 8-year-old is expected to calculate for a half-dog? What kind of dog show is this?—when Ayla’s teacher heard about the growing debate, she chimed in to confirm that 42.5 is indeed the answer, but that the blame in the confusion rested with the school. "The district worded it wrong,” said Angie. “The answer would be 42.5, though, if done at an age appropriate grade."

Want to try another internet-baffling riddle?


Here's the answer.

[h/t: Pop Sugar]

SECTIONS

arrow
LIVE SMARTER
More from mental floss studios