Wilson's theorem, in its most complete form, asks for the remainder when (n-1)! is reduced modulo n. Surprisingly, we can completely classify the remainders according to three cases of n: prime, the number 4, and otherwise. We state and prove this classification in this video.
Like, subscribe, and share! To find out more about us:
- Visit https://existsforall.com to check out our services
- Get our Rigorous Elementary Mathematics books on Amazon: https://www.amazon.com/dp/B0DGDNK6TM?binding=paperback
Copyright © Existsforall Academy Inc. All rights reserved.
