Tag：Mutual prime
-
Time：2020-12-7
Suppose m and N are integers,m\neq 0。 If n is a multiple of M, there exists an integer k such thatn= mk。 If M is divisible by N, we write it asm|n; ifmDo not dividen, we remember asm\nmid n。 For example, because6=3·2, so3|6。6The factor of is1,2,3。 Because there is no5A multiple of is equal to7, […]
-
Time：2020-10-19
Title:Enter two positive integers m and N to find the greatest common divisor and the least common multiple. Program analysis: (1) The least common multiple = the product of two input numbers divided by their greatest common divisor, the key is to find the greatest common divisor; (2) To find the greatest common divisor by […]
