Muft Shiksha™ एक 100% Free Education Portal है 🇮🇳, जिसका उद्देश्य Class 9–12 के हर विद्यार्थी तक High-Quality Education को पूरी तरह मुफ्त पहुँचाना है। 🇮🇳 हम मानते हैं कि अच्छी शिक्षा किसी student की आर्थिक स्थिति पर निर्भर नहीं होनी चाहिए। 🇮🇳 हर विद्यार्थी को वही Quality Study Material, MCQs, Quizzes, Exam Preparation, Concept-Based Learning और Bilingual Support मिलना चाहिए, जो आमतौर पर महंगी Coaching या Premium Platforms में मिलता है। Muft Shiksha™ 🇮🇳 इसी सोच के साथ बनाया गया है
In Class 10 Mathematics, under the chapter Real Numbers, Euclid’s Division Lemma introduces the relationship a = bq + r, where a and b are positive integers, q is the quotient, and the remainder r satisfies 0 ≤ r < b. Students learn how repeated division forms Euclid’s division algorithm and use it to find the highest common factor (HCF) of two numbers. The topic also strengthens understanding of divisibility, quotients, remainders, and the logical steps used in number-theory proofs.
TOPIC PRACTICE
Quiz this set
Up to 25 questions from this page. Select your focus, then start.
25 questions
Choose questions
Expert · Level 3View options
(q=22, r=70)
(q=21, r=243)
(q=23, r=-103)
(q=20, r=416)
Expert · Level 3View options
2993
3065
3066
2920
Expert · Level 3View options
2241
2242
2360
2359
Expert · Level 3View options
(4555=289\times16-69)
(4555=289\times14+509)
(4555=289\times15+220)
(4555=289\times13+798)
Expert · Level 3View options
0
4
7
49
Expert · Level 3View options
13
14
15
201
Expert · Level 3View options
7
8
9
10
Expert · Level 3View options
(13q,13q+1,\ldots,13q+12)
(13q+1,13q+2,\ldots,13q+13)
(13q,13q+1,\ldots,13q+13)
(13q+2,13q+3,\ldots,13q+14)
Expert · Level 3View options
82
1
83
0
Expert · Level 3View options
0
42
41
40
Expert · Level 3View options
125
124
123
0
Expert · Level 3View options
39
40
41
322
Expert · Level 3View options
35
44
50
57
Expert · Level 3View options
7
13
10
343
Expert · Level 3View options
The remainder can be from 1 to 25
The remainder can be from 0 to 24
The remainder can only be 25
The remainder must be greater than 25
Expert · Level 3View options
0
1
76
18
Expert · Level 3View options
13
14
15
38
Expert · Level 3View options
8
9
10
648
Expert · Level 3View options
4
5
6
125
Expert · Level 3View options
Only 0, 1, 4 and 7
Only 1, 2, 5 and 8
Only 0, 3 and 6
All from 0 to 8
Expert · Level 3View options
0
1
8
41
Expert · Level 3View options
0
57
58
31
Expert · Level 3View options
261
280
303
307
Expert · Level 3View options
13
14
15
151
Expert · Level 3View options
10
11
12
132
Question 1ExpertLevel 3
According to Euclid’s division lemma, what are the correct quotient and remainder when 3876 is divided by 173?
Correct answer: A
Step 1: Find the nearest lower multiple of 173 below 3876. Step 2: (173\times22=3806), so the remainder is (3876-3806=70). Step 3: In a valid answer, the remainder must be less than 173.
If a number gives quotient 41 when divided by 73, what is the greatest possible value of that number?
Correct answer: B
Step 1: The number has the form (73\times41+r), where (0\le r<73). Step 2: The greatest remainder is 72, so the number is (2993+72=3065). Step 3: For the greatest number, take the remainder one less than the divisor.
If a number gives quotient 19 when divided by 118, what is the least possible value of that number?
Correct answer: B
Step 1: The number is (118\times19+r). Step 2: For the least value, take remainder 0, so the number is (118\times19=2242). Step 3: For least value questions, using remainder zero is the most direct method.
Which option gives the correct Euclidean form of dividing 4555 by 289?
Correct answer: C
Step 1: In standard form, the remainder must be from 0 to 288. Step 2: (289\times15=4335), so (4555=4335+220). Step 3: A negative remainder or a remainder greater than 289 does not make the correct Euclidean form.
If (x=52q+49), what is the remainder when (x+111) is divided by 52?
Correct answer: B
Step 1: The remainder of (x) is 49. Step 2: 111 leaves remainder 7 when divided by 52, so the total remainder is (49+7=56). Step 3: Since (56=52+4), the final remainder is 4.
If (n) leaves remainder 23 when divided by 31, what is the remainder when (8n+17) is divided by 31?
Correct answer: C
Step 1: Replace (n) by its remainder 23. Step 2: The remainder of (8n+17) comes from (8\times23+17=201). Step 3: (201=31\times6+15), so the final remainder is 15.
If a number leaves remainder 14 when divided by 17, what is the remainder when its square is divided by 17?
Correct answer: C
Step 1: The square remainder comes from dividing (14^2=196) by 17. Step 2: (196=17\times11+9), so the remainder is 9. Step 3: In square questions, squaring the remainder is faster than using the whole number.
Which is the correct list of all possible forms of a positive integer when divided by 13?
Correct answer: A
Step 1: On division by 13, remainders can be from 0 to 12. Step 2: Therefore, all forms are from (13q) to (13q+12). Step 3: Include zero remainder, but do not include 13.
If (a=83q+82), what is the remainder when (a+1) is divided by 83?
Correct answer: D
Step 1: The remainder of (a) is 82, one less than 83. Step 2: Adding 1 gives (83q+83=83(q+1)). Step 3: The number becomes exactly divisible by 83, so the remainder is 0.
In Euclid’s division lemma, if the divisor is 125, what is the greatest possible value of the remainder?
Correct answer: B
Step 1: The remainder condition is (0\le r<125). Step 2: The greatest integer smaller than 125 is 124. Step 3: The remainder is never equal to the divisor.
If a number leaves remainder 46 when divided by 47, what remainder will seven times the number leave when divided by 47?
Correct answer: A
Step 1: For seven times the number, the remainder part is (7\times46=322). Step 2: (322=47\times6+40), so the remainder should be 40. Step 3: After multiplication, always reduce the result below the divisor.
Which option gives the correct remainder when 6895 is divided by 221?
Correct answer: B
Step 1: Find the nearest lower multiple of 221 below 6895. Step 2: (221\times31=6851), so the remainder is (6895-6851=44). Step 3: With large numbers, the nearest lower multiple method saves time.
If a number leaves remainder 7 when divided by 15, what is the remainder when its cube is divided by 15?
Correct answer: B
Step 1: For the cube, check (7^3=343). Step 2: (343=15\times22+13), so the remainder is 13. Step 3: In power questions, reduce remainders along the way to keep calculations short.
Which statement is correct when an integer is divided by 25?
Correct answer: B
Step 1: In Euclid’s lemma, (0\le r<b). Step 2: Here (b=25), so the remainder can be from 0 to 24. Step 3: Include 0 in the list of remainders and do not include 25.
If (p=19q+16), what is the remainder when (6p-20) is divided by 19?
Correct answer: A
Step 1: The remainder of (p) is 16. Step 2: The remainder of (6p-20) comes from (6\times16-20=76). Step 3: Since (76=19\times4), the final remainder is 0.
If (a=29q+24) and (b=29p+27), what is the remainder when (ab) is divided by 29?
Correct answer: B
Step 1: For multiplication, multiply the remainders 24 and 27. Step 2: (24\times27=648), and (648=29\times22+10). Step 3: So the correct remainder is 10; the full product is not the answer.
If a number leaves remainder 5 when divided by 11, what is the remainder when its cube is divided by 11?
Correct answer: A
Step 1: For the cube, check (5^3=125). Step 2: (125=11\times11+4), so the remainder is 4. Step 3: In powers, working with small remainders avoids large calculations.
When an integer is divided by 9, what remainders can its square have?
Correct answer: A
Step 1: On division by 9, remainders can be from 0 to 8. Step 2: Their square remainders are 0, 1, 4, 0, 7, 7, 0, 4, and 1. Step 3: So the square remainder can only be 0, 1, 4, or 7.
If (N) leaves remainder 33 when divided by 41, what is the remainder when (N+90) is divided by 41?
Correct answer: A
Step 1: The remainder of (N) is 33. Step 2: 90 leaves remainder 8 when divided by 41. Step 3: The total remainder is (33+8=41), so the final remainder is 0.
Which option shows an invalid remainder for Euclid’s division lemma when the divisor is 58?
Correct answer: C
Step 1: When the divisor is 58, the remainder can be from 0 to 57. Step 2: 58 is equal to the divisor, so it cannot be a remainder. Step 3: In definition-based questions, check the condition (r<b) first.
Step 1: (307\times23=7061). Step 2: (7341-7061=280), so the remainder is 280. Step 3: Choose a multiple that does not exceed the number and leaves a difference smaller than the divisor.
If (t=34q+27), what is the remainder when (5t+16) is divided by 34?
Correct answer: C
Step 1: The remainder of (t) is 27. Step 2: The remainder part of (5t+16) is (5\times27+16=151). Step 3: (151=34\times4+15), so the final remainder is 15.
If a number leaves remainder 12 when divided by 61, what is the remainder when eleven times the number is divided by 61?
Correct answer: A
Step 1: For eleven times the number, the remainder part is (11\times12=132). Step 2: (132=61\times2+10), so the final remainder is 10. Step 3: After multiplication, reduce the result by the divisor to make a valid remainder.
Google Analytics helps us understand site usage. Google may send limited cookie-free signals before your choice. The Live Visitors widget operates independently of this analytics choice; see the privacy policy for its provider and fallback details. Essential site features work without analytics cookies. You can change your choice later in Privacy choices. Privacy policy