alberto
18-06-2019, 20:59
Just to say that Thinbasic is being used for the Largest Known Prime Number. (It will take some time to publish it)
Thinbasic modules works perfect, with numbers of hundreds of millions digits.
Before Thinbasic, calculating new prime numbers could take years, or supercomputer needed.
I use Thinbasic to calculate in seconds if a million digits number is prime or not, and if it is not prime, retrieve its factors in seconds.
Finding and validating very large know prime in Thinbasic is super powerful an easy.
Thank you for creating Thinbasic :D
Alberto
Thinbasic modules works perfect, with numbers of hundreds of millions digits.
Before Thinbasic, calculating new prime numbers could take years, or supercomputer needed.
I use Thinbasic to calculate in seconds if a million digits number is prime or not, and if it is not prime, retrieve its factors in seconds.
Finding and validating very large know prime in Thinbasic is super powerful an easy.
Thank you for creating Thinbasic :D
Alberto