Use this to find prime numbers. The program will stop when it reaches a number greater than the one you enter. It works via the Sieve of Eratosthenes method. This is my first project in a while, so sorry if it's buggy. I need to add more graphics to my projects...
