Abstract
We discuss mechanised proofs of Fermat's Little Theorem in a variety of styles, focusing in par-ticular on an elegant combinatorial "necklace" proof that has not been mechanised previously. What is elegant in prose turns out to be long-winded mechanically, and so we examine the effect of explicitly appealing to group theory. This has pleasant consequences both for the necklace proof, and also for some of the direct number-theoretic approaches.
| Original language | English |
|---|---|
| Pages (from-to) | 63-87 |
| Number of pages | 25 |
| Journal | Journal of Formalized Reasoning |
| Volume | 6 |
| Issue number | 1 |
| Publication status | Published - 2013 |