GCD LCM
GCD: Greastest Common Divisor; highest common factor 最大公因數
GCD: Greastest Common Divisor; highest common factor 最大公因數
1.窮舉法(Exhaustive Attack method; Brute-force method)
※取兩數較大的值,從2開始暴力破解。
2.輾轉相除法 division algorithm; mutual division; method of successive division
3.遞迴法
改良版:
LCM: Lowest Common Multiple 最小公倍數
LCM: Lowest Common Multiple 最小公倍數
先取x,y的最大公因數z=GCD,LCM= (x / z) * (y / z) * z。