Optimising the square sieve
Channel: Ben Peters Jones
Date: 2021-08-26

In a previous video I created a prime sieve using the difference of two square numbers. In this video I use modular arithmetic to optimise the primality test that comes out of the square sieve. I give a worked example of determining if 1189 is a prime number.

This is a bonus video in a series of videos aiming to improve the simple sieve that's at the start of every prime number journey. It probably makes a lot more sense after watching the first video in the series. https://youtu.be/g7DWrO19CNY

If you want a refresher on modular arithmetic, I made a lead in vid into this vid. https://youtu.be/BJrN4zaU4Uc

I'm not a mathematician and there's every chance that something I've said is wrong. If that's the case, please let me know and I'll try to fix it.