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
Promotional Banner

Topper's Solved these Questions

  • NUMBERS AND SEQUENCES

    PREMIERS PUBLISHERS|Exercise ACTIVITIES|9 Videos

  • NUMBERS AND SEQUENCES

    PREMIERS PUBLISHERS|Exercise OTHER IMPORTANT OBJECTIVE TYPE QUESTIONS|23 Videos

  • NUMBERS AND SEQUENCES

    PREMIERS PUBLISHERS|Exercise THINKING CORNER|13 Videos

  • MENSURATION

    PREMIERS PUBLISHERS|Exercise OTHER IMPORTANT OBJECTIVE TYPE QUESTIONS|16 Videos

  • RELATIONS AND FUNCTION

    PREMIERS PUBLISHERS|Exercise OTHER IMPORTANT OBJECTIVE TYPE QUESTIONS|25 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

PREMIERS PUBLISHERS-NUMBERS AND SEQUENCES-PROGRESS CHECK
  1. Find q and r for the following pairs of integers a and b satisfying a ...

    Text Solution

    |

  2. Find q and r for the following pairs of integers a and b satisfying a ...

    Text Solution

    |

  3. Euclid's division algorithm is a repeated application of division lemm...

    Text Solution

    |

  4. The H.C.F of two equal positive integers k, k is :

    Text Solution

    |

  5. Every natural number except …… can be expressed as ……..

    Text Solution

    |

  6. In how many ways a composite number can be written as product of power...

    Text Solution

    |

  7. The number of divisors of any prime number is …….

    Text Solution

    |

  8. Let m divides n . Then G.C.D and L.C.M. of m,n are …… and …….

    Text Solution

    |

  9. The HCF of numbers of the form 2^(m) and 3^(n) is .

    Text Solution

    |

  10. Two integers a and b are congruent modulo n if ………

    Text Solution

    |

  11. The set of all positive integers which leave remainder 5 when divided ...

    Text Solution

    |

  12. The positive values of k such that (k-3) -= 5 (mod 11) are ….

    Text Solution

    |

  13. If 59-=3 (mod 7) ,46 -=4 (mod 7) then 105 -= …. (mod 7 ), 13-=…. (mod ...

    Text Solution

    |

  14. The remainder when 7 xx 13 xx 19 xx 23 xx 31 is divided by 6 is ….

    Text Solution

    |

  15. Fill in the blanks for the following sequences 7, 13, 19,…

    Text Solution

    |

  16. Fill in the blanks for the following sequences 2,…., 10,17,26,.……

    Text Solution

    |

  17. Fill in the blanks for the following sequences 1000,100,10,1,…..,……

    Text Solution

    |

  18. A sequence is a function defined on the set of.

    Text Solution

    |

  19. The n^(th) term of the sequence 0,2,6,12,20,….. Can be expressed as …....

    Text Solution

    |

  20. Say True or False All sequences are functions .

    Text Solution

    |