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 1View options
(q=16, r=51)
(q=15, r=207)
(q=17, r=-105)
(q=14, r=363)
Expert · Level 1View options
2368
2431
2432
2304
Expert · Level 1View options
2548
2549
2638
2639
Expert · Level 1View options
(3199=247\times12+235)
(3199=247\times13-12)
(3199=247\times11+482)
(3199=247\times10+729)
Expert · Level 1View options
0
1
2
41
Expert · Level 1View options
13
14
16
132
Expert · Level 1View options
4
3
2
1
Expert · Level 1View options
(11q,11q+1,\ldots,11q+10)
(11q+1,11q+2,\ldots,11q+11)
(11q,11q+1,\ldots,11q+11)
(11q+2,11q+3,\ldots,11q+12)
Expert · Level 1View options
70
1
71
0
Expert · Level 1View options
0
31
29
28
Expert · Level 1View options
108
107
106
0
Expert · Level 1View options
27
28
29
165
Expert · Level 1View options
113
121
125
129
Expert · Level 1View options
1
5
7
9
Expert · Level 1View options
The remainder can be from 1 to 18
The remainder can be from 0 to 17
The remainder can only be 18
The remainder must be greater than 18
Expert · Level 1View options
0
1
2
51
Expert · Level 1View options
10
11
12
31
Expert · Level 1View options
7
8
9
399
Expert · Level 1View options
0
1
4
7
Expert · Level 1View options
Only 0, 1, 2 and 4
Only 1, 3, 5 and 6
Only 0, 3 and 6
All from 0 to 6
Expert · Level 1View options
0
7
34
37
Expert · Level 1View options
0
45
46
19
Expert · Level 1View options
12
13
14
15
Expert · Level 1View options
9
10
61
87
Expert · Level 1View options
27
28
29
81
Question 1ExpertLevel 1
According to Euclid’s division lemma, what are the correct quotient and remainder when 2547 is divided by 156?
Correct answer: A
Step 1: Find the nearest lower multiple of 156 below 2547. Step 2: (156\times16=2496), so the remainder is (2547-2496=51). Step 3: In a valid Euclidean form, the remainder must be smaller than the divisor.
If a number gives quotient 37 when divided by 64, what is the greatest possible value of that number?
Correct answer: B
Step 1: The number is of the form (64\times37+r), where (0\le r<64). Step 2: The greatest remainder is 63, so the number is (2368+63=2431). Step 3: For the greatest value, take the remainder as one less than the divisor.
If a number gives quotient 28 when divided by 91, what is the least possible value of that number?
Correct answer: A
Step 1: The number is (91\times28+r). Step 2: For the least value, the remainder is 0, so the number is (91\times28=2548). Step 3: In minimum value questions, taking remainder zero gives the answer quickly.
Which option gives the correct Euclidean form of dividing 3199 by 247?
Correct answer: A
Step 1: In Euclidean form, the remainder is non-negative and smaller than 247. Step 2: (247\times12=2964), so (3199=2964+235). Step 3: A negative remainder or a remainder bigger than the divisor is not the standard form.
If (x=43q+41), what is the remainder when (x+89) is divided by 43?
Correct answer: B
Step 1: The remainder of (x) is 41. Step 2: 89 leaves remainder 3 when divided by 43, so the total remainder is (41+3=44). Step 3: Since (44=43+1), the final remainder is 1.
If (n) leaves remainder 17 when divided by 29, what is the remainder when (7n+13) is divided by 29?
Correct answer: A
Step 1: Replace (n) by its remainder 17. Step 2: The remainder of (7n+13) comes from (7\times17+13=132). Step 3: (132=29\times4+16), so the correct remainder is 16.
If a number leaves remainder 11 when divided by 13, what is the remainder when its square is divided by 13?
Correct answer: A
Step 1: The square remainder comes from dividing (11^2=121) by 13. Step 2: (121=13\times9+4), so the remainder is 4. Step 3: In square questions, squaring only 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 11?
Correct answer: A
Step 1: On division by 11, remainders can be from 0 to 10. Step 2: Therefore, all forms are from (11q) to (11q+10). Step 3: Include remainder 0, but do not include 11.
If (a=71q+70), what is the remainder when (a+1) is divided by 71?
Correct answer: D
Step 1: The remainder of (a) is 70, one less than 71. Step 2: Adding 1 gives (71q+71=71(q+1)). Step 3: The number becomes exactly divisible by 71, so the remainder is 0.
If (m) leaves remainder 6 when divided by 31, what is the remainder when (m-68) is divided by 31?
Correct answer: C
Step 1: Write (m=31q+6). Step 2: (m-68=31q-62=31(q-2)), so the remainder is 0. Step 3: In subtraction, check the final form as divisor times quotient plus remainder.
In Euclid’s division lemma, if the divisor is 108, what is the greatest possible value of the remainder?
Correct answer: B
Step 1: The remainder condition is (0\le r<108). Step 2: The greatest integer smaller than 108 is 107. Step 3: Remember in exams that the remainder is never equal to the divisor.
If a number leaves remainder 33 when divided by 34, what remainder will five times the number leave when divided by 34?
Correct answer: C
Step 1: For five times the number, the remainder part is (5\times33=165). Step 2: (165=34\times4+29), so the final remainder is 29. Step 3: After multiplication, always reduce the result below the divisor.
Which option gives the correct remainder when 4217 is divided by 132?
Correct answer: B
Step 1: Find the nearest lower multiple of 132 below 4217. Step 2: (132\times31=4092), so the remainder is (4217-4092=125). Step 3: For large numbers, the nearest lower multiple method is useful.
If a number leaves remainder 5 when divided by 12, what is the remainder when its cube is divided by 12?
Correct answer: B
Step 1: For the cube, consider (5^3=125). Step 2: (125=12\times10+5), so the remainder is 5. Step 3: In power questions, reduce remainders along the way to keep calculation easy.
Which statement is correct when an integer is divided by 18?
Correct answer: B
Step 1: In Euclid’s lemma, (0\le r<b). Step 2: Here (b=18), so the remainder can be from 0 to 17. Step 3: Include 0 in the list of remainders and do not include the divisor.
If (p=17q+14), what is the remainder when (5p-19) is divided by 17?
Correct answer: A
Step 1: The remainder of (p) is 14. Step 2: The remainder of (5p-19) comes from (5\times14-19=51). Step 3: Since (51=17\times3), the final remainder is 0.
If (a=23q+19) and (b=23p+21), what is the remainder when (ab) is divided by 23?
Correct answer: B
Step 1: For multiplication, multiply the remainders 19 and 21. Step 2: (19\times21=399), and (399=23\times17+8). Step 3: In product questions, the final answer must be the remainder, not the full product.
If a number leaves remainder 4 when divided by 9, what is the remainder when its cube is divided by 9?
Correct answer: B
Step 1: For the cube, consider (4^3=64). Step 2: (64=9\times7+1), so the remainder is 1. Step 3: In powers, working with the small remainder avoids large calculations.
When an integer is divided by 7, what remainders can its square have?
Correct answer: A
Step 1: On division by 7, remainders can be from 0 to 6. Step 2: Their square remainders are 0, 1, 4, 2, 2, 4, and 1. Step 3: So the square remainder can only be 0, 1, 2, or 4.
If (N) leaves remainder 30 when divided by 37, what is the remainder when (N+81) is divided by 37?
Correct answer: A
Step 1: The remainder of (N) is 30. Step 2: 81 leaves remainder 7 when divided by 37. Step 3: The total remainder is (30+7=37), so the final remainder is 0.
Which option shows an invalid remainder for Euclid’s division lemma when the divisor is 46?
Correct answer: C
Step 1: When the divisor is 46, the remainder can be from 0 to 45. Step 2: 46 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: (211\times25=5275). Step 2: (5289-5275=14), so the remainder is 14. Step 3: While dividing, choose a multiple that does not exceed the given number.
If a number leaves remainder 9 when divided by 52, what is the remainder when nine times the number is divided by 52?
Correct answer: C
Step 1: For nine times the number, the remainder part is (9\times9=81). Step 2: (81=52+29), so the final remainder is 29. 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