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
Medium · Level 1 · real-numbers,euclid-division-lemma,remainderView options
(0)
(1)
(7)
(8)
Medium · Level 1 · real-numbers,quotient-remainder,division-lemmaView options
(q=7, r=3)
(q=8, r=-2)
(q=6, r=8)
(q=5, r=13)
Medium · Level 1 · real-numbers,possible-remainders,euclid-lemmaView options
(0,1,2,3,4,5)
(1,2,3,4,5,6)
(0,1,2,3,4,5,6)
(2,3,4,5,6,7)
Medium · Level 1 · real-numbers,find-number,division-algorithmView options
(34)
(36)
(38)
(42)
Medium · Level 1 · real-numbers,remainder-condition,conceptView options
(0 \le r < b)
(0 < r \le b)
(r>b)
(r=b)
Medium · Level 1 · real-numbers,euclidean-form,quotient-remainderView options
(72=10 \times 6+12)
(72=10 \times 7+2)
(72=10 \times 8-8)
(72=10 \times 5+22)
Medium · Level 1 · real-numbers,even-odd,general-formView options
(2q) and (2q+1)
(2q+1) and (2q+2)
(q) and (q+2)
(2q-2) and (2q+2)
Medium · Level 1 · real-numbers,remainder,division-practiceView options
(5)
(6)
(7)
(8)
Medium · Level 1 · real-numbers,remainder-rule,concept-checkView options
Because the remainder must be less than (11)
Because the remainder is always (1)
Because the quotient is always (11)
Because the dividend is always smaller
Medium · Level 1 · real-numbers,quotient,euclid-divisionView options
(6)
(7)
(8)
(9)
Medium · Level 1 · real-numbers,remainder,quotient-remainderView options
(9)
(10)
(11)
(12)
Medium · Level 1 · real-numbers,identify-remainder,algebraic-formView options
(5)
(8)
(13)
(q)
Medium · Level 1 · real-numbers,general-form,remainder-conditionView options
(4q)
(4q+1)
(4q+2)
(4q+4)
Medium · Level 1 · real-numbers,euclidean-form,divisionView options
(123=20 \times 5+23)
(123=20 \times 6+3)
(123=20 \times 7-17)
(123=20 \times 4+43)
Medium · Level 1 · real-numbers,terms,division-lemmaView options
Dividend
Divisor
Quotient
Remainder
Medium · Level 1 · real-numbers,greatest-remainder,exam-tipView options
(14)
(15)
(16)
(0)
Medium · Level 1 · real-numbers,small-dividend,euclid-lemmaView options
(q=1, r=-6)
(q=0, r=17)
(q=1, r=17)
(q=0, r=23)
Medium · Level 1 · real-numbers,remainder,calculationView options
(0)
(1)
(12)
(13)
Medium · Level 1 · real-numbers,adjust-remainder,algebraView options
(a=9q+12)
(a=9(q+1)+3)
(a=9(q+2)-6)
(a=9(q-1)+21)
Medium · Level 1 · real-numbers,general-form,not-possibleView options
(3q)
(3q+1)
(3q+2)
(3q+3)
Question 1MediumLevel 1
According to Euclid’s division lemma, what is the remainder when (a=56) and (b=7)?
Correct answer: A
Step 1: Dividing (56) by (7) gives (7 \times 8=56). Step 2: Nothing is left so the remainder is (0). Step 3: When the dividend is a multiple of the divisor, the remainder is always (0).
If (a=38) and (b=5), what are (q) and (r) in (a=bq+r)?
Correct answer: A
Step 1: The nearest multiple of (5) below (38) is (35). Step 2: (38-35=3), so (q=7) and (r=3). Step 3: In the correct answer, the remainder must be less than (5).
What possible remainders can occur when a positive integer is divided by (6)?
Correct answer: A
Step 1: A remainder may start from (0). Step 2: The remainder is always less than the divisor, so division by (6) gives remainders from (0) to (5). Step 3: Do not include the divisor itself while listing possible remainders.
If a number gives quotient (4) and remainder (2) when divided by (9), what is the number?
Correct answer: C
Step 1: Use the form (a=bq+r). Step 2: (a=9 \times 4+2=36+2=38). Step 3: In such questions, first multiply the divisor and quotient, then add the remainder.
In Euclid’s division lemma (a=bq+r), what is the correct range of (r)?
Correct answer: A
Step 1: In Euclid’s division lemma, the remainder is not negative. Step 2: The remainder is smaller than the divisor, so (0 \le r < b) is correct. Step 3: Avoid the common mistake of allowing (r=b).
If (n) is divided by (2), what are the possible forms of (n)?
Correct answer: A
Step 1: When divided by (2), the remainder can be (0) or (1). Step 2: So the number has the form (2q) or (2q+1). Step 3: This idea is the base for understanding even and odd numbers.
Step 1: (8 \times 5=40) and (8 \times 6=48). Step 2: Since (48) is greater, take (40) and get (47-40=7). Step 3: If the next multiple is greater, use the previous multiple.
A number divided by (11) is said to have remainder (11). Why is this incorrect?
Correct answer: A
Step 1: The condition for the remainder is (0 \le r < b). Step 2: Here (b=11), so (r=11) is not valid. Step 3: The remainder is never equal to the divisor.
What is the quotient when (95) is divided by (12)?
Correct answer: B
Step 1: (12 \times 7=84) and (12 \times 8=96). Step 2: Since (96) is greater than (95), the quotient is (7). Step 3: The quotient is the greatest integer whose product with the divisor does not exceed the dividend.
When a positive integer is divided by (4), which form cannot be a standard remainder form?
Correct answer: D
Step 1: On division by (4), possible remainders are (0,1,2,3). Step 2: In (4q+4), the remainder is (4), which equals the divisor. Step 3: Such a form should be written as (4(q+1)).
Step 1: In (a=bq+r), (a) is the dividend and (b) is the divisor. Step 2: (q) represents the quotient. Step 3: Remembering the names of symbols makes the formula easier to use.
What is the greatest possible remainder when a number is divided by (15)?
Correct answer: A
Step 1: The greatest remainder is one less than the divisor. Step 2: On division by (15), the greatest remainder is (15-1=14). Step 3: When greatest remainder is asked, use (b-1).
If (a=17) and (b=23), what are the correct values in (a=bq+r)?
Correct answer: B
Step 1: The dividend (17) is smaller than the divisor (23). Step 2: So the quotient is (0) and the remainder remains (17). Step 3: When the dividend is smaller than the divisor, remember to take (q=0).
If (a=9q+12), what is its correct Euclidean form for division by (9)?
Correct answer: B
Step 1: The remainder must be less than (9). Step 2: (12=9+3), so (9q+12=9(q+1)+3). Step 3: If the leftover part is greater than the divisor, divide it again.
Which form is not possible as a standard form when a positive integer is divided by (3)?
Correct answer: D
Step 1: On division by (3), possible remainders are (0,1,2). Step 2: In (3q+3), the remainder is (3), which equals the divisor. Step 3: It should be written as (3(q+1)).
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