跳至內容

Chòe-tōa kong-iok-sò͘

Wikipedia (chū-iû ê pek-kho-choân-su) beh kā lí kóng...

Chòe-tōa kong-iok-sò͘ (最大公約數), iah-sī chòe-tōa kong-in-sò͘ (最大公因數; greatest common divisor; GCD), sī 2 ê chiàⁿ chéng-sò͘ kiong-tông ê in-sò͘ (kong-in-sò͘) lāi-té siāng tōa--ê. Pí-jû, 32 kap 24 ê chòe-tōa kong-in-sò͘ sī 8, 39 kap 24 ê kong-in-sò͘ sī 3, 12 kap 49 ê kong-in-sò͘ sī 1.

Kin-kù Euclid ián-sǹg-hoat, nā sī ū chiàⁿ chéng-sò͘ a kap b, jî-chhiáⁿ a hō͘ b tî ē tit-tio̍h î-sò͘ (餘數) r, a kap b ê GCD tiō sī b kap r ê GCD. Thang siá-chò GCD(a, b) = GCD(b, r).