9. For a, b,n ∈ Z⁺ and n ＞ 1, prove that a ≡ b (mod n) gcd(a,n) = gcd(b,n).

問題詳情

9. For a, b,n ∈ Z⁺ and n ＞ 1, prove that a ≡ b (mod n)

gcd(a,n) = gcd(b,n).

參考答案

上一篇 : 10. The Ackermann function A(m, n) is defined recursively for non-negative integers m and n as follo
下一篇 : 1. Newton's law of gravitation states that there exists an attractive force between the planet