Euclid's proof of infinitely many primes
Last updated: 15/11/2023
Contributor: Sally Curtis

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.
All reviews
There are no reviews yet. Have you used this resource?Review this resource