The number ((p-1)!(bmod p)) came up in our proof of Fermat's Little Theorem, although we didn't need

Question:

The number \((p-1)!(\bmod p)\) came up in our proof of Fermat's Little Theorem, although we didn't need to find it. Calculate \((p-1)!(\bmod p)\) for some small prime numbers \(p\). Find a pattern and make a conjecture. Prove your conjecture!

Fantastic news! We've Found the answer you've been seeking!

Step by Step Answer:

Related Book For  book-img-for-question
Question Posted: