Wilson Theorem.

Let p be an odd prime.
Then (p-1)! is congruent to -1 mod p.

To see a proof for a particular case of Wilson Theorem, fill in the required data and press the button.

Euler Theorem01.

Let p be an odd prime.
Let D be an integer not divisible by p.
Then D is a quadratic residue mod p or D^((p-1)/2) is congruent to -1 mod p.

To see a proof for a particular case of Euler Theorem01, fill in the required data and press the button.

Quadratic Reciprocity Theorem01.

Let p be an odd prime.
If p is congruent to 1 mod 4 then -1 is a quadratic residue mod p.

To see a proof for a particular case of Quadratic Reciprocity Theorem01, fill in the required data and press the button.

Fermat Theorem01.

Let p be an odd prime.
If p is congruent to 1 mod 4 then p can be expressed as the sum of two squares.

To see a proof for a particular case of Fermat Theorem01, fill in the required data and press the button.

This page is hosted by Get your own Free Home Page