![]() |
![]() |
#1 |
Dec 2008
179 Posts |
![]()
Suppose we have n consecutive primes starting with p; out of these, we would expect n*(some function of p) to divide a Mersenne number with prime exponent. What is known about this function?
|
![]() |
![]() |
![]() |
#2 | |
"Bob Silverman"
Nov 2003
North of Boston
2·33·139 Posts |
![]() Quote:
q = 2p+1 will divide M_p if q is a q.r. of p This happens 1/2 the time. q = 2kp + 1 will divide M_p if q is a '2k'th power residue of p. When and how frequently this happens is determined by Artin's higher reciprocity laws. It is an exercize for a grad student in analytic number theory to estimate the function you seek..... |
|
![]() |
![]() |
![]() |
Thread Tools | |
![]() |
||||
Thread | Thread Starter | Forum | Replies | Last Post |
Question about Mersenne divisors | paulunderwood | Miscellaneous Math | 1 | 2016-01-24 01:41 |
Form of mersenne divisors??? | kurtulmehtap | Miscellaneous Math | 34 | 2014-09-06 13:58 |
Sum of prime divisors for Mersenne Numbers? | kurtulmehtap | Math | 3 | 2011-01-19 18:48 |
Asymptotic density of k-almost primes | CRGreathouse | Math | 1 | 2010-08-22 23:47 |
odd divisors of Mersenne-like, question | stpascu | Factoring | 1 | 2006-10-16 16:31 |