A prime number is a number that is only divisible by 1 and itself, for instance 2, 5, 19, or 37. Primes get rarer and rarer the larger they are. There is no known pattern that prime numbers follow, so the only way they can be computed is by testing a lot of numbers. This program finds them pretty efficiently, but it slows down the bigger the tested numbers get. You can make it slightly faster in turbo mode.
This project causes a lot of lag, but that is the sacrifice that I had to make to make it really fast. The largest prime found is the one in the cat’s mouth. Made to help @GCgamesandcartoons He didn’t use it though.
