知识卡片

普通读书笔记卡 · 3697.b

互素等于最大公约数为一

理解等级:初级

两个整数互素是指它们只有公共正因子1,即gcd(a,b)=1;

互素不要求每个数本身都是素数,例如8与15互素。

这个条件决定某些模方程是否可约去乘子。

这张卡片看不懂?

已有反馈 · 0 / 10 条

    还没有人提交反馈。

    在整书笔记中的位置

    原书出处 · 1 处

    • 第31章 数论算法 · 查看原书依据

      Two integers a and b are relatively prime if their only common divisor is 1, that is, if gcd(a, b) = 1. For example, 8 and 15 are relatively prime, since the divisors of 8 are 1, 2, 4, and 8, and the divisors of 15 are 1, 3, 5, and 15. The following theorem states that if two integers are each relatively prime to

    参考来源

    - 位置:《算法导论(第4版)》第31章《数论算法》(OEBPS/chapter031.xhtml,文本字符[10000,15000))。 - 结论依据:原文定义整除、素数、余数、同余类和最大公约数,或给出相应定理;公式图已核对。 - 原始内容:Two integers a and b are relatively prime if their only common divisor is 1, that is, if gcd( a , b ) = 1. For example, 8 and 15 are relatively prime, since the divisors of 8 are 1, 2, 4, and 8, and the divisors of 15 are 1, 3, 5, and 15. The following theorem states that if two integers are each relatively prime to