This is a prime number detector that is optimized and accounts for even numbers, 1, and negative values! It does not work for numbers like 3.4823*10^103 due to rounding causing the last digit to be read as 0, which is even so it gets tacked as composite even if the number is prime. It however works for 15485863, which is the 1 millionth prime!
Made with all of my own coding! This works by brute-forcing the number after it passes some checks such as "Is the number even and not 2", or "Is it a Mersenne prime?"
