To participate search

• email me, Marian Otremba, at "chroma65tella(at)12gmail(dot)com31 (remove numeric characters)" and reserve a type and range
  
• confirm me receiving letter with permission
• download mfsieve (win 64) or extract mfsieve from mtsieve (win 64 with/without GPU only win10!)
  
• use mfsieve to sieve a range of n (to eliminate those with small factors)
           mfsieve.exe  -W'numer of thread'  -P1E9 -m'k number of multi (n!k)'  -n'from n'  -N'to n'  -o  'output file'
   e.g.  mfsieve.exe  -W5  -P1E9  -m20  -n100000  -N200000  -o mfp-20.txt
  
• use pfgw to find prps and prove primality
• Submit your prime to Chris Caldwell's The Prime Pages if big enough (Currently over 424,500 digits) 
• Send me the Brillhart-Lehmer-Selfridge proof of primality output from pfgw
• I will add the (digits:nnnnn) and incorporate the data into the site