# Remainders of a set of multiple numbers

Sometimes we are given a remainder(s) that is/are got on:

• dividing a set of different numbers with the same divisor.
• dividing the same number with different divisors.

Let’s see the different cases that emerge in such cases and how to approach them.

## Case 1: Common remainder (dividend is same, divisors vary)

Let us consider the case where the number being divided is the same, but divisors vary.

If we get the same remainder r, when a number is divided by different divisors (say x, y or z), then:

The number is of the form:
k (LCM of x, y and z) + r
(where k is any whole number)

When k = 0, then the number is the remainder itself (and is less than the divisor). It will be the least possible value of such a number.

##### Q. Find the highest two digit number which leaves a remainder of 3, when it is divided by 6 or 9?

Explanation:

The number will be of the form: k (LCM of 6 and 9) + 3 = 18k + 3

If k = 0; 18k + 3 = 3
If k = 1; 18k + 3 = 21
If k = 2; 18k + 3 = 39
If k = 3; 18k + 3 = 57
If k = 4; 18k + 3 = 75
If k = 5; 18k + 3 = 93
If k = 6; 18k + 3 = 111

Therefore the required two digit number = 93.

##### Q. A number when divided by 4, 5, 6, and 7 leaves a remainder of 3, but when divided by 9 leaves no remainder. What is the sum of digits of such smallest possible number?
(a) 12         (b) 9          (c) 6          (d) 15

Explanation:

The number required leaves a remainder of 3 when divided by 4, 5, 6, and 7.
Thus, it must be of the format = k X (LCM of 4, 5, 6 and 7) + 3, where k is any integer.

LCM of (4, 5, 6 and 7) = 420.
Thus, the required number = 420k + 3

We know that this number is divisible by 9. As we need the least possible number, we should seek for the minimum value of k.
Now for k = 1, the required number = 423 which is divisible by 9. Hence, it is the required number.

Sum of its digit = 4 + 2 + 3 = 9

## Case 2: Common Negative Remainder (dividend is same, divisors vary)

Here again, the number being divided is the same, but divisors vary.

If we get the same negative remainder -r when a number is divided by different divisors (say x, y or z), then:

The number is of the form:
k (LCM of x, y and z) - r
(where k is any natural number)

When k = 1, then we get the least possible value of such a number.

##### Q. Find the highest two digit number which leaves remainders of 3 and 6, when it is divided by 6 and 9 respectively?

Explanation:

Negative remainder = Divisor – Positive Remainder = 6 – 3 (or 9 - 6) = 3

The number will be of the form: k (LCM of 6 and 9) - 3 = 18k - 3

If k = 1; 18k - 3 = 15
If k = 2; 18k - 3 = 33
If k = 3; 18k - 3 = 51
If k = 4; 18k - 3 = 69
If k = 5; 18k - 3 = 87
If k = 6; 18k - 3 = 105

Therefore the required two digit number = 87.

## Case 3: Different remainders (dividend is same, divisors vary)

Let us see the cases where the divisors, as well as the remainders (positive or negative) are different, but the number being divided is the same.

##### Q. Find the smallest single digit and double digit number which leaves remainders 3 and 8 when divided by 5 and 9 respectively.

Explanation:

Let the number be ‘N’.
Remainder (N/5) = 3 & Remainder (N/9) = 8
Therefore, we can write the number as, N = 5q + 3 Or N = 9p + 8
(where ‘q’ and ‘p’ are quotients, and whole numbers).

So, 5q + 3 = 9p + 8
Or 5q = 9p + 5

LHS of the equation (i.e. 5q) is a multiple of 5 for any natural number value of ‘q‘. So, the RHS must be a multiple of 5 too.

When p = 0, 9p + 5 = 5, which is multiple of 5. (It satisfies the above condition.)
So, the required smallest single digit number, N = 9p + 8 = (9 × 0) + 8 = 8

When p = 5, 9p + 5 = 50, which is multiple of 5. (It satisfies the above condition.)
So, the required smallest double digit number, N = 9p + 8 = (9 × 5) + 8 = 53

## Case 4: Common remainder (dividends vary, divisor is same)

In this case, the numbers being divided will vary, but divisor will be the same.

If we get the same remainder r when different numbers (say x, y or z) are divided by the same divisor, then:

The largest possible divisor = HCF [(x - y) (y - z) (z - x)] OR HCF [(x - y) (y - z)]

##### Q. Find the largest divisor which divides 43, 78 and 92, leaving the same remainder in each division.

Explanation:

Required divisor = HCF [92 − 78, 78 − 43] = HCF [14, 35] = 7

We can check that Remainder [$\frac{43}{7}$] = Remainder [$\frac{78}{7}$] = Remainder [$\frac{92}{7}$] = 1

## Case 5: Different remainders (dividends vary, divisor is same)

Here again, the numbers being divided will vary, but divisor will be the same.

If we get the remainders (say a, b and c) when different numbers (say x, y or z respectively) are divided by the same divisor, then:

The largest possible divisor = HCF [(x - a) (y - b) (z - c)]

##### Q. Find the largest divisor which divides 43, 78 and 99, leaving the remainders 5, 2 and 4 respectively.

Explanation:

Required divisor = HCF [43 − 5, 78 − 2, 99 - 4] = HCF [38, 76, 95] = 19

We can check that Remainder [$\frac{43}{19}$] = 5

Remainder [$\frac{78}{19}$] = 2

Remainder [$\frac{99}{19}$] = 4

Share on: