(04-21-2023, 01:04 AM)eoredson Wrote:(04-21-2023, 12:50 AM)Jack Wrote: @eoredson
the formula is correct, but 6 primes is the maximum that you are able to compute using double, with higher precision you could calculate more primes but it gets exponentially slow
So, could you extend your program to _unsigned _integer64 for higher values? I tried to change Double to _Float with no result..
64-bit integer has at least 18 places of precision, maybe 19 and it depends on it being positive or negative. Each decimal place takes away from how large the number could be. However when computing primes there shouldn't be a need for fractions, or am I wrong?
(That depends on how CURRENCY type was treated by M$ BASIC PDS v7.1 which was actually 32-bit integer.)
https://qb64phoenix.com/qb64wiki/index.php/INTEGER64
The code that Jack showed a short time ago has a number 2^100 that will have to be represented by "string math". So not as much it will "take forever", but QB64(PE) doesn't have any numeric data type at the moment to represent such a value. LOL maybe that's why he said something about "bignum" ...