A short sneak preview of the full-length ‘Mandelbulbs’ video currently in production. A Koch Snowflake is an example of a 2D fractal with infinite perimeter but finite area. Full details of the calculation in the final video… COMING SOON!
Mathematician Thomas Hales explains the Honeycomb Conjecture in the context of bees. Hales proved that the hexagon tiling (hexagonal honeycomb) is the most efficient way to maximise area whilst minimising perimeter.
Produced by Tom Rocks Maths intern Joe Double, with assistance from Tom Crawford. Thanks to the Oxford University Society East Kent Branch for funding the placement and to the Isaac Newton Institute for arranging the interview.
The author H. P. Lovecraft often described his fictional alien worlds as having ‘Non-Euclidean Geometry’, but what exactly is this? And would it really break our brains?
Produced by Tom Rocks Maths intern Joe Double, with assistance from Tom Crawford. Thanks to the Oxford University Society East Kent Branch for funding the placement.
Often in Mathematics problems that are easy to state turn out to be extremely difficult to solve. Two hundred and seventy-five years ago, Goldbach wrote a letter to the famous Swiss mathematician Leonhard Euler in which he wrote the simple statement:
“Every even integer greater than 2 can be expressed as the sum of two primes.”
Just in case you are not up to speed with your maths (and let’s face it why would you be if you’re not a mathematician), let’s break this statement down. The even integers are the numbers divisible by two: 2, 4, 6, 8, …, 256, … and so on. The prime numbers are the ones that can only be obtained by multiplying one by themselves. For example, 3 and 5 are prime numbers because 3=1×3 and 5=1×5 and they have no other representations as a product of two numbers. However, 6 for instance is not prime because 6=1×6=2×3. In fact, all even integers, greater than 2 that were mentioned above, are not primes because they are all divisible by 2 and therefore can be represented as a product of two numbers in at least two ways: 4=1×4=2×2, 6=1×6=2×3, 8=1×8=2×4 etc.
And so, to Goldbach’s conjecture. It says that all even numbers: 4, 6, 8, 10, … can be written as a sum of two primes. Let’s see a couple of examples:
A nice way to represent the conjecture visually is through a “pyramid” and because we all love pretty pictures let’s see how this magic happens.
First, we write all of the prime numbers on two of the sides of a triangle as below: 2, 3, 5, 7 etc. We then draw a line leaving each prime number which is parallel to the opposite side of the triangle (stick with me), and finally at the points of intersection of these lines, we write the sum of the numbers. It sounds more complicated than it is as you’ll see with the following example. In the picture below, take the blue line coming out of the number 7 on the left and the red line coming out from the number 11 on the right. They intersect at 18 because 11+7=18. This means that the even integer 18 can be represented as a sum of the two prime numbers 11 and 7. If you look at the intersections of all of the red and blue lines in the pyramid, you’ll see that we actually get all of the even numbers. In other words, any even integer can be written as the sum of two prime numbers, and we can see what those two numbers are by finding the corresponding intersection on our diagram. This is Goldbach’s Conjecture.
It is not very difficult to show that a small even number greater than 2 is the sum of two prime numbers – either by finding the corresponding point on the picture or by trying all of the possibilities. Let’s take 96. We start by checking the smallest prime number 3. 96=3+93, but 93 is not a prime, because 93=1×93=3×31. We continue with the next prime – 5. 96=5+91, which again doesn’t work because 91=1×91=7×13. Next, we try with 7: 96=7+89. Since 89 is a prime, we have obtained a representation of the number 96 as a sum of two primes.
We were able to quickly check whether 96 satisfies Goldbach’s conjecture because the number is relatively small. It becomes much harder to make these checks for larger numbers. It’s been verified with the use of a computer that the conjecture is true for numbers as big as 4×1018 and this is why the conjecture is believed to be true, but we do not yet have a formal mathematical proof. And being mathematicians, we cannot say something is true until we can prove it.
There have of course been many efforts over the last 275 years to try to prove the conjecture, most of which followed one of two routes. Either by proving that all even integers can be represented as a sum of some number of primes – as a sum of 6 primes (1995, Ramare) and as a sum of 4 primes (Herald Helfgott) – or by proving that almost all even integers can be written as a sum of 2 primes. But, as of yet, the secret formula required to unlock the proof of Goldbach’s Conjecture remains elusive.
You may be wondering why on earth mathematicians are spending their time and effort to prove this seemingly random result about prime numbers? Is it really that important? Whilst you may have a valid point about the applications of this particular conjecture, the value in proving such a result is not in the statement itself, but rather in the new methods, theories and techniques that will need to be developed to solve the problem. So, in 20, 10 or even 2 years from now when you hear that Goldbach’s conjecture has been proved, you should be happy not because we now know for sure that it’s true, but rather because some incredible new area of mathematics has been developed in the process. And who knows, this new area of maths may even pose a new, even more complicated conjecture that will occupy mathematicians for the next 275 years…