I've developed a code and method that works in tandem with an earlier prime number algorithm I developed here:
I have used it to determine whether LARGE numbers are prime or not in a fast amount of time along with why its not prime (if it isn't).
I have found in less than three seconds that 192,841,749,213,451,283 is PRIME according to my methods - I am restricted due to Java array size and memory space to 18 significant digits right now.
How can I test whether my results are correct - despite lower numbers being all accurate? I can't find a resource online that will let me test these numbers, given time.