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™ 🇮🇳 इसी सोच के साथ बनाया गया है
Up to 20 questions from this page. Select your focus, then start.
20 questions
Choose questions
Hard · Level 3 · euclids-division-lemma,find-quotient-remainder,hardView options
(q=22, r=5)
(q=21, r=28)
(q=23, r=-18)
(q=20, r=51)
Hard · Level 3 · euclids-division-lemma,construct-number,quotient-remainderView options
764
765
720
721
Hard · Level 3 · euclids-division-lemma,difference-remainder,negative-adjustmentView options
10
11
12
13
Hard · Level 3 · euclids-division-lemma,consecutive-integers,proofView options
Because division by 6 gives the cycle of remainders 0, 1, 2, 3, 4, 5
Because all six numbers are divisible by 6
Because their sum is always 6
Because every second number is divisible by 6
Hard · Level 3 · euclids-division-lemma,remainder-addition,next-multipleView options
0
34
35
1
Hard · Level 3 · euclids-division-lemma,expression-remainder,hardView options
8
6
4
2
Hard · Level 3 · euclids-division-lemma,power-remainder,advancedView options
1
4
7
8
Hard · Level 3 · euclids-division-lemma,remainder-addition,divisibilityView options
0
6
12
18
Hard · Level 3 · euclids-division-lemma,mixed-expression,remainderView options
7
8
9
10
Hard · Level 3 · euclids-division-lemma,euclidean-form,valid-remainderView options
(1201=120\times10+1)
(1201=120\times11-119)
(1201=120\times9+121)
(1201=120\times8+241)
Hard · Level 3 · euclids-division-lemma,odd-square,remainder-8View options
0
1
4
7
Hard · Level 3 · euclids-division-lemma,multiple-remainder,hardView options
12
13
14
40
Hard · Level 3 · euclids-division-lemma,expression-remainder,squareView options
4
2
6
11
Hard · Level 3 · euclids-division-lemma,linear-combination,remainderView options
4
5
15
26
Hard · Level 3 · euclids-division-lemma,remainder-addition,large-numberView options
0
41
42
1
Hard · Level 3 · euclids-division-lemma,polynomial-expression,remainderView options
1
2
3
0
Hard · Level 3 · euclids-division-lemma,multiple-remainder,hardView options
18
20
138
23
Hard · Level 3 · euclids-division-lemma,valid-remainder,definitionView options
0
62
63
41
Hard · Level 3 · euclids-division-lemma,expression-remainder,identityView options
0
1
9
10
Hard · Level 3 · euclids-division-lemma,multi-term-remainder,advancedView options
0
1
21
42
Question 1HardLevel 3
Which option gives the correct (q) and (r) for (511=23q+r)?
Correct answer: A
Step 1: (23\times22=506) and (23\times23=529). Step 2: The nearest lower multiple of 23 below 511 is 506, so the remainder is 5. Step 3: Do not accept a negative remainder or a remainder greater than the divisor.
If a number gives quotient 16 and remainder 44 when divided by 45, what is the number?
Correct answer: A
Step 1: Number (=) divisor (\times) quotient (+) remainder. Step 2: (45\times16+44=720+44=764). Step 3: The remainder 44 is less than divisor 45, so the form is valid.
If (a) leaves remainder 3 when divided by 16 and (b) leaves remainder 9 when divided by 16, what is the remainder when (a-b) is divided by 16?
Correct answer: A
Step 1: For the difference, the remainder is (3-9=-6). Step 2: Add 16 to make it valid, giving 10. Step 3: In subtraction, add the divisor when the remainder becomes negative.
Why is at least one number among six consecutive integers divisible by 6?
Correct answer: A
Step 1: On division by 6, possible remainders are from 0 to 5. Step 2: Six consecutive integers cover all these remainders once. Step 3: The number with remainder 0 is divisible by 6.
If a number leaves remainder 34 when divided by 35, what is the remainder when 71 is added to it and the result is divided by 35?
Correct answer: A
Step 1: The original remainder is 34. Step 2: (71) leaves remainder 1 on division by 35, so total remainder (34+1=35), which becomes 0. Step 3: First reduce the large added number to a small remainder.
If (u=12q+5), what is the remainder when (u^2-u) is divided by 12?
Correct answer: A
Step 1: The remainder of (u) is 5. Step 2: The remainder of (u^2-u) comes from (5^2-5=20), and (20=12+8). Step 3: Substitute the remainder first, then find the final remainder.
A number leaves remainder 7 when divided by 9. What is the remainder when its fourth power is divided by 9?
Correct answer: B
Step 1: (7^2=49), which leaves remainder 4 on division by 9. Step 2: For (7^4), use (4^2=16), and 16 leaves remainder 7 on division by 9. Step 3: In higher powers, reduce the remainder after each step.
If a number leaves remainder 12 when divided by 18, what is the remainder after adding 6 to it?
Correct answer: A
Step 1: The number is (18q+12). Step 2: Adding 6 gives (18q+18=18(q+1)), so the remainder is 0. Step 3: When the remainder and the added number make the divisor, the new remainder becomes zero.
If (a=14q+9) and (b=14p+6), what is the remainder when (ab+a) is divided by 14?
Correct answer: A
Step 1: The remainders of (a) and (b) are 9 and 6. Step 2: The remainder of (ab+a) comes from (9\times6+9=63), and (63=14\times4+7). Step 3: In a mixed expression, handle the remainder of each term separately.
Which option gives the correct Euclidean form of dividing (1201) by (120)?
Correct answer: A
Step 1: In standard form, the remainder must be from 0 to 119. Step 2: (120\times10=1200), so (1201=1200+1). Step 3: Along with correct calculation, the valid range of the remainder is necessary.
If a number leaves remainder 1, 3, 5, or 7 when divided by 8, what is the remainder when its square is divided by 8?
Correct answer: B
Step 1: These remainders all represent odd numbers. Step 2: (1^2,3^2,5^2,7^2) all leave remainder 1 when divided by 8. Step 3: Remember that the square of an odd number leaves remainder 1 on division by 8.
If a number leaves remainder 5 when divided by 27, what is the remainder when 8 times the number is divided by 27?
Correct answer: B
Step 1: For eight times the number, the remainder part is (8\times5=40). Step 2: (40=27+13), so the final remainder is 13. Step 3: After multiplication, reduce the result below the divisor.
If (a=7q+3), what is the remainder when (a^2+2) is divided by 7?
Correct answer: A
Step 1: The remainder of (a) is 3. Step 2: The remainder of (a^2+2) comes from (3^2+2=11), and (11=7+4). Step 3: Substitute the remainder in the expression, then find the final remainder.
If (a) leaves remainder 6 when divided by 11 and (b) leaves remainder 8 when divided by 11, what is the remainder when (3a+b) is divided by 11?
Correct answer: A
Step 1: In (3a+b), the remainder part is (3\times6+8=26). Step 2: (26=11\times2+4), so the remainder is 4. Step 3: In multi-term expressions, handle the remainder of each term separately.
A number leaves remainder 41 when divided by 42. What is the remainder when 85 is added to the number and the result is divided by 42?
Correct answer: A
Step 1: The original remainder is 41. Step 2: (85) leaves remainder 1 on division by 42, so total remainder (41+1=42), which becomes 0. Step 3: When adding a large number, first find its smaller remainder.
If an integer leaves remainder 3 when divided by 4, what is the remainder when (n^2+n+1) is divided by 4?
Correct answer: A
Step 1: Replace (n) by its remainder 3. Step 2: The remainder of (n^2+n+1) comes from (3^2+3+1=13), and 13 leaves remainder 1 when divided by 4. Step 3: In polynomial-like expressions, substituting the remainder makes the solution direct.
If (a=30q+23), what is the remainder when (6a) is divided by 30?
Correct answer: A
Step 1: The remainder of (a) is 23. Step 2: For (6a), compute (6\times23=138), and (138=30\times4+18). Step 3: After multiplication, reduce the answer below the divisor.
If (r) is the remainder and the divisor is 63, which of the following is not a valid value of (r)?
Correct answer: C
Step 1: The remainder must satisfy (0\le r<63). Step 2: 63 is equal to the divisor, so it cannot be a valid remainder. Step 3: In definition-based questions, check the condition (r<b) first.
If (n=10q+9), what is the remainder when (n^2+2n+1) is divided by 10?
Correct answer: A
Step 1: (n^2+2n+1=(n+1)^2). Step 2: Since (n) has remainder 9, (n+1) has remainder 0, so its square is divisible by 10. Step 3: First recognize the structure of the expression to reduce calculation.
If (a=21q+17) and (b=21p+19), what is the remainder when (a+b+6) is divided by 21?
Correct answer: B
Step 1: Add the remainders: (17+19+6=42). Step 2: (42) is exactly divisible by 21, so the remainder should be 0. Step 3: In multi-term questions, add only the remainders and reduce at the end.
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