Mathematics in Action

On Wednesday 25th November 2015 I took 13 sixth form students from my school to the Mathematics in Action event organised by The Training Partnership. It was an excellent day out and I summarised some of my notes from the day’s lectures in a post for my students which is replicated below.

Host (Tom Evans)

The host of the day was Tom Evans. He opened up the session with two puzzling questions which the audience were asked to attempt during the breaks between speakers. The problems are below:

host qs

Happy birthday Fermat’s last theorem (Simon Singh)

The opener was Simon Singh talking about Andrew Wiles and Fermat’s last theorem. He opened up the talk with the start of the BBC Horizon episode (see here) he directed on the same topic. In the video Andrew Wiles expresses an analogy for mathematics whereby it can, for a time, feel like you are walking around a dark house stumbling into things all the time. Then, one day, the light switches on and suddenly you see. Wiles becomes very emotional when talking about Fermat’s last theorem, which as Simon explained in his talk is due to the sheer length of time and determination spent solving a problem which had become a childhood dream.

Simon gave us the problem and spent a large part of his talk discussing the back story and some of the people who tried to provide a proof for Fermat’s last theorem across some 300 years. He recommended purchasing his book for further reading (which I did!). If you are wondering the theorem states the following:

No three positive integers x, y and z can satisfy the equation x^n+y^n=z^n for any integer value of n greater than two.

There were also recommendations at the end, for further enriching mathematics, to take a look at Numberphile, Vi Hart and Martin Gardner. Do take a look at all if you haven’t yet!

How big is infinity? (Chris Good)

Chris focused a large part of his talk on infinity around the work of Georg Cantor. He opened the talk by asking a classic question; ‘Which is bigger 1 or 0.99999999999…?’ He used this to clarify that every number between 0 and 1 can be represented as a unique non-terminating decimal (due to one-to-one correspondence) which was introduced by Cantor first in 1874. As a result of much of Cantor’s work there was an implication that there are an infinite number of infinities (i.e. I can always choose a bigger infinity than the one you just chose!). Chris concluded his talk by discussing transcendental numbers.

Exam technique (optional session with Colin Beveridge)

exam tech.png

I really liked the Venn diagram Colin used at the beginning of his short talk about exam technique to describe the ‘ideal’ experience maths A level students should have (i.e. extended subject knowledge and support with exam technique). One of the things I really liked, and have already used, is the ‘error log’ idea. This is where pupils are asked to write down their mistakes, take note of where they went wrong or got stuck and then include the steps they need/needed to take to rectify the problem. Colin had some really valuable things to say so I am glad I stayed to listen to this (even if my students didn’t!).

7 things you need to know about prime numbers (Vicky Neale)

Fact 1: 1 is not a prime number.

Fact 2: 2 is a prime number (and the only even prime!).

Fact 3: (Theorem) There are infinitely many prime numbers.

This was proved by both Euclid (c.300BC) and Euler (18th century). This theorem of the week blog post gives some detail on both.

Fact 4: (Fundamental theorem of arithmetic) Every integer greater than 1 can be expressed as a product of primes in an essentially unique way.

Fact 5: Every prime is one more or one less than a multiple of six if p>3.

Therefore, could you prove the following statement (imagine delivering your explanation to a year 9 student)?

If p is a prime number greater than 3, then p is of the form 6n \pm 1, where n is a natural number.

Fact 6: Let \pi(x) denote the number of primes less than or equal to x. For example, \pi(10)=4 or \pi(100)=25.

(Prime number theorem) Then \pi(x) \sim \frac{x}{\log{x}} where here \log{x} is the number theory notation for \ln{x}.

Fact 7: (Twin prime conjecture) There are infinitely many primes p such that p+2 is also prime.

This conjecture is yet to be proved, but there have been many recent developments!

Exit question:

If 3 and 5 are twin primes then let us call 3, 5 and 7 a prime triple. Are there any more prime triples?

Geometry and the art of optimisation (Richard Elwes)

Richard opened his talk by discussing how much of his work on optimisation is applicable in everyday life (e.g. traffic lights and train timetabling). He discussed an example of a toy factory where we needed to consider how to maximise the profit from the production line. The calculations made led to the consideration of the feasible set of values which we then needed to consider maximising. Richard then introduced us to the simplex algorithm found by George Dantzig in 1947. He concluded with the Hirsch conjecture to which a counter example was found in 2010.

Cryptography (Keith Martin)

Keith was a very engaging and entertaining speaker, and whilst his talk didn’t contain much ‘maths’ he was able to discuss the importance of cryptography. Some elements of security are ‘lost’ in the cyber world and we need to ensure our information holds its confidentiality, integrity and authentication. Cryptography is a tool used and built by mathematicians to help with encryption and security in cyberspace. Keith discussed ciphers, our data integrity (using ISBN codes as an example) and authentication:

On the internet no one knows if you are a dog.

Keith recommended taking a look at cryptool.org if you are interested in looking further into cryptography. His alternative suggestions were Piper and Murphy’s Introduction to Cryptography book or Simon Singh’s The Code Book.