Question

What I the HCF of 25,32 and 48

Answer 1

Answer:

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

Here 32 is greater than 25

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

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

32 = 25 x 1 + 7

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

25 = 7 x 3 + 4

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

7 = 4 x 1 + 3

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

4 = 3 x 1 + 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 25 and 32 is 1

Notice that 1 = HCF(3,1) = HCF(4,3) = HCF(7,4) = HCF(25,7) = HCF(32,25) .

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

Here 48 is greater than 1

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

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

48 = 1 x 48 + 0

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

Notice that 1 = HCF(48,1) .

Therefore, HCF of 25,32,48 using Euclid's division lemma is 1.

Answer 2

Answer:

1

Step-by-step explanation:

25= 5*5*1

32= 2*2*2*2*2*1

48= 2*2*2*2*3*1

Therefore, only 1 is common in them So, the HCF will be 1.