Hi,
 
      Mersenne primes are of the form 2^p-1. The usual generalization is primes of the form ((k^p)-1)/(k-1), that is repprimes in base k. It is a well known result that when
2^p-1 is composite every prime factor has to be of the form 2np+1 for some n. Does there exist a similar restriction for divisors of  repdigits?  Most results for Mersenne numbers generalize easily but this one doesn't seem to. Any thoughts?
 
Regards,
Joshua Zelinsky


Get your FREE download of MSN Explorer at http://explorer.msn.com.
_________________________________________________________________________ Unsubscribe & list info -- http://www.ndatech.com/mersenne/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers

Reply via email to