Find prime numbers. https://turbowarp.org/781598216
This has a time complexity of O(n^1.5). Using Euler's sieve can achieve O(n), and even more complex algorithms can do better.
