Math, asked by siridathareddy, 9 months ago

Find the Hef of 2751,12
by using division algorithm​

Answers

Answered by Anonymous
2

Answer:

Euclid’s Division Lemma Calculator

HCF Using Euclid’s Division Lemma Method: Finding the Highest Common Factor by Euclid’s Division Lemma Algorithm is a standard approach by all the students. Here, we will see the detailed process on How to Find HCF of two or more numbers by Euclid’s Division Lemma Algorithm.

The Highest Common Factor (HCF) Calculator is used to calculate GCF of two or more whole numbers. Here, you can enter numbers separated by a comma “,” and then press the Calculate button to get the HCF of those numbers using the Euclidean division algorithm.

Answered by pallavisrinivas2004
1

Answer:

2751,112

112 |   2751   |  24

        2688

      -------------

            63  |   112    |  1

                       63

                  ------------

                        49  |  63  |   1

                                  49

                            --------------

                                  14  |   49    | 3

                                            42

                                       -------------

                                          7    |  14    |   2

                                                   14

                                              --------------

                                                     0

         

Step-by-step explanation:

Similar questions