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

  • A
    $4$
  • B
    $6$
  • C
    $7$
  • D
    $9$

Explore More

Similar Questions

$(3k+2)^2$ leaves remainder ............ on dividing by $3$.

The following real number is expressed in decimal form. Determine whether it is rational or not. If it is rational,express it in the form of $\frac{p}{q}$. $0.\overline{001}$

By using the fact $g.c.d. (a, b) \times l.c.m. (a, b) = a \times b$,find $l.c.m. (26, 91)$.

If two positive integers $p$ and $q$ can be expressed as $p = a b^{2}$ and $q = a^{3} b$,where $a$ and $b$ are prime numbers,then $LCM(p, q)$ is:

By using the fact $g.c.d.(a, b) \times l.c.m.(a, b) = a \times b$,find $l.c.m.(96, 404)$.

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