Ask Question
23 June, 07:52

Prove that for any integer n and any integer a, gcd (a, a+n) divides n; hence, gcd (a, a+1) = 1

+1
Answers (1)
  1. 23 June, 11:34
    0
    Let g=gcd (a, a+n)

    a=gc, a+n=gd, where gcd (c, d) = 1

    Put a=gc into a+n=gd,

    we have gc+n=gd

    Then g (d-c) = n, that is, g divides n.
Know the Answer?
Not Sure About the Answer?
Find an answer to your question ✅ “Prove that for any integer n and any integer a, gcd (a, a+n) divides n; hence, gcd (a, a+1) = 1 ...” in 📘 Mathematics if you're in doubt about the correctness of the answers or there's no answer, then try to use the smart search and find answers to the similar questions.
Search for Other Answers