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.
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.