Thread Rating:
  • 0 Vote(s) - 0 Average
  • 1
  • 2
  • 3
  • 4
  • 5
A different and better way to find prime numbers
#10
Quote: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.
974277320612072617420666C61696C21 (Hexadecimal for those who don't know)
Reply


Messages In This Thread
A different and better way to find prime numbers - by rpgfan3233 - 09-17-2005, 08:45 PM

Forum Jump:


Users browsing this thread: 1 Guest(s)