A String of Pearls: Proofs of Fermat's Little Theorem

Journal of Formalized Reasoning

Hing Lun Chan²  Michael Norrish¹ 

[1] NICTA, also Australian National University;Australian National University

关键词: number theory;    automated reasoning;   

DOI  :  

学科分类：计算机科学（综合）

来源: Universita degli Studi di Bologna

【 摘 要 】

We discuss mechanised proofs of Fermat's Little Theorem in a variety of styles, focusing in particular 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.

【 授权许可】

Unknown