i need a fast method to find if a number is prime. the number is alway more than 5 and less than 100000000
i have tried the sieve of Eratosthenes, but it sometimes runs into a memory stack overflow error.