Episode 8: Infinite Primes [#MathChops]

Back in 300 BC, Euclid proved that there were an infinite number of primes. He used line segments to show that some line lengths could only be made up from single-unit line lengths and not lines with lengths of 2, 3, etc. These line lengths represented prime numbers. This proof has the same principle but is a little different than Euclid's and uses proof by contradiction. Take a look at this simple proof which shows that primes are infinite!



Comments

Popular posts from this blog

Some History and Unsolved Problems in Number Theory

Back to School Math Courses Review Guide