MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
| 1. |
What is the formula for Euclidean algorithm? |
| A. | GCD (m,n) = GCD (n, m mod n) |
| B. | LCM(m,n)=LCM(n, m mod n) |
| C. | GCD(m,n,o,p) = GCD (m, m mod n, o, p mod o) |
| D. | LCM (m,n,o,p) = LCM (m, m mod n, o, p mod o) |
| Answer» B. LCM(m,n)=LCM(n, m mod n) | |