We use cookies to personalise content and advertisements and to analyse access to our website. Furthermore, our partners for online advertising receive pseudonymised information about your use of our website.
Please click on "Accept cookies" if you agree to the setting of cookies. Cookies that do not require consent remain unaffected by this, see
cookie policy and privacy policy.
DECLINE COOKIES

given two positive integers, m and n.

m is an odd number.

prove that (2^m -1, 2^n +1) = 1

what i have in my notes is that: (a, b) = 1 --> gcd is 1 --> that means that a and b are coprime.

So I have to prove that 2^m -1 and 2^n +1 are both prime numbers, aka prove that their gcd is 1.

I'm just not sure how to do that, any help is appreciated!

hearts123 Feb 9, 2019

#1**+1 **

\(\text{what you think you have to prove can't be right because}\\ 2^6+1 = 65 = 5 \cdot 13 \text{ isn't prime, and}\\ 2^9-1 = 511 = 7\cdot 73 \text{ isn't prime either}\\ \text{so that can't be a general rule regarding the primality of powers of two plus or minus 1}\)

\(\text{you just need to prove that the two numbers are coprime, i.e. have no common factors}\)

.Rom Feb 10, 2019