Pick a number greater than 1, and watch as the computer generates if it is prime of composite! Extremely Fast However, the bigger the prime number, the longer it takes. It will solve almost any prime number eventually (unless it has more digits than a variable can store). This project is optimized to be extremely fast, and comment if you have any suggestions. This project is dummy proofed as well, complete with an anti word detector. If you have any questions on the code, don't be afraid to ask.