2017-04-15, 18:52 | #397 |
"Forget I exist"
Jul 2009
Dumbassville
2^{6}×131 Posts |
sorry waking up an old thread I realized that I could find more information to help me make the LL test simpler potentially on this forum itself ( not this subforum in particular but mersenne forums). We can already prove that if doing the LL test with the modification mod p instead for mod 2^p-1 our answer is dependent on the other factor to multiply to s_(n-2) mod p I just realized there's a post that talks about the form this value must take and so I can now say it depends on 2*k+1 or 2*k-1 mod p for the k involved. the hard part now is determining this k value for any p value and then doing the modular math. edit: doh realized the a values i talked about are always even but we could factor out the powers of two out it and use that.
Last fiddled with by science_man_88 on 2017-04-15 at 19:02 |
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 | 3 | 2017-08-10 13:47 |
Distribution of Mersenne primes before and after couples of primes found | emily | Math | 34 | 2017-07-16 18:44 |
Mersenne primes and class field theory | Nick | Math | 4 | 2017-04-01 16:26 |
Basic Number Theory 11: Gaussian primes | Nick | Number Theory Discussion Group | 0 | 2016-12-03 11:42 |
Mersenne Wiki: Improving the mersenne primes web site by FOSS methods | optim | PrimeNet | 13 | 2004-07-09 13:51 |