Math, asked by 12383883, 3 days ago

Find the HCF of 1260 and 7344 By Eudlid division algorithm​

Answers

Answered by Ankur0505
1

Step-by-step explanation:

The HCF of 7344 and 1260 is 36. Note: In Euclid's algorithm we use the concept of long division. Here we continue the division until the remainder becomes zero. It is also known as GCD (Greatest common Divisor), which means the greatest common number which when divides both the numbers, gives the remainder as zero.

Similar questions