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 3View options
(q=12, r=17)
(q=11, r=101)
(q=13, r=-67)
(q=10, r=185)
Hard · Level 3View options
866
867
868
837
Hard · Level 3View options
873
874
875
919
Hard · Level 3View options
(703=58\times12+7)
(703=58\times11+65)
(703=58\times13-51)
(703=58\times10+123)
Hard · Level 3View options
0
14
15
1
Hard · Level 3View options
10
12
29
1
Hard · Level 3View options
3
4
5
7
Hard · Level 3View options
(6q,6q+1,6q+2,6q+3,6q+4,6q+5)
(6q+1,6q+2,6q+3,6q+4,6q+5,6q+6)
(6q,6q+1,6q+2,6q+3,6q+4,6q+6)
(6q+2,6q+3,6q+4,6q+5,6q+6,6q+7)
Hard · Level 3View options
22
1
0
23
Hard · Level 3View options
10
9
8
6
Hard · Level 3View options
28
29
27
0
Hard · Level 3View options
23
24
48
1
Hard · Level 3View options
11
13
15
17
Hard · Level 3View options
1
3
5
7
Hard · Level 3View options
The remainder can be from 1 to 10
The remainder can be from 0 to 9
The remainder can only be 10
The remainder must be greater than 10
Hard · Level 3View options
5
6
7
17
Hard · Level 3View options
1
2
5
9
Hard · Level 3View options
12
11
10
90
Hard · Level 3View options
1
2
3
4
Hard · Level 3View options
Only 0 and 1
Only 1 and 2
Only 0 and 2
All 0, 1, 2 and 3
Hard · Level 3View options
0
18
17
16
Hard · Level 3View options
0
18
19
7
Hard · Level 3View options
10
11
12
13
Hard · Level 3View options
5
6
21
0
Hard · Level 3View options
3
5
15
0
Question 1HardLevel 3
According to Euclid’s division lemma, what are the correct quotient and remainder when 1025 is divided by 84?
Correct answer: A
Step 1: Find the nearest lower multiple of 84 below 1025. Step 2: (84\times12=1008), so the remainder is (1025-1008=17). Step 3: The final remainder must be less than 84 for the form to be valid.
If a number gives quotient 27 when divided by 31, what is the greatest possible value of that number?
Correct answer: B
Step 1: The number is of the form (31\times27+r), where (0\le r<31). Step 2: The greatest remainder is 30, so the number is (837+30=867). Step 3: For the greatest value, take the remainder as one less than the divisor.
If a number gives quotient 19 when divided by 46, what is the least possible value of that number?
Correct answer: B
Step 1: The number is (46\times19+r). Step 2: For the least value, take remainder 0, so the number is (46\times19=874). Step 3: For minimum value questions, taking remainder zero is the safest method.
Which option shows the correct Euclidean form of dividing 703 by 58?
Correct answer: A
Step 1: A valid remainder must be between 0 and 57. Step 2: (58\times12=696), so (703=696+7), and 7 is valid. Step 3: Along with calculation, also check the range of the remainder.
If (x=15q+14), what is the remainder when (x+16) is divided by 15?
Correct answer: A
Step 1: The remainder of (x) is 14. Step 2: Adding 16 gives total remainder (14+16=30), which is exactly divisible by 15. Step 3: After addition, reduce the remainder again by the divisor.
If (n) leaves remainder 6 when divided by 17, what is the remainder when (4n+5) is divided by 17?
Correct answer: B
Step 1: Let (n=17q+6). Step 2: (4n+5=68q+24+5=68q+29=17(4q+1)+12). Step 3: In a linear expression, first multiply the remainder and then reduce by the divisor.
If a number leaves remainder 7 when divided by 9, what is the remainder when its square is divided by 9?
Correct answer: B
Step 1: The square remainder comes from dividing (7^2=49) by 9. Step 2: (49=9\times5+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 6?
Correct answer: A
Step 1: On division by 6, possible remainders are 0, 1, 2, 3, 4, and 5. Step 2: So the forms are from (6q) to (6q+5). Step 3: Include remainder 0 and do not include 6 in the complete list.
If (a=23q+22), what is the remainder when (a+1) is divided by 23?
Correct answer: C
Step 1: The remainder of (a) is 22, one less than 23. Step 2: Adding 1 gives (23q+23=23(q+1)), so the remainder is 0. Step 3: Adding 1 to a remainder one less than the divisor takes the number to the next multiple.
If (m) leaves remainder 5 when divided by 12, what is the remainder when (m-19) is divided by 12?
Correct answer: A
Step 1: Write (m=12q+5). Step 2: (m-19=12q-14=12(q-2)+10), so the remainder is 10. Step 3: If subtraction gives a negative remainder, add the divisor enough times to make it valid.
In Euclid’s division lemma (a=bq+r). If (b=28), what is the greatest possible value of (r)?
Correct answer: C
Step 1: The condition on the remainder is (0\le r<b). Step 2: If (b=28), the greatest possible value of (r) is 27. Step 3: The remainder can never be equal to the divisor.
If a number leaves remainder 24 when divided by 25, what remainder will twice the number leave when divided by 25?
Correct answer: A
Step 1: Let the number be (25q+24). Step 2: For twice the number, the remainder part is (2\times24=48), and (48=25+23). Step 3: After multiplication, reduce the remainder below 25.
Which option gives the correct remainder when 589 is divided by 36?
Correct answer: B
Step 1: Find the nearest lower multiple of 36 below 589. Step 2: (36\times16=576), so the remainder is (589-576=13). Step 3: For larger numbers, use the nearest lower multiple.
If a number leaves remainder 3 when divided by 8, what is the remainder when its cube is divided by 8?
Correct answer: B
Step 1: The cube remainder comes from (3^3=27). Step 2: (27=8\times3+3), so the remainder is 3. Step 3: In power questions, keep the calculation small by using the remainder.
Which statement is correct when an integer is divided by 10?
Correct answer: B
Step 1: In Euclid’s lemma, the remainder starts from 0. Step 2: When divided by 10, possible remainders are 0 through 9. Step 3: Do not include the divisor itself in the list of remainders.
If (p=11q+8), what is the remainder when (3p-7) is divided by 11?
Correct answer: B
Step 1: The remainder of (p) is 8. Step 2: For (3p-7), the remainder part is (3\times8-7=17), and (17=11+6). Step 3: In a linear expression, always reduce the final remainder below the divisor.
If (a=7q+4) and (b=7p+5), what is the remainder when (a+b) is divided by 7?
Correct answer: B
Step 1: The two remainders are 4 and 5. Step 2: The sum has remainder (4+5=9), and (9=7+2), so the remainder is 2. Step 3: If the sum of remainders is greater than the divisor, reduce it again.
If (a=13q+10) and (b=13p+9), what is the remainder when (ab) is divided by 13?
Correct answer: A
Step 1: For multiplication, multiply the remainders 10 and 9. Step 2: (10\times9=90), and (90=13\times6+12). Step 3: In products, using remainders instead of whole numbers saves time.
If a number leaves remainder 2 when divided by 5, what is the remainder when its cube is divided by 5?
Correct answer: C
Step 1: For the cube, consider (2^3=8). Step 2: (8=5\times1+3), so the cube leaves remainder 3. Step 3: In powers, first raise the small remainder to the power.
When an integer is divided by 4, what remainders can its square have?
Correct answer: A
Step 1: The possible remainders of a number are 0, 1, 2, and 3. Step 2: The square remainders are respectively 0, 1, 0, and 1. Step 3: A square divided by 4 never leaves remainder 2 or 3.
If (N) leaves remainder 11 when divided by 18, what is the remainder when (N+25) is divided by 18?
Correct answer: A
Step 1: The remainder of (N) is 11. Step 2: Adding 25 gives total remainder (11+25=36), and 36 is exactly divisible by 18. Step 3: After addition, divide the total remainder again by the divisor.
Which option shows an invalid remainder for Euclid’s division lemma when the divisor is 19?
Correct answer: C
Step 1: When the divisor is 19, the remainder can be from 0 to 18. Step 2: 19 is equal to the divisor, so it cannot be a remainder. Step 3: In remainder-range questions, watch carefully for the option equal to the divisor.
Step 1: (53\times27=1431). Step 2: (1441-1431=10), so the remainder is 10. Step 3: While dividing, choose the multiple that does not exceed the number.
If (t=16q+9), what is the remainder when (2t+3) is divided by 16?
Correct answer: A
Step 1: The remainder of (t) is 9. Step 2: The remainder part of (2t+3) is (2\times9+3=21), and (21=16+5). Step 3: Do not forget to reduce the final remainder below 16.
If a number leaves remainder 3 when divided by 20, what is the remainder when five times the number is divided by 20?
Correct answer: C
Step 1: Let the number be (20q+3). Step 2: For five times the number, the remainder is (5\times3=15), which is less than 20. Step 3: In multiplication, multiply the remainder and check the limit.
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