Wilson's Theorem and It's Geometric proof

Concept useful for I.S.I B.Stat B.Math Entrance, CMI Entrance and Math Olympiad.
In this video we have tried to show you how you can proof Wilson's Theorem, which is very powerful in #NumberTheory . It is indeed a powerful weapon to hunt primes. Here you will see a proof of this based on some geometry and combinatories.

Watch the playlist on ISI & CMI Entrance:-

Follow us at:

Facebook:-

Instagram:-

Linkedin:-

Happy learning!

[TechToppers]

This is more of combinatorial proof!
As factorials often appear in Combinatorics and this counting too...

[Abhisruta]

Very good video and conceptualisation with animation...

[mohammedhafiz]

On cheenta.com where to put a phone number is not working btw

[Stelios]

First of all, nice video. Now I would like to point out some parts that need more explanation.

1. At the end you divide the difference by p, but you need to explain why this is true by circular symmetry. This means that you need to explain why a rotated polygon still "steps" on the taken vertices.

2. You also say that we always get a regular polygon when we skip the same number of points in each step. However, explanation is needed here.

3. Finally, you demonstrate, through an example, that the number of vertices cannot be complex. Still, this doesn't show why the proof works for a prime.

In all cases what you say is true only for a prime number of vertices. This follows from the fact that each p-th root of unity is a generator of their multiplicative group.

Hope this helps your work.