[Infinite Primes] Euclid's Proof of Infinite Primes - Classic and Simple

preview_player
Показать описание
We present today Euclid's proof that there are infinitely many primes. This is a classic and beautiful proof in number theory that we hope you'll enjoy.

P.S. Apologies for the reupload - a commenter spotted an error in the previous version. We also decided to revise our colour scheme and formatting.
Рекомендации по теме
Комментарии
Автор

It is simpler to say that the list of primes is endless because the lowest factor greater than 1 of p!+1 must be a prime number and must be greater than p.
This is not actually a 'proof by contradiction'.

apusapus