From: SrinivasaRao Subramanya <SrinivasaRao.Subramanya@rsise.anu.edu.au>
What is an elegant and compact way to prove (Fermat's little theorem for
natural numbers)
lemma "[|prime p |] ==>(n::nat)^p = n mod p"
in Isabelle. Would appreciate a code snippet
Regards
Srinivas
From: Lawrence Paulson <lp15@cam.ac.uk>
This theorem is proved (for the integers) in src/HOL/NumberTheory/
EulerFermat.thy.
Larry Paulson
Last updated: Nov 21 2024 at 12:39 UTC