Thread: Coprime numbers

Prove, that if
(m,n) = 1 // m and n are two different primes
then
(2^m -1, 2^mn -1/2^m -1) = 1

We have

So basically we have to show that doesn't divide (since is prime)

Now this cannot always happen since we may choose, say (3, 7).