My argument is that because divisors of the Mersenne number

canâ€™t be < p if p is a prime number. Therefore if 2p +1 is a divisor of it has no divisors as p is > the square root of 2p + 1. This will therefore make 2p + 1 a prime number.Is this proof correct?

]]>