Question

find the H.C.F OF THE NUMBER `475 BY EUCLID'S DIVISION algorithm . process also please​

Answer 1

Step-by-step explanation:

HCF of 475, 25 by Euclid's Divison lemma method can be determined easily ie., 25 the largest factor that exactly divides the numbers with r=0.

Highest common factor (HCF) of 475, 25 is 25.

HCF(475, 25) = 25

Ex: 10, 15, 20 (or) 24, 48, 96,45 (or) 78902, 89765, 12345

Answer 2

Step-by-step explanation:

By applying Euclid’s Division lemma on 495 and 475 we get,  495 = 475 x 1 + 20.  Since remainder ≠ 0, apply division lemma on 475 and remainder 20  475 = 20 x 23 + 15.  Since remainder ≠ 0, apply division lemma on 20 and remainder 15  20 = 15 x 1 + 5.  Since remainder ≠ 0, apply division lemma on 15 and remainder 5  15 = 5 x 3+ 0.  Therefore, H.C.F. of 475 and 495 is 5.Read more on Sarthaks.com - https://www.sarthaks.com/621609/find-the-hcf-of-the-pairs-of-numbers-475-and-495