20040727, 16:06  #1 
Apr 2004
Blacksburg, VA
9_{16} Posts 
Misc Questions
I have a few basic questions I would appreciate any info on.
Are there fast parallel implementations of the GIMPS (LL Test) algorithm? Once a Mersenne Prime is found by a regular machine running Prime95, how is it verified quickly? What are the uses for Mersenne Primes? I've heard they can be used in psuedorandom number generators. Are there any other uses? Thanks in advance! Nevarcds 
20040727, 20:56  #2 
6809 > 6502
"""""""""""""""""""
Aug 2003
101×103 Posts
5×1,913 Posts 
There are some multithreaded implementations of LL. And since these can run on multiprocessor systems they can run faster than Prime95. Running on a single processor, though, nothing beats Prime95 for squeezing every last bit of speed out of each MHz.

20040728, 10:09  #3  
Sep 2002
Oeiras, Portugal
2663_{8} Posts 
Quote:


20040728, 13:29  #4  
Sep 2003
Borg HQ, Delta Quadrant
1276_{8} Posts 
Quote:


Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Misc. sequences  gd_barnes  Aliquot Sequences  15  20090930 23:40 
misc. k<300 statuses and primes  gd_barnes  No Prime Left Behind  37  20090914 15:09 
Misc. reserves/statuses/primes for k>2000 & k=1003  gd_barnes  No Prime Left Behind  113  20090730 22:32 
gmpecm questions  yoyo  GMPECM  34  20090320 18:06 
Some questions...  OmbooHankvald  PSearch  3  20050917 19:29 