A different and better way to find prime numbers

[Moneo]

Not quite.
I set up a test with the number DIMed as DOUBLE. When the input number was equal to 2,147,483,647 an overflow error was issued.
*****

Hehe. . . QB gives an example using 19 MOD 6.7 = 5. I assumed DOUBLEs could be used then.

Yes, you can use DOUBLEs, but they can only go up to the limit of a LONG.
*****