avatar
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
avatar
B*n
2
if (a,n)=1 then there exists integers x and y such that ax+ny=1
n|ab=>n|axb=>n|(1-ny)b=>n|b

【在 r****e 的大作中提到】
: 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

相关阅读
logo
联系我们隐私协议©2024 redian.news
Redian新闻
Redian.news刊载任何文章,不代表同意其说法或描述,仅为提供更多信息,也不构成任何建议。文章信息的合法性及真实性由其作者负责,与Redian.news及其运营公司无关。欢迎投稿,如发现稿件侵权,或作者不愿在本网发表文章,请版权拥有者通知本网处理。