A stupid question# Computation - 科学计算
r*e
1 楼
I met a problem which is easy intuitively, but I don't know how to prove it.
Please help me on this.
For all positive integer n, a, and b, if n|ab, gcd(a, n) = 1, then n|b.
gcd is greatest common divisor, n|ab means n divides a*b.
Thanks
Please help me on this.
For all positive integer n, a, and b, if n|ab, gcd(a, n) = 1, then n|b.
gcd is greatest common divisor, n|ab means n divides a*b.
Thanks