In my previous post I mentioned *Fermat’s Little Theorem*, a beautiful, fundamental result in number theory that underlies lots of things like public-key cryptography and primality testing. 611 more words

## Tags » Theorem

#### Four formats for Fermat

#### Weekly Reflective Response 3 - 10/1/17

This week, I learned how to measure evolution. I learned two equations in order to do this: p+q=1 and p^2+2pq+q^2=1.

I learned that populations evolve, not individuals. 540 more words

#### New baby, and primality testing

I have neglected writing on this blog for a while, and here is why:

Yes, there is a new small human in my house! So I won’t be writing here regularly for the near future, but do hope to still write occasionally as the mood and opportunity strikes. 184 more words

#### Ramsey's Theorem

Ramsey’s theorem is a fundamental theorem in combinatorial mathematics, and initiated the combinatorial theory called * Ramsey Theory*. This theory aims to seek regularity in disorder: “ 296 more words

#### Last Digit

How would we go about finding the last digit of very * large* numbers, such as ?

There are a variety of different tools that we can use, including modular arithmetic and the Chinese remainder theorem, which I am going to talk about in today’s post. 538 more words

#### Noether's Theorem

Today I thought I’d write a blog post about an interesting theorem I learnt whilst studying my **Variational Principles **module – Noether’s Theorem.

To understand Noether’s Theorem, we must first understand what is meant by a 342 more words

#### MATHS BITE: Shoelace Theorem

The Shoelace theorem is a useful formula for finding the area of a polygon when we know the coordinates of its vertices. The formula was described by Meister in 1769, and then by Gauss in 1795. 154 more words