Math, asked by alka5557, 11 months ago

6265 and 76254
Find HCF by using Euclids division algorithm

Answers

Answered by dharmendrasinghnegid

1

Answer:

By using Euclids division algorithms

a=bq+r

step1=76254=6265*12+1074

step2=6265=1074*5+895

step3=895*1+179

step4=895=179*5+0

hence, the h. c. f is b=179

Previous Question

Next Question

Similar questions

Math, 5 months ago

Find zero of the polynomial 2x - 1.

Business Studies, 5 months ago

Fixed capital needed for ....... period- (A) For short period (B) For long period (C) For both (D) None of these...

Math, 5 months ago

9. In a race, the odds in favour of four horses A, B, C, D are 1:3, 1: 4,1: 5 and 1.11 respectively, Assuming that a dead heat (not more than one wins at a time is inopsible, lind the chance that one of them will win the race. If there are five horses in all, what is the probability of success for the fifth horse?

English, 11 months ago

What does the young friend posses?

Math, 11 months ago

. Rohit had 8 m of ribbon. He sold 1/5 m in the morning and 7/10 m in the afternoon. How much ribbon was he left with?answer...

Social Sciences, 1 year ago

whay was check and balance...

Math, 1 year ago

construct ongrouped Prequency table 11 46.44, 50, 45, 50,42,43,50,46, 41, 42, 41, 406,44 50, 42, 43,50142, 45,45,45, 41, 42, 43, 44, UR. 43143143 ...

Math, 1 year ago

the population of a town increases at the rate of 8 % per annum if the present population is rupees 80000 what will be the population after 2 years...