Find the g.c.d. (Greatest Common Divisor) of | vedclass

Name: Exam Paper Generator | JEE NEET Paper Generator | Vedclass
Brand: Vedclass
Rating: 5 (35 reviews)

Question

(B) To find the $g.c.d.$ of $81$ and $237$ using Euclid's division algorithm,we follow these steps:Step $1$: Apply Euclid's division lemma to $237$ an

Vedclass · Accepted Answer

$3$

Vedclass · Answer

(B) To find the $g.c.d.$ of $81$ and $237$ using Euclid's division algorithm,we follow these steps:Step $1$: Apply Euclid's division lemma to $237$ and $81$ $(237 > 81)$:$237 = 81 	imes 2 + 75$Step $2$: Apply the lemma to $81$ and $75$:$81 = 75 	imes 1 + 6$Step $3$: Apply the lemma to $75$ and $6$:$75 = 6 	imes 12 + 3$Step $4$: Apply the lemma to $6$ and $3$:$6 = 3 	imes 2 + 0$Since the remainder is $0$,the divisor at this stage is the $g.c.d.$Therefore,the $g.c.d.$ of $81$ and $237$ is $3$.

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

Similar Questions

Show that the square of any positive integer is either of the form $4q$ or $4q+1$ for some integer $q$.

If $n$ is an odd integer,then show that $n^{2}-1$ is divisible by $8$.

Every composite number greater than $1$ can be expressed (factorized) as a product of primes,and this factorization is .........,apart from the order in which the prime factors occur.

Write whether the square of any positive integer can be of the form $3m + 2$,where $m$ is a natural number. Justify your answer.

Show that the square of any positive integer cannot be of the form $6m+2$ or $6m+5$ for any integer $m$.

Vedclass Test Series

Exam Paper Generator

Online Exam Module