20100304, 21:42  #1 
"Forget I exist"
Jul 2009
Dumbassville
2^{6}×131 Posts 
LucasLehmer test proof etc.
First if possible I'd like a link to PARI ( suggested last time I posted on here) I've reformatted since then I don't see how to install it! I was looking about the proof of the Lucas Lehmer test and I know it proves that the s values that show primality are all multiples of the prime they prove ( or I think it was that). This got me thinking to figure out what multiplies by the primes to get these results and I came across 607 another prime Mersenne exponent. I was going to suggest it might be a way to find higher Mersenne exponents ( not a good idea on here) but can anyone help verify at least that all the other results of the divisions are prime ? maybe then I'll see if I can find a proof of Mersenne Prime exponents in them all.
Last fiddled with by science_man_88 on 20100304 at 21:43 
20100304, 21:48  #2 
Mar 2010
Brick, NJ
1000011_{2} Posts 
All of the results of ?

20100304, 21:52  #3 
"Forget I exist"
Jul 2009
Dumbassville
8384_{10} Posts 
the results like 14/(7*2) and s(3)/(31*2) where s is it's value in the lehmer test. I'm multiplying by 2 on bottom as I find that the results I see so far divide by 2 at least
Last fiddled with by science_man_88 on 20100304 at 21:53 
20100304, 23:08  #4 
Mar 2010
Brick, NJ
103_{8} Posts 
Ok..
Not sure where you are going.. but
MP2  4/ (3 * 2) = 0 MP3  14/ (7 * 2) = 1 S(2) = 14 MP5  62/ (31 * 2) = 1 S(2) = 14 S(3) = 194 S(4) = 62 MP7  12319/ (127 * 2) = 48 S(2) = 14 S(3) = 194 S(4) = 4487 S(5) = 1762 S(6) = 12319 MP11  79522/ (2047 * 2) = 19 S(2) = 14 S(3) = 194 S(4) = 37634 S(5) = 620942 S(6) = 491399 S(7) = 14159 S(8) = 3523127 S(9) = 57598 S(10) = 79522 You do realize that that last s should be MOD MP and = 0 when MP is prime... but the rest of prime P < 64 see... http://dotnetmath.alexanderhiggins.c...jecture_a.aspx 
20100304, 23:38  #5 
"Forget I exist"
Jul 2009
Dumbassville
2^{6}×131 Posts 
not exactly where I wanted to go I was going more for:
http://www.research.att.com/~njas/sequences/A003010 when divided by the proper id:A000668 seems when divided by 2 to give a prime(asking for verification of that) (in fact one I tried gave 607(a mersenne prime exponent)) Last fiddled with by science_man_88 on 20100304 at 23:39 
20100304, 23:47  #6  
"Forget I exist"
Jul 2009
Dumbassville
20300_{8} Posts 
Quote:
Last fiddled with by science_man_88 on 20100304 at 23:48 

20100304, 23:49  #7 
"Forget I exist"
Jul 2009
Dumbassville
10000011000000_{2} Posts 
I know mini geek is just waiting to get someone to delete this lol

20100304, 23:50  #8  
Account Deleted
"Tim Sorbera"
Aug 2006
San Antonio, TX USA
17×251 Posts 
Quote:
Now why would I want that? As long as it's kept to the Misc Math forum, I'm fine with it. Sometimes I even find these threads amusing (in a way). Last fiddled with by MiniGeek on 20100304 at 23:51 

20100304, 23:52  #9 
"Forget I exist"
Jul 2009
Dumbassville
2^{6}·131 Posts 
Do You get what I'm talking about MiniGeek ?

20100304, 23:57  #10 
"Forget I exist"
Jul 2009
Dumbassville
20300_{8} Posts 
mini geek also if you look he went from 2 to p1 most times

20100305, 00:07  #11 
"Forget I exist"
Jul 2009
Dumbassville
20300_{8} Posts 
14/7 = 2 2/2=1
37634/31=1214 1214/2 = 607 < prime exponent 2005956546822746114/127 = 15794933439549182 that / 2 = 7897466719774591< possible prime exponent ? basically I'm trying to find a way to use http://www.research.att.com/~njas/sequences/A003010 to find something useful ( such as exponents that work) 
Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Modifying the Lucas Lehmer Primality Test into a fast test of nothing  Trilo  Miscellaneous Math  25  20180311 23:20 
A second proof for the LucasLehmer Test  carpetpool  Miscellaneous Math  2  20170730 09:21 
proof the lucas lehmer test  kurtulmehtap  Math  13  20091002 12:12 
LucasLehmer Test  storm5510  Math  22  20090924 22:32 
LucasLehmer Test proof  alpertron  mersennewiki  16  20060318 07:23 