Notes on Cambridge Maths

Something looks off?

The button will add this page to my log of things to fix. Use it for broken links, equations not rendering correctly, etc.
Submit other issues on GitHub.

Fermat's Little Theorem

Let be prime.
Let
Then

Proof 1

Binomial Theorem

Proof 2

The number of cyclically distinct necklaces on beads in colours is

and thus

Something looks off?

The button will add this page to my log of things to fix. Use it for broken links, equations not rendering correctly, etc.
Submit other issues on GitHub.

Graph View

Backlinks