Finds a prime larger than any prime input using Euler's proof of infinite primes, seive of Eratosthenes, and some other algorithmic stuff. Shockingly pretty fast up until past 105! ( Ammortized O(log(n!) )
Only the python file works right now. Attempting to optimize it in C, however