Resource thumbnail
Published: 10/06/2019
2 pages

Euclid's proof of infinitely many primes

This resource has been developed for A-Level AQA mathematics but can be used for any board. Students are asked order the steps in a proof of infinitely many prime numbers. The steps use correct mathematical language and notation. It uses proof by contradiction, which is  listed as a proof for students to be familiar with in the AQA specification.


See other resources: Algebra | Number | Number properties – primes | Proof

More resources by this contributor

0 teachers love this resource (0)

Log in to love this resource

Log in to share this resource

We use cookies to deliver functionality and provide you with a better service. By continuing to browse our site you are agreeing to our use of cookies. Find out more.

Don't show this message again.