- A
- B
- C
- D
Step-by-Step Solution
By Euclid's Division Lemma, the remainder r always satisfies 0 <= r < b, where b is the divisor.
Answer: A)
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:
Class 10Euclid's Division LemmaNumber Systems
Master this chapter in 30 minutes a day.
Don't just memorise the answer — build a daily practice habit.
Practice 5 Similar Questions Free →All Euclid's Division Lemma practice questions
More Class 10 Euclid's Division Lemma practice
In Euclid's Division Lemma a = bq + r, the integer b is called the:Any positive even integer can be written in which form (q is some integer)?Any positive odd integer is of the form 2q + 1. The next form for an odd integer is 4q +…The square of any positive integer is of the form 3m or 3m + 1 for some integer m. The…Apply Euclid's Division Lemma to a = 250 and b = 23. The remainder r is: