![]() |
![]() |
#1 |
"Forget I exist"
Jul 2009
Dartmouth NS
2×52×132 Posts |
![]()
I was told to post on the forum instead of annoying CRGreathouse. so here I am
basically i wan't to find a way to easily connect certain p values with s in a new way. s2-2 =k*2p-1 (s2-2)/k + 1 = 2p p=log2((s2-2)/k + 1) this works for s(n-1) can we figure out a generalisation for any amount of n change ? if so can we apply it easily and can anyone get the log2() part reduced more ? |
![]() |
![]() |
![]() |
#2 |
Undefined
"The unspeakable one"
Jun 2006
My evil lair
2×3×1,129 Posts |
![]() |
![]() |
![]() |
![]() |
#3 |
Aug 2006
22·3·499 Posts |
![]()
There's an arithmetic error in your post.
I don't understand your goal here. What does "for any amount of n change" mean? What does "get the log2() part reduced more" mean? |
![]() |
![]() |
![]() |
#4 | |
"Forget I exist"
Jul 2009
Dartmouth NS
2×52×132 Posts |
![]() Quote:
sorry log2(2^p) Last fiddled with by science_man_88 on 2010-07-11 at 16:09 |
|
![]() |
![]() |
![]() |
#5 |
"Forget I exist"
Jul 2009
Dartmouth NS
2·52·132 Posts |
![]()
s2-2 =k*(2p-1) =correction
(s2-2)/k =2p-1 ((s2-2)/k)+1 =2p log2(((s2-2)/k)+1) =p Last fiddled with by science_man_88 on 2010-07-11 at 16:15 |
![]() |
![]() |
![]() |
#6 |
"Forget I exist"
Jul 2009
Dartmouth NS
2×52×132 Posts |
![]()
the n change part means for any s within the sequence (so for 2^5-1 instead of using the 5th one in the sequence; n=4 as n=0 for the first; I could try and use a lower number.) the reason a wanted the log2(((s2-2)/k)+1) reduced is to get a lower comparison of s and p. like p*k isn't that big compared with k*2^p-1 same idea in reducing the log.
|
![]() |
![]() |
![]() |
#7 | |
"Forget I exist"
Jul 2009
Dartmouth NS
845010 Posts |
![]() Quote:
|
|
![]() |
![]() |
![]() |
#8 |
"Forget I exist"
Jul 2009
Dartmouth NS
2·52·132 Posts |
![]()
log2(((s^4 - 4*s^2 + 2)/k)+1) = p is the next one up. I can continue this but the equations get longer and without getting a lower fraction to go with it works out to log(Mersenne number(p) +1) which isn't very helpful.
|
![]() |
![]() |
![]() |
Thread Tools | |
![]() |
||||
Thread | Thread Starter | Forum | Replies | Last Post |
Lucas-Lehmer Primes | henryzz | And now for something completely different | 42 | 2019-06-03 14:09 |
Lucas-Lehmer test | Mathsgirl | Information & Answers | 23 | 2014-12-10 16:25 |
lucas-lehmer theorem | Robot2357 | Math | 6 | 2013-06-15 03:10 |
Lucas-Lehmer Test | storm5510 | Math | 22 | 2009-09-24 22:32 |
Lucas-Lehmer | Dougal | Information & Answers | 9 | 2009-02-06 10:25 |