Algebraic Number Theory 1.1: The Gaussian Integers and a Very Cool Property of the Primes

I use Fermat’s two square theorem to motivate the idea of the Gaussian integers and prove that they are a Euclidean ring. Enjoy 😉

[gregoriousmaths]

1:43 *the squares are congruent to 1 or 0 mod 4 not the primes and at 6:58 I obviously mean at most

[NiRvanA____]

Nice, though the light could have been nicer.

[NikolajKuntner]

I like the topic.
Also _obligatory comment about unreadable writing_

[nandagirish]

At 1:43 u said all primes r congruent to 1 or 0 mod 4 however that doesnt make sense as if they were congruent to 0 mod 4 they would be divisible by 4 and therefore not prime.