I tried many times to get help from many people but no one wants to answer me.

## math for fun

To see this working, head to your live site.

# I cannot prove that: If P is a prime number, and Q < P (or Q is not a multiple of P), then Q^(P-1) -1 must be a multiple of P.

I cannot prove that: If P is a prime number, and Q < P (or Q is not a multiple of P), then Q^(P-1) -1 must be a multiple of P.

1 answer1 reply

0

2 Comments

Hello....If I Am not wrong... This is Fermat's little theorem...isn't it?