No products in the cart.

Use Euclid’s Division Algorithm to find …

CBSE, JEE, NEET, CUET

CBSE, JEE, NEET, CUET

Question Bank, Mock Tests, Exam Papers

NCERT Solutions, Sample Papers, Notes, Videos

Use Euclid’s Division Algorithm to find the HCF of: (i) 135 and 225
  • 2 answers

Priyanka Choudhary 4 years, 2 months ago

What is Eulid division lemma

Swarnamayee Swain 4 years, 2 months ago

HCF of 225 and 135 by using Euclid's Algorithm lemma:- 225=135×1+90 135=90×1+45 90=45×1+0 Since the divisor is 45 at the 3rd stage and the remainder is 0. Therefore the HCF of 135 and 225 is 45.
http://mycbseguide.com/examin8/

Related Questions

Venu Gopal has twice
  • 0 answers
sin60° cos 30°+ cos60° sin 30°
  • 2 answers
X-y=5
  • 1 answers
(A + B )²
  • 1 answers
Prove that root 8 is an irration number
  • 2 answers

myCBSEguide App

myCBSEguide

Trusted by 1 Crore+ Students

Test Generator

Test Generator

Create papers online. It's FREE.

CUET Mock Tests

CUET Mock Tests

75,000+ questions to practice only on myCBSEguide app

Download myCBSEguide App