According to Euclid's division algorithm, HCF of any two positive integers a and b with a>b is obtained by applying Euclid's division lemma to a and b to find q and r such that a=bq+r, where r must satisfy
1<r<b
0<r<b
0≤r<b
0<r≤b
A
1<r<b
B
0<r<b
C
0≤r<b
D
0<r≤b
Open in App
Solution
Verified by Toppr
According to Euclid's division algorithm, HCF of any two positive integers a and b with a>b is obtained by applying Euclid's division lemma to a and b to find q and r such that a=bq+r
The remainder r is either equal to or greater than 0 but it is always smaller than divisor b.
i.e 0≤r<b
Hence, option C is correct.
Was this answer helpful?
0
Similar Questions
Q1
According to Euclid's division algorithm, HCF of any two positive integers a and b with a>b is obtained by applying Euclid's division lemma to a and b to find q and r such that a=bq+r, where r must satisfy
View Solution
Q2
According to Euclid's division lemma, if a and b are two positive integers with a>b, then which of the following is true? (Here, q and r are unique integers.)
View Solution
Q3
Euclid's division lemma states that for two positive integers a and b , there exist unique integers q and r such that a = bq + r , where r must satisfy
(a) 1 < r < b (b) 0 < r b (c) 0 r < b (d) 0 < r < b r
View Solution
Q4
Euclid's division algorithm states that for any positive integers a and b, there exist unique integers q and r such that a=bq+r where
View Solution
Q5
In Euclid's division Lemma for positive integers a and b, the unique integers q and r are obtained such that a=bq+r is