
Prove that there are infinitely many prime numbers.
Hint: Start by supposing that there are finitely many prime numbers and show that this leads to a contradiction. This type of proof is called reductio ad absurdum.
If you have questions/comments, please send e-mail to mathhelp@saxonpublishers.com.
[ Return to Saxon Math Stumpers Area ]