# YOU CAN DOWNLOAD 200+ SUBJECTS PDF BOOK FOR COMPETITIVE EXAMINATIONS

## GCD and LCM using Recursion Multiple choice Questions and Answers (MCQs)

Question 11 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER] |

What is the following expression, lcm (a, lcm (b, c) equal to?

lcm (a, b, c) | |

a*b*c | |

a + b + c | |

lcm (lcm (a, b), c) |

Question 11 Explanation:

Since LCM function follows associativity, hence lcm (a, lcm (b, c) is equal to lcm (lcm (a, b), c).

Question 12 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER] |

Is lcm an associative function.

True | |

False |

Question 12 Explanation:

The lcm function is an associative function as lcm (a, lcm (b, c) is equal to lcm (lcm (a, b), c).

Question 13 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER] |

Which is the correct term of the given relation, lcm (a, b) * gcd (a, b) =?

|a*b| | |

a + b | |

a - b | |

a / b |

Question 13 Explanation:

The lcm is closely related to gcd as lcm (a, b) * gcd (a, b) = |a*b|.

Question 14 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER] |

What is the following expression, lcm (a, gcd (a, b)) equal to?

a | |

b | |

a*b | |

a + b |

Question 14 Explanation:

Since the lcm function follows absorption laws so lcm (a, gcd (a, b)) equal to a.

Question 15 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER] |

Which algorithm is the most efficient numerical algorithm to obtain lcm?

Euler's Algorithm | |

Euclid's Algorithm | |

Chebyshev Function | |

Partial Division Algorithm |

Question 15 Explanation:

The most efficient way of calculating the lcm of a given number is using Euclid's algorithm which computes the lcm in much lesser time compared to other algorithms.

There are 15 questions to complete.