duongsonhaiphong's Content
There have been 1 items by duongsonhaiphong (Search limited from 19-05-2020)
|
Chứng minh rằng ƯCLN(m, n) = ƯCLN(n, m mod n)in Số họcStarted by duongsonhaiphong, 15-12-2018  gcd(m;n) = gcd(n;m mod n) and 2 more...
|
|
|
