NCERT Solutions Ganita Prakash (Part 1) Chapter 5 A Shortcut for Divisibility by 11 — In-text Questions

Book page 128 Updated on2026-09-05

Q1.
If this difference is 11 or a multiple of 11, what does that say about the remainder obtained when the number is divisible by 11?
Answer

The remainder is 0 — the number is exactly divisible by 11.

In the book's example, 320185:
excess = 2 + 1 + 5 = 8, short = 3 + 0 + 8 = 11
8 – 11 = – 3 → 3 short of a multiple of 11

Now suppose the difference had come out as 11, or 22, or – 11. That leftover is itself a whole number of 11s, so it joins the multiple of 11 already built up and nothing at all remains.

Why it happens: the number equals (a multiple of 11) + (the difference). If the difference is also a multiple of 11, the total is a multiple of 11 plus a multiple of 11 — still a multiple of 11, by the rule that a | M and a | N gives a | M + N.
Tip: if the difference is negative, add 11 (or a multiple of 11) to it to read off the remainder. A difference of – 3 means remainder 11 – 3 = 8.
Q2.
Using this shortcut, find out whether the following numbers are divisible by 11. Further, find the remainder if the number is not divisible by 11. (i) 158 (ii) 841 (iii) 481 (iv) 5529 (v) 90904 (vi) 857076
Answer

Attach alternating '+' and '–' signs starting from the units digit.

NumberAlternating sumValueConclusion
(i) 1588 – 5 + 14Not divisible; remainder 4
(ii) 8411 – 4 + 85Not divisible; remainder 5
(iii) 4811 – 8 + 4– 3Not divisible; remainder 8 (= 11 – 3)
(iv) 55299 – 2 + 5 – 57Not divisible; remainder 7
(v) 909044 – 0 + 9 – 0 + 922Divisible by 11
(vi) 8570766 – 7 + 0 – 7 + 5 – 8– 11Divisible by 11

Verification by actual division:

158 = 11 × 14 + 4 ✓   841 = 11 × 76 + 5 ✓
481 = 11 × 43 + 8 ✓   5529 = 11 × 502 + 7 ✓
90904 = 11 × 8264 ✓   857076 = 11 × 77916 ✓
Tip: in (iii) the alternating sum was negative. A negative answer of – r means the number is r short of a multiple of 11, so the remainder is 11 – r. In (v) the answer 22 is a multiple of 11, which counts as 0 left over.
Was this helpful? Report an error