Thread: Prime number thing that I don't understand?

1. I noticed that:

Where n is a natural number, p is prime and p > n.

And to clarify on my notation using the modulus operator, I mean the remainder from dividing into for example:

Could anyone shed a bit of light on why this seems to be the case? Also! I don't know this to be a fact, I was just playing around with the modulus operator and noticed this.

2.

3. Hi m84uily

That result is known as Fermat's little theorem. You can use it as the basis for a composite number test And that opens a whole Pandora's box of interesting number theory.

4. Originally Posted by river_rat
Hi m84uily

That result is known as Fermat's little theorem. You can use it as the basis for a composite number test And that opens a whole Pandora's box of interesting number theory.
Thanks! The wiki page on proofs will put my mind at ease

 Bookmarks
Bookmarks
 Posting Permissions
 You may not post new threads You may not post replies You may not post attachments You may not edit your posts   BB code is On Smilies are On [IMG] code is On [VIDEO] code is On HTML code is Off Trackbacks are Off Pingbacks are Off Refbacks are On Terms of Use Agreement