Welcome guest
You're not logged in.
181 users online, thereof 0 logged in

Congruences Involving Prime Numbers

In this chapter, we will prove theorems which characterize prime numbers, in particular the Fermat’s little theorem, as well as the Wilson’s theorem.

| | | | created: 2019-05-12 09:15:43 | modified: 2019-05-12 09:16:04 | by: bookofproofs

1.Theorem: Fermat's Little Theorem

2.Proposition: A Necessary Condition for an Integer to be Prime

3.Proposition: A Necessary and Sufficient Condition for an Integer to be Prime


This work was contributed under CC BY-SA 3.0 by:

This work is a derivative of:

(none)

Bibliography (further reading)

(none)
FeedsAcknowledgmentsTerms of UsePrivacy PolicyImprint
© 2018 Powered by BooOfProofs, All rights reserved.