Question

find HCF using algorithm 75 and 242​

Answer 1

Answer:

HCF) of 242, 75 is 1.

HCF(242, 75) = 1

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

⭕⭕⭕⭕⭕⭕⭕⭕⭕⭕⭕⭕⭕⭕⭕

hope it helps u

Answer 2

Answer:

1 is the hcf of 75 and 242

please mark me brainlist

Step-by-step explanation:

Here 242 is greater than 75

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

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

242 = 75 x 3 + 17

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

75 = 17 x 4 + 7

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

17 = 7 x 2 + 3

We consider the new divisor 7 and the new remainder 3,and apply the division lemma to get

7 = 3 x 2 + 1

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 242 and 75 is 1

Notice that 1 = HCF(3,1) = HCF(7,3) = HCF(17,7) = HCF(75,17) = HCF(242,75) .