Book Online Demo
Check Your IQ
Try Test

Courses

Dropper NEET CourseDropper JEE CourseClass - 12 NEET CourseClass - 12 JEE CourseClass - 11 NEET CourseClass - 11 JEE CourseClass - 10 Foundation NEET CourseClass - 10 Foundation JEE CourseClass - 10 CBSE CourseClass - 9 Foundation NEET CourseClass - 9 Foundation JEE CourseClass -9 CBSE CourseClass - 8 CBSE CourseClass - 7 CBSE CourseClass - 6 CBSE Course

Q.

The H.C.F of 135 and 225 using Euclid’s division algorithm is ____
 


see full answer

Start JEE / NEET / Foundation preparation at rupees 99/day !!

21% of IItians & 23% of AIIMS delhi doctors are from Sri Chaitanya institute !!
An Intiative by Sri Chaitanya

(Unlock A.I Detailed Solution for FREE)

Ready to Test Your Skills?

Check your Performance Today with our Free Mock Test used by Toppers!

Take Free Test

Detailed Solution

The H.C.F of 135 and 225 using Euclid’s division algorithm is 45.
Given two numbers 135 and 225.
We have to find the H.C.F of both numbers using Euclid’s division algorithm.
According to Euclid’s division lemma, the relation of a and b is
a=bq+r   where a and b are positive integers, r = remainder and q = quotient.
Since 225>135, a = 225 and b = 135.
225=135×1+90  
Since, remainder is not 0,
a = 135 and b = 90.
135=90×1+45  
Since, remainder is not 0,
a = 90 and b = 45.
90=45×2+0  
Now, the remainder = 0.
So, H.C.F. = 45.
H.C. F of 135 and 225 is 45.
  
Watch 3-min video & get full concept clarity

tricks from toppers of Infinity Learn

Related Blogs
Get ₹ 1 crore* worth scholarship for JEE / NEET / Foundation
Result Producing online coaching for JEE/NEET of south India
Largest All India Test Series for JEE/NEET
Best Books for IIT JEE
Best Books for NEET
score_test_img

Get Expert Academic Guidance – Connect with a Counselor Today!

Related Blogs
Get ₹ 1 crore* worth scholarship for JEE / NEET / Foundation
Result Producing online coaching for JEE/NEET of south India
Largest All India Test Series for JEE/NEET
Best Books for IIT JEE
Best Books for NEET
whats app icon