Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Prove that gcd(m+1,n+1)|mn-1 ,where m and n are integers.

I have already done:


Clearly gcd(m+1, n+1)|(m+1)(n+1)

And obviously gcd(m+1),(n+1)|(m+1)(n+1)

Therefore gcd(m+1),(n+1)|mn-1. QED

Can someone give me an alternate proof?

share|cite|improve this question
What's the difference between your "clearly" and "obviously" statements? – user2345215 Feb 27 '14 at 20:33
Your proof does not really make sense to me. – drhab Feb 27 '14 at 20:39
up vote 0 down vote accepted

${\rm mod}\ (m\!+\!1,n\!+\!1)\!:\ m\!+\!1\equiv0\equiv n\!+\!1,\,$ so $\,\color{#0a0}{m,n}\equiv \color{#c00}{-1}\,\Rightarrow\, \color{#0a0}{mn}-1\equiv (\color{#c00}{-1})(\color{#c00}{-1})-1\equiv 0.$

share|cite|improve this answer
Wow, such color. Much insight. – user2345215 Feb 27 '14 at 20:50

$mn-1=(m+1)n-(n+1)$ so if $d|m+1$ and $d|n+1$ then also $d|mn-1$.

You can take $d=\gcd(m+1,n+1)$

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.