I need to work out if a massive integer (I mean 20 digits...) is prime.
I'm trying to use the brute-force method, but (of course) I need to use doubles to contain the original number. However, the modulo operator (%) is an integer operator - thus it is useless to me!
Any help would be greatly appreciated, tf.