Question

Find H. C. F Of 76 & 115 step by step explain pls will make brain list​

Answer 1

Answer:

Step-by-step explanation:

Below detailed show work will make you learn how to find HCF of 73,76,115 using the Euclidean division algorithm. So, follow the step by step explanation & check the answer for HCF(73,76,115).

Here 76 is greater than 73

Now, consider the largest number as 'a' from the given number ie., 76 and 73 satisfy Euclid's division lemma statement a = bq + r where 0 ≤ r < b

Step 1: Since 76 > 73, we apply the division lemma to 76 and 73, to get

76 = 73 x 1 + 3

Step 2: Since the reminder 73 ≠ 0, we apply division lemma to 3 and 73, to get

73 = 3 x 24 + 1

Step 3: We consider the new divisor 3 and the new remainder 1, and apply the division lemma to get

3 = 1 x 3 + 0

The remainder has now become zero, so our procedure stops. Since the divisor at this stage is 1, the HCF of 73 and 76 is 1

Notice that 1 = HCF(3,1) = HCF(73,3) = HCF(76,73) .

We can take hcf of as 1st numbers and next number as another number to apply in Euclidean lemma

Here 115 is greater than 1

Now, consider the largest number as 'a' from the given number ie., 115 and 1 satisfy Euclid's division lemma statement a = bq + r where 0 ≤ r < b

Step 1: Since 115 > 1, we apply the division lemma to 115 and 1, to get

115 = 1 x 115 + 0

The remainder has now become zero, so our procedure stops. Since the divisor at this stage is 1, the HCF of 1 and 115 is 1

Notice that 1 = HCF(115,1) .

Therefore, HCF of 73,76,115 using Euclid's division lemma is 1.

Answer 2

Answer:

H.C.F of 76 and 115 is 1 plz check