Use Euclid's division algorithm to find the H | vedclass

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

Question

(A) To find the $HCF$ of $135$ and $225$ using Euclid's division algorithm:Since $225 > 135$,we apply the division lemma to $225$ and $135$ to obtain:

Vedclass · Accepted Answer

$45$

Vedclass · Answer

(A) To find the $HCF$ of $135$ and $225$ using Euclid's division algorithm:Since $225 > 135$,we apply the division lemma to $225$ and $135$ to obtain:$225 = 135 	imes 1 + 90$Since the remainder $90 
eq 0$,we apply the division lemma to $135$ and $90$ to obtain:$135 = 90 	imes 1 + 45$Now,we consider the new divisor $90$ and the new remainder $45$,and apply the division lemma to obtain:$90 = 45 	imes 2 + 0$Since the remainder is $0$,the process stops.Since the divisor at this stage is $45$,the $HCF$ of $135$ and $225$ is $45$.

Use Euclid's division algorithm to find the $HCF$ of $135$ and $225$.

Similar Questions

Prove that $3+2 \sqrt{5}$ is irrational.

Prove that $\frac{1}{\sqrt{2}}$ is an irrational number.

Show that any positive odd integer is of the form $4q+1$ or $4q+3,$ where $q$ is some integer.

Show that any positive odd integer is of the form $6q+1$,$6q+3$,or $6q+5$,where $q$ is some integer.

Show that every positive even integer is of the form $2q$,and that every positive odd integer is of the form $2q+1$,where $q$ is some integer.

Vedclass Test Series

Exam Paper Generator

Online Exam Module