GCD and LCM using Recursion Quiz Online Practice Test

1. Which term does not refer to the Greatest Common Divisor (GCD)?

LCM

GCM

GCF

HCF

2. What is the Greatest Common Divisor (GCD) of 8 and 12?

3. Given that the GCD of two numbers is 8 and their LCM is 144, find the second number if the first number is 72.

4. Which term is synonymous with GCD?

Highest Common Divisor

Highest Common Multiple

Highest Common Measure

Lowest Common Multiple

5. Which pair of numbers is coprime?

54 and 24

4 and 8

6 and 12

9 and 28

6. In terms of a Venn Diagram, which expression represents the GCD (assuming A ∩ B ≠ Ø)?

Multiplication of terms in A ∪ B

Multiplication of terms in A ∩ B

Multiplication of terms in A * B

Multiplication of terms in A – B

7. How can you determine the GCD of two numbers a and b?

a + b

gcd (a-b, b) if a>b

gcd (a+b, a-b)

a – b

8. What is the GCD of the numbers 48, 18, and 0?

9. Are 9 and 28 coprime numbers?

Yes

Sometimes

Not enough information

10. If the GCD of a and b is expressed as d = a cdot p + b cdot q, where d, p, and q are positive integers and neither a nor b is zero, what is this expression known as?

Bézout’s Identity

Multiplicative Identity

Sum of Products

Product of Sums

11. Is the GCD an associative function?

True

False

Sometimes

Not applicable

12. What is the correct term for the following relation: gcd (a, b) * lcm (a, b) ?

|a*b|

a + b

a – b

a / b

13. Who formulated the expressions for the probability and expected value of the GCD?

James E. Nymann

Riemann

Thomae

Euler

Test Name:	GCD and LCM using Recursion Quiz
Subject Category:	Computer Science
Test Type:	Multiple Choice Questions
Total Score / Questions:	13 / 13
Time Allowed:	10 Min
Who Should Practice this Test:	Students, job seekers, or professionals preparing for competitive exams and interviews.

GCD and LCM using Recursion MCQ Quiz Online Practice Test