Fermat on Pythagorean Theorem
100255
If a prime divides the hypotenuse of a primitive Pythagorean triple, then $p \equiv 1$ (mod 4)
21629
Using Fermat's Little Theorem Prove if $p$ is prime, prove $1^p + 2^p + 3^p +...+(p-1)^p \equiv 0 \bmod{p}$
113481
Modular Arithmetic - Find the Square Root
25034
Fermat numbers are coprime
42885
Fermat primes relation to $2^n+1$
20574
Understanding the proof for $\gcd (F_n, F_{n+k}) = 1$ where $F_n$ is a Fermat number
112390
Solutions of $x^2 \equiv 1 \pmod N$
44033
Number theory lemma - $x^2 \equiv 1 \pmod p$ implies $x\equiv\pm 1\pmod p$
68233
Fermat's little theorem's proof for a negative integer
39276
Ground Plan - Prove Fermat-Euclid's Totient Theorem with Lagrange's Theorem
84334
How to prove the Pythagoras theorem using vectors
155812
A Fermat's FLT look-like for matrices.
128634
Doubt related to a theorem in congruences of Chapter 5 of Apostol Introduction to analytic number theory
95653
Euler's theorem: [3]^2014^2014 mod 98
15003
Pythagorean Quadruples:
136894
Reference request: Clean proof of Fermat's last theorem for $n=3$.
130300
Proof that every quadratic residue has two roots, modulo a prime