Home
Class 10
MATHS
Euclid's division algorithm is a repeate...

Euclid's division algorithm is a repeated application of division lemma until we get remainder as :

Text Solution

Verified by Experts

The correct Answer is:
zero remainder.
Promotional Banner

Topper's Solved these Questions

  • NUMBERS AND SEQUENCES

    FULL MARKS|Exercise EXERCISE 2.1|10 Videos

  • NUMBERS AND SEQUENCES

    FULL MARKS|Exercise EXERCISE 2.2|8 Videos

  • MENSURATION

    FULL MARKS|Exercise ADDITIONAL QUESTIONS SOLVED (iii)|8 Videos

  • RELATIONS AND FUNCTIONS

    FULL MARKS|Exercise ADDITIONAL QUESTIONS SOLVED (ANSWER THE FOLLOWING QUESTIONS)|26 Videos

Similar Questions

Explore conceptually related problems

Use Euclid's division algorithim to find the HCF of 867 and 255.

Euclid's division lemma states that for positive integers a and b, there exist unique integers q and r such that a=bq+r , where r must satisfy.

Using Euclid's division lemma, if the cube of any positive integers is divided by 9 then the possible remainders are ___.

Use Euclid Division Algorithm to find the Highest Common Factor (H.C.F) of 340 and 412

Use Euclid Division Algorithm to find the Highest Common Factor (H.C.F) of 867 and 255