Using Euclid's division algorithm,determine whether the pair of numbers $231$ and $396$ are co-prime.

  • A
    Yes,they are co-prime.
  • B
    No,they are not co-prime.
  • C
  • D

Explore More

Similar Questions

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

Find the $\text{g.c.d.}$ (Greatest Common Divisor) of $196$ and $38220$ using Euclid's division algorithm.

Find the $HCF$ and $LCM$ of the following pair of integers $510$ and $92$ and verify that $HCF \times LCM = \text{product of the two numbers}$.

Difficult
View Solution

$A$ sweetseller has $420$ kaju barfis and $130$ badam barfis. She wants to stack them in such a way that each stack has the same number,and they take up the least area of the tray. What is the number of barfis that can be placed in each stack for this purpose?

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

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