Q707
What is the formula for Euclidean algorithm?
A.
GCD (m,n) = GCD (n, m mod n)
AnswerB.
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: Option A
Solution
Answer: Option A
No explanation is given for this question Let's Discuss on Board