Today we use Python to identify prime numbers. This is important in cryptography and number theory. While it’s simple to make the function work, it’s hard to make it FAST. We’ll profile the function and look at several ways to improve the speed of our algorithm.
Our Patrons on Patreon help us make our videos! We’d like to recognize our VIP Patron Vishal Shah whose generosity has made such a big difference for our channel. Thank you, Vishal!
To learn Python, you can watch our playlist from the beginning:
If you’d like a reference book, we recommend “Python Cookbook, 3rd Edition” from O’Reilly:
The Mythical Man Month – Essays on Software Engineering & Project Management
To help us make videos more quickly, you can support Socratica at:
We also accept Bitcoin! 🙂
Our address is: 1EttYyGwJmpy9bLY2UcmEqMJuBfaZ1HdG9
You can also follow Socratica on:
- Twitter: @socratica
- Instagram: @SocraticaStudios
- Facebook: @SocraticaStudios
Python instructor: Ulka Simone Mohanty (@ulkam on Twitter)
Written & Produced by Michael Harrison (@mlh496 on Twitter)