This was something I kind of just made for fun, but I thought I might as well share it. This project generates a list of every prime number, starting at 2 and very quickly counting up. The program checks every integer in order and determines if the number is prime (Only divisible by itself and 1). If so, it's added to the list. Then it checks the next number (But it skips over any multiples of 2 and 5 because those are never prime, except for 2 and 5 themselves which are). The variable "Number" states which number is being checked. The variable "i" is just used in the code for the purpose of calculating which numbers are prime. Also, the "% Prime" variable states what percent of all numbers checked turned out to be prime, just to add something fun and unique. If you run the project for a while, you'll notice it decreases over time. Music by YOYLECAKE
