Can any say how to solve the HCF Euclid's division algorithm. what methods to solve.?

Question

Answer

Yes.. See --

Suppose we have to find the HCF of 45 & 60

So, here 60 is greater than 45.Therefore 60 is considered to be as a dividend and 45 is considered as divisor

Dividend = Divisor � Quotient + Remainder

60 = 45 � 1 + 15

Now , the divisor will become dividend and remainder will becomes divisor

45 = 15 � 3 + 0

Continue this process until the remainder become 0.

So, now we can say that HCF of 45 & 60 is 15 .

Hope , you get it .

Answer

A= bq+r where r is either equal to zero or bugger but Smaller than. b

Answer

A=bq+r is the formula used to find HCF in Euclid's division Algorithm.
Euclid's division Algorithm is just the repetition of Euclid's division Lemma.

Answer

Hi Praphull Pandey,

Well to explain this method, its going to take a lot of time typing, so therefore I advice you take a course from EDUREV for this chapter and follow the methods as they say. If you have the textbook, please do also refer that, in that they have explained it in a proper way.

I know this is not going to help you in any way, but this is the maximum I can do. I just didn't want to leave you hanging there!

If you have understood the concept of Euclid's division algoritham after studying, please do not leave it there... try solving problems related towards it from outside sources as well as try attempting the test on EDUREV.

Have a nice day!! :)

Answer

Hi frank

Top Courses for Class 10View all

Science Class 10

Social Studies (SST) Class 10

Mathematics (Maths) Class 10

English Grammar Advanced

English Grammar Basic

Top Courses for Class 10

Top Courses for Class 10

Suggested Free Tests

Related Content

About Class 10

Class 10 Study Material

Class 10 All Subjects

NCERT Textbook Solutions

Other Classes

Important Links

Company