There are various method to find prime numbers but not efficient to calculate the large prime integers of 40 digit in fraction of time. Even many system are not supporting more than 11-18 digit integer. I tried to find it through C/C++ and Matlab even I used JAVA using biginteger but I am unable to find this large primes.
Some 40 digits prime integer are available on net and some other prime calculator are there which generates prime integers immediately but those are manual. For my work I need some special prime which are derived from primes, so that i can recheck the derived integer from a prime integer whether a prime or not. So I need a powerful tool or program for generating and checking large prime integer within second of time. If somebody knows please kindly post the solution.
See the "Large Primes" section of the following link:
http://en.wikipedia.org/wiki/Generating_primes
https://github.com/robin48gx/rsa_workbench/blob/master/index.html
If you have a linux computer with `bc' and `lamp' installed you can run this code, which has prime number and co-prime number generators.
try {prime}^{factor}-2 and check initially for primality with a FFT
Here is a `bc' script to do this. `bc' came with Ubuntu 12.04 but has been around on Linux and other unix versions ever since I can remember unix (which is about 1983). This bc script will allow you to find massive primes, just edit it for the max `x' and min`n' ranges you want to find primes in.
As fast as one of the cores of your PC is....
Enjoy....
Thanx Robin....
I will try it in linux system.
My work is to find the special prime from another prime number of 512 bit large. P = 2*p1+1 where p1 must be a prime.
@Robin: By initializing i with the first odd number within the given range of n to x in for (i = n; i
- Badges
- Science topic