Skip to main content
Post Made Community Wiki
Source Link
Mark Meckes
  • 11.4k
  • 3
  • 38
  • 69

Fermat's little theorem, which is easy to prove with cyclic groups, can be used to prove that an integer is composite without producing a factorization.