I am dealing with arbitrary length pseudo-random numbers as a finishing
project for a masters degree. I have nearly finished that part.
Then using GAP, I wrote some routines that read from the file (which
consists of pseudo random numbers) and finds the nearest prime. I read
"integer.gi" library package. I wrote some basic routines - such as
Rabin-Miller, Lehman... I have extended the Primes list and added some
routines to speed up (well I expect some speed up :) ) the operation.
I would like to know if anyone here dealt with prime numbers before.
Anyone willing to mail about this subject is wellcome.
e-mail : firstname.lastname@example.org