Euclid Division Algorithm
Trending Questions
Use Euclids Division Lemma to show that the square of any positive integer is either for some integer.
Which is the largest number that perfectly divides 480 and 270?
60
30
10
15
Question 2
For some integer q. every odd integer is of the form
A) q
B) q + 1
C) 2q
D) 2q + 1
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.)
b=aq+r where 0≤r<a
a=bq+r where 0≤r<b
a=b+r where 0≤r<a
a=b×r where 0≤r<b
Question 1
For some integer m, every even integer is of the form
A) m
B) m + 1
C) 2m
D) 2m + 1
2361 = ( 784 × Q ) + R
Find the value of Q and R.
3, 9
8, 16
16, 5
18, 75
Visualizing Euclid’s division algorithm, find the values of a, b and c.
a=11, b=8, c=4
a=12, b=12, c=3
a=13, b=11, c=2
a=10, b=12, c=5
- 27
- 24
- 8
- 16
Question 1
For some integer m, every even integer is of the form
A) m
B) m + 1
C) 2m
D) 2m + 1
- 35
- 45
- 25
The product of HCF and LCM of 60, 84 and 108 is
- ₹ 18, 000
- ₹ 24, 960
- ₹ 15, 600
- ₹ 18, 200
- 18
- 19
- 21
- 22
The least multiple of 7 which leaves a remainder of 4, when divided by 6, 9, 15 and 18 is ___.
364
74
94
184
- greater than
- lesser than
- equal to