20060527, 16:52  #1 
May 2006
7_{8} Posts 
Re New test for Mersenne Primes
I wrote a basic program that tests for Mersenne primes based on my thread "Is This of any Merit" but havn't done the task of enhancing the speed of the program yet. This program weeded out all Mersenne primes from 3 up through p = 127 correctly and checked up to p = 409 in less than 6 hours.
Starting with all the primes in column 1 of an excel spread sheet the program checks each prime in sequence and prints a one beside each prime only if 2^(p)  1 is prime. I should be able to double the speed by using such techniques as turning off screen display etc, but have to go now. Last fiddled with by K Ramsey on 20060527 at 17:23 
20060528, 04:49  #2 
6809 > 6502
"""""""""""""""""""
Aug 2003
101×103 Posts
2·11·491 Posts 
I fired up Dario's handy Java app. and feed it all odd exponent to 501 and it took it ~2 seconds to check all the numbers for primality.
That is 2^31, 2^51, 2^71,..... 2^4991, 2^5011 I could not find a LL in BASIC, but, I suspect that it would kick some serious speed, FFT & DWT not included. Last fiddled with by Uncwilly on 20060528 at 04:51 
20060528, 11:16  #3  
May 2006
111_{2} Posts 
Quote:
I did improve the speed of my program a bit. It went through primes from 409 through 929 in less than 6.5 hours. I was afraid that it would take much longer so I put the numbers 521 and 607 ahead of 409 on my excel spread sheet last night to see if I didn't mess things up. I for got to remove them further down in the list so the program did these primes twice. About turning the screen update off to speed the program up, this might not applied to Excel 2003 as it was writen for Excel 97. This morning when I turned on my monitor nothing was showing beside 521 or 607 until I hit the escape button to exit the program. I was afraid at first that I screwed up and the program failed until the 1's showed up on the screen after I exited my program. I still have some improvements to make then I will trim down my program and export the module, delete it, and import it back into my workbook to see if that increases my speed. Of course all you experts out there may find this quite amusing. Are there really programs out there that can give the primeness of 2^4423 1 on my Windows XP in less than 7 seconds without being based upon the predetermined fact of it? Last fiddled with by K Ramsey on 20060528 at 11:20 

20060528, 11:52  #4  
Jun 2005
2·7^{2} Posts 
Quote:
PFGW Version 1.2.0 for Windows [FFT v23.8] Primality testing 2^44231 [N+1, BrillhartLehmerSelfridge] Running N+1 test using discriminant 3, base 1+sqrt(3) 2^44231 is prime! (0.1584s+0.0022s) And 7 Seconds PFGW Version 1.2.0 for Windows [FFT v23.8] Primality testing 2^232091 [N+1, BrillhartLehmerSelfridge] Running N+1 test using discriminant 3, base 1+sqrt(3) 2^232091 is prime! (7.0036s+0.0025s) Done. Last fiddled with by AntonVrba on 20060528 at 12:00 

20060528, 13:04  #5  
May 2006
7_{8} Posts 
Quote:
Also since my test gives correct results for the first 162 primes excluding p=2 since 3 is a special case. Is it possible to use my conjecture and the other conjectures in this forum to give even quicker results? 

20060528, 14:36  #6  
Aug 2005
Brazil
2·181 Posts 
Quote:
The program is opensource 

20060604, 09:45  #7 
May 2006
29_{10} Posts 
mersenne primes
Sorry, your technique will never work within a reasonable span of time.
If you look on Fermat's small theorem and know more about possible primes, you can easily find Mersenne possible primes (which embrace real MP's and Mersenne "products") Y.s. 
Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Mersenne Primes p which are in a set of twin primes is finite?  carpetpool  Miscellaneous Math  4  20220714 02:29 
Distribution of Mersenne primes before and after couples of primes found  emily  Math  34  20170716 18:44 
GaussianMersenne & EisensteinMersenne primes  siegert81  Math  2  20110919 17:36 
A conjecture about Mersenne primes and nonprimes  Unregistered  Information & Answers  0  20110131 15:41 
Mersenne Wiki: Improving the mersenne primes web site by FOSS methods  optim  PrimeNet  13  20040709 13:51 