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

DOI10.6092/issn.1972-5787/3728zbMath1451.68320OpenAlexW1496340815MaRDI QIDQ5195251

Michael Norrish, Hing-Lun Chan

Publication date: 18 September 2019

Full work available at URL: https://doaj.org/article/c585e2e2e6ae41489a10fcf0369be5b6

zbMATH Keywords

automated reasoningnumber theory

Mathematics Subject Classification ID

Congruences; primitive roots; residue systems (11A07) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)

Related Items (3)

Mechanisation of AKS Algorithm: Part 1 – The Main Theorem ⋮ Border-collision bifurcations from stable fixed points to any number of coexisting chaotic attractors ⋮ Mechanisation of the AKS algorithm

Uses Software

• HOL

Cites Work

• PRIMES is in P
• A Brief Overview of HOL4
• A Coloring Proof of a Generalisation of Fermat's Little Theorem
• A String of Pearls: Proofs of Fermat’s Little Theorem
• Combinatorial Proofs of Fermat's, Lucas's, and Wilson's Theorems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A String of Pearls: Proofs of Fermat's Little Theorem