I made a series of six videos for SOME1 about #primenumbers and where to find them. In total it runs to about 35 minutes.

https://www.youtube.com/playlist?list=PLhMQ5JG0CnKmfTIpKLAVspEfqhnjRoRVH

The short version is that I've used the difference of two squares to test for primality, set bounds for those squares and then sieve the squares using modularity to infinitely optimise the primality test. I also look at primes in quadratic progression and how that relates to twin primes and Euler's prime generating function and some other stuff.

I'm pretty interested in feedback on my ideas around primes which, from my perspective, are entirely original and true but may bewell established and I just haven't seen it because I can't read maths papers. I'm not great at maths but I'm pretty good with google and I'm yet to find anything close to what I've done.

Please reach out if you watch it and get anything out of it.

#primes #factorisation #twinprimes #quadraticprogression #numbertheory #sieve #SieveOfEratosthenes