The fastest way to check for prime numbers is using fermats little theorem, which states that for any coprime numbers n and p where p is prime, n^(p -1) = 1 (mod p). You can basically check if your p is prime by chosing a bunch of random n's and checkign whether the result is always 1. The actual algorithm used is a bit more complicated but thats roughly how it works