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
Hard · Level 5View options
(q=12, r=21)
(q=11, r=133)
(q=13, r=-91)
(q=10, r=245)
Hard · Level 5View options
895
896
857
858
Hard · Level 5View options
1025
1026
1082
1083
Hard · Level 5View options
(947=73\times12+71)
(947=73\times13-2)
(947=73\times11+144)
(947=73\times10+217)
Hard · Level 5View options
0
1
25
27
Hard · Level 5View options
9
10
28
47
Hard · Level 5View options
4
3
2
1
Hard · Level 5View options
(9q,9q+1,\ldots,9q+8)
(9q+1,9q+2,\ldots,9q+9)
(9q,9q+1,\ldots,9q+9)
(9q+2,9q+3,\ldots,9q+10)
Hard · Level 5View options
30
1
31
0
Hard · Level 5View options
15
14
13
12
Hard · Level 5View options
52
51
50
0
Hard · Level 5View options
25
26
27
81
Hard · Level 5View options
11
14
15
16
Hard · Level 5View options
3
7
9
1
Hard · Level 5View options
The remainder can be from 1 to 14
The remainder can be from 0 to 13
The remainder can only be 14
The remainder must be greater than 14
Hard · Level 5View options
9
10
35
12
Hard · Level 5View options
4
5
6
13
Hard · Level 5View options
9
10
11
180
Hard · Level 5View options
5
6
4
3
Hard · Level 5View options
Only 0, 1 and 4
Only 1, 2 and 3
Only 0, 2 and 4
All 0, 1, 2, 3 and 4
Hard · Level 5View options
0
22
2
5
Hard · Level 5View options
0
23
24
11
Hard · Level 5View options
5
6
7
8
Hard · Level 5View options
5
7
43
1
Hard · Level 5View options
8
10
12
42
Question 1HardLevel 5
According to Euclid’s division lemma, what are the quotient and remainder when 1365 is divided by 112?
Correct answer: A
Step 1: Find the nearest lower multiple of 112 below 1365. Step 2: (112\times12=1344), so the remainder is (1365-1344=21). Step 3: In exams, always check that the final remainder is smaller than the divisor.
If a number gives quotient 22 when divided by 39, what is the greatest possible value of that number?
Correct answer: B
Step 1: The number has the form (39\times22+r), where (0\le r<39). Step 2: The greatest remainder is 38, so the number is (858+38=896). Step 3: For the greatest number, take the remainder one less than the divisor.
If a number gives quotient 18 when divided by 57, what is the least possible value of that number?
Correct answer: B
Step 1: The number is (57\times18+r). Step 2: For the least value, (r=0), so the number is (57\times18=1026). Step 3: For a minimum value, start with remainder zero.
Which option gives the correct Euclidean form of dividing 947 by 73?
Correct answer: A
Step 1: A valid remainder must be from 0 to 72. Step 2: (73\times12=876), so (947=876+71), and 71 is valid. Step 3: A form with a negative remainder may look close, but it is not Euclidean form.
If (x=26q+25), what is the remainder when (x+28) is divided by 26?
Correct answer: B
Step 1: The remainder of (x) is 25. Step 2: Adding 28 gives total remainder (25+28=53), and (53=26\times2+1). Step 3: After addition, reduce the remainder again by the divisor.
If (n) leaves remainder 8 when divided by 19, what is the remainder when (5n+7) is divided by 19?
Correct answer: A
Step 1: Let (n=19q+8). Step 2: The remainder of (5n+7) comes from (5\times8+7=47), and (47=19\times2+9). Step 3: In a linear expression, using the remainder keeps the calculation short.
If a number leaves remainder 9 when divided by 11, what is the remainder when its square is divided by 11?
Correct answer: A
Step 1: The square remainder comes from dividing (9^2=81) by 11. Step 2: (81=11\times7+4), so the remainder is 4. Step 3: In square questions, square the remainder instead of the whole number.
Which is the correct list of all possible forms of a positive integer when divided by 9?
Correct answer: A
Step 1: On division by 9, possible remainders are from 0 to 8. Step 2: Therefore, all forms are from (9q) to (9q+8). Step 3: Include remainder 0 and do not include remainder 9.
If (a=31q+30), what is the remainder when (a+1) is divided by 31?
Correct answer: D
Step 1: The remainder of (a) is 30, one less than 31. Step 2: Adding 1 gives (31q+31=31(q+1)), so the remainder is 0. Step 3: Adding 1 to a remainder one less than the divisor gives the next exact multiple.
If (m) leaves remainder 4 when divided by 17, what is the remainder when (m-23) is divided by 17?
Correct answer: A
Step 1: Write (m=17q+4). Step 2: (m-23=17q-19=17(q-2)+15), so the remainder is 15. Step 3: If subtraction gives a negative remainder, add the divisor as needed.
In Euclid’s division lemma, if the divisor is 52, what is the greatest possible value of the remainder?
Correct answer: B
Step 1: The remainder condition is (0\le r<52). Step 2: The greatest integer smaller than 52 is 51, so it is the greatest possible remainder. Step 3: A remainder can never be equal to the divisor.
If a number leaves remainder 27 when divided by 28, what remainder will three times the number leave when divided by 28?
Correct answer: A
Step 1: For three times the number, the remainder part is (3\times27=81). Step 2: (81=28\times2+25), so the final remainder is 25. Step 3: After multiplication, reduce the remainder below the divisor.
Which option gives the correct remainder when 875 is divided by 41?
Correct answer: B
Step 1: Find the nearest lower multiple of 41 below 875. Step 2: (41\times21=861), so the remainder is (875-861=14). Step 3: The nearest lower multiple method saves time with larger numbers.
If a number leaves remainder 3 when divided by 10, what is the remainder when its cube is divided by 10?
Correct answer: B
Step 1: For the cube, take (3^3=27). Step 2: Dividing 27 by 10 gives remainder 7. Step 3: In power questions, use the smaller remainder instead of the full number.
Which statement is correct when an integer is divided by 14?
Correct answer: B
Step 1: In Euclid’s lemma, (0\le r<b). Step 2: Here (b=14), so the remainder can be from 0 to 13. Step 3: Include 0 in the list of remainders and exclude the divisor itself.
If (p=13q+11), what is the remainder when (4p-9) is divided by 13?
Correct answer: A
Step 1: The remainder of (p) is 11. Step 2: The remainder of (4p-9) comes from (4\times11-9=35), and (35=13\times2+9). Step 3: Always reduce the final remainder below the divisor.
If (a=8q+6) and (b=8p+7), what is the remainder when (a+b) is divided by 8?
Correct answer: B
Step 1: The two remainders are 6 and 7. Step 2: The sum remainder comes from (6+7=13), and (13=8+5). Step 3: If the sum of remainders is greater than the divisor, reduce it again.
If (a=17q+12) and (b=17p+15), what is the remainder when (ab) is divided by 17?
Correct answer: B
Step 1: For multiplication, multiply the remainders 12 and 15. Step 2: (12\times15=180), and (180=17\times10+10). Step 3: In product questions, multiply the remainders and then find the final remainder.
If a number leaves remainder 5 when divided by 7, what is the remainder when its cube is divided by 7?
Correct answer: B
Step 1: For the cube, consider (5^3=125). Step 2: (125=7\times17+6), so the remainder is 6. Step 3: In higher powers, reduce remainders along the way to keep calculation easy.
When an integer is divided by 5, what remainders can its square have?
Correct answer: A
Step 1: The possible remainders of a number are 0, 1, 2, 3, and 4. Step 2: Their square remainders are 0, 1, 4, 4, and 1 respectively. Step 3: A square divided by 5 never leaves remainder 2 or 3.
If (N) leaves remainder 17 when divided by 22, what is the remainder when (N+49) is divided by 22?
Correct answer: C
Step 1: The remainder of (N) is 17. Step 2: (49) leaves remainder 5 on division by 22, so (17+5=22), which gives remainder 0. Step 3: After reducing the added number, reduce the final sum again by the divisor.
Which option shows an invalid remainder for Euclid’s division lemma when the divisor is 24?
Correct answer: C
Step 1: When the divisor is 24, the remainder can be from 0 to 23. Step 2: 24 is equal to the divisor, so it cannot be a remainder. Step 3: In remainder questions, carefully check any option equal to the divisor.
Step 1: (67\times25=1675). Step 2: (1682-1675=7), so the remainder is 7. Step 3: While dividing, choose a multiple that does not exceed the given number.
If (t=18q+13), what is the remainder when (3t+4) is divided by 18?
Correct answer: B
Step 1: The remainder of (t) is 13. Step 2: The remainder part of (3t+4) is (3\times13+4=43), and (43=18\times2+7). Step 3: The final remainder must be reduced below 18.
If a number leaves remainder 6 when divided by 32, what is the remainder when seven times the number is divided by 32?
Correct answer: B
Step 1: For seven times the number, the remainder part is (7\times6=42). Step 2: (42=32+10), so the final remainder is 10. Step 3: After multiplication, reduce the result again by the divisor.
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