Quote:
Originally Posted by LaurV

How? For example, 7 divides 70, but s(7) = 2*7^2  1 = 97 does not divide s(70) = 2*70^2  1 = 9799. Clearly enough, 97 divides 9797, hence 97 leaves a remainder of 2 when dividing into 9799?
It is true that M(p) = 2^p  1, for odd p, can be written as s(n); you take n = 2^{(p1)/2}.
For example, M(101) = 2^101  1 = 2*(2^50)^2  1 = s(2^50).
Not sure if the relation n = 2^{(p1)/2} is related to masser's question.
/JeppeSN