Ask Question
14 February, 22:01

Understanding this proof for the proposition "For all integers a, gcd (9a+4, 2a+1) = 1.

Proof: gcd (9a+4, 2a+1) = gcd (2a+1, a) = gcd (a, 1). Since gcd (a, 1) = 1, gcd (9a+4, 2a+1) = 1.

+3
Answers (1)
  1. 14 February, 23:11
    0
    First line because 4 (2a+1) = 8a+4 and 9a+4 - (8a+4) = a

    Second line because a times 2 = 2a and 2a+1-2a=1

    Although the second equality is more or less obvious since 2a+1 leaves a remainder of 1 when divided by a.
Know the Answer?
Not Sure About the Answer?
Find an answer to your question ✅ “Understanding this proof for the proposition "For all integers a, gcd (9a+4, 2a+1) = 1. Proof: gcd (9a+4, 2a+1) = gcd (2a+1, a) = gcd (a, ...” 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