Use Euclid’s division algorithm to find the HCF of : 135 and 225

Answers (1)

225 > 135. Applying Euclid's Division algorithm we get

225=135\times 1+90

since remainder \neq 0 we again apply the algorithm

135=90\times 1+45

since remainder \neq 0 we again apply the algorithm

90=45\times 2

since remainder = 0 we conclude the HCF of 135 and 225 is 45.

Preparation Products

JEE Main Rank Booster 2021

This course will help student to be better prepared and study in the right direction for JEE Main..

₹ 13999/- ₹ 9999/-
Buy Now
Rank Booster NEET 2021

This course will help student to be better prepared and study in the right direction for NEET..

₹ 13999/- ₹ 9999/-
Buy Now
Knockout JEE Main April 2021 (Easy Installments)

An exhaustive E-learning program for the complete preparation of JEE Main..

₹ 4999/-
Buy Now
Knockout NEET May 2021

An exhaustive E-learning program for the complete preparation of NEET..

₹ 22999/- ₹ 14999/-
Buy Now
Knockout NEET May 2022

An exhaustive E-learning program for the complete preparation of NEET..

₹ 34999/- ₹ 24999/-
Buy Now
Exams
Articles
Questions