Q1 (1)   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.

Most Viewed Questions

Preparation Products

Knockout NEET May 2024

Personalized AI Tutor and Adaptive Time Table, Self Study Material, Unlimited Mock Tests and Personalized Analysis Reports, 24x7 Doubt Chat Support,.

₹ 40000/-
Buy Now
Knockout NEET May 2025

Personalized AI Tutor and Adaptive Time Table, Self Study Material, Unlimited Mock Tests and Personalized Analysis Reports, 24x7 Doubt Chat Support,.

₹ 45000/-
Buy Now
NEET Foundation + Knockout NEET 2024

Personalized AI Tutor and Adaptive Time Table, Self Study Material, Unlimited Mock Tests and Personalized Analysis Reports, 24x7 Doubt Chat Support,.

₹ 54999/- ₹ 42499/-
Buy Now
NEET Foundation + Knockout NEET 2024 (Easy Installment)

Personalized AI Tutor and Adaptive Time Table, Self Study Material, Unlimited Mock Tests and Personalized Analysis Reports, 24x7 Doubt Chat Support,.

₹ 3999/-
Buy Now
NEET Foundation + Knockout NEET 2025 (Easy Installment)

Personalized AI Tutor and Adaptive Time Table, Self Study Material, Unlimited Mock Tests and Personalized Analysis Reports, 24x7 Doubt Chat Support,.

₹ 3999/-
Buy Now
Boost your Preparation for JEE Main with our Foundation Course
 
Exams
Articles
Questions