If the Least Common Multiple $(LCM)$ of two numbers is equal to their product,then their Greatest Common Divisor $(GCD)$ is . . . . . . .

  • A
    $1$
  • B
    $2$
  • C
    $0$
  • D
    Cannot be determined

Explore More

Similar Questions

Find the $g.c.d.$ (Greatest Common Divisor) of $75$ and $243$ using Euclid's division algorithm.

The Least Common Multiple $(LCM)$ of $6$ and $20$ is .......

The Least Common Multiple $(LCM)$ of the smallest prime number and the smallest composite number is . . . . . . .

If $\text{g.c.d.}(336, 52) = 4$,then $\text{l.c.m.}(336, 52) = \dots$

Find the $g.c.d.$ of the following numbers using Euclid's division algorithm: $117$ and $65$.

Vedclass Products

For Students

Vedclass Test Series

Mock tests in real JEE/NEET style with performance analysis. 5-day free trial.

Start Free Trial
For Teachers

Exam Paper Generator

Generate Set A/B/C/D exam papers from 7.5L+ questions in 2 minutes. 3 chapters free.

Try Free
For Institutes

Online Exam Module

Live online exams with unlimited students, 360° analytics & white-label branding.

See Demo