# Practice Questions on Remainder Theorem and Unit Digit for SSC

Number system is the most fundamental topic in mathematics, one of whose subtopics include remainder theorem and unit digit. In today’s blog we will be providing you with some practice questions on remainder theorem and unit digit for SSC. First of all, let us go through the basic concepts.

## Important concepts of Remainder theorem and unit digit

### Basic remainder formula:

Dividend = Divisor * Quotient + Remainder

If remainder = 0, then it the number is perfectly divisible by divisor.

Note: If we have a negative remainder (which was assumed for the convenience during solving of the problem), the divisor is to be added to get the real remainder.

### Cyclicity:

Cyclicity is an important concept which can be used to solve questions on remainder theorem and unit digit.

Numbers    Cyclicity
0, 1, 5, 6     1
2, 3, 7, 8   4
4, 9      2

Take a Free SSC CGL Tier 2 Mock Test for Quant

### Euler’s Remainder theorem:

Euler’s Remainder theorem: For co-prime numbers M and N, Remainder [ME(N) / N] = 1, where E(N) is Euler number of N .

If N= an * bs * cm * du * f r such that a, b, c, d, f are prime numbers

Euler’s number of N = N (1 – 1/a)*(1 – 1/b)*(1 – 1/c)*(1 – 1/d)* (1 – 1/f)

## Remainder theorem and unit digit: Some Important Points to Remember

• (a+ bn) is divisible by (a + b), when n is odd.
• (a– bn) is divisible by (a + b), when n is even.
• (an – bn) is always divisible by (a – b), for every n.
• Remainder (a*b/c) = Remainder ((Remainder(a/c) * Remainder(b/c))/c).

## Practice questions on remainder theorem and unit digit

1)  What is the unit digit of 1! + 2! + 3! + ……+ 88! + 89!?

(a) 5

(b) 3

(c) 1

(d) 8

Solution:

1! =1

2! = 2

3! = 6

4! = 24

5! = 120

6! = 620…..

The unit digit of factorial of any number greater than 4 is 0. Hence,

Unit digit of 1! + 2! + 3! + ……+ 88! + 89! = Unit digit of 1 + 2 + 6 + 4 + 0 + 0 + ……+ 0

= Unit digit of 13 = 3

Take a Free SSC CGL Tier 2 Mock Test for Quant

2) If 3 divided the integer n, the remainder is 2. Then, what will be the remainder when 7n is divided by 3

(a) 3

(b) 2

(c) 6

(d) 4

Solution:

Remainder (7n/3) = Remainder ((Remainder (7/3) * Remainder(n/3))/3) = Remainder (1*2/3) = 2

Download FREE e-books on various topics of Quant here

3) What is the remainder when 1294*1298 is divided by 16.

(a) 14

(b) 11

(c) 12

(d) 10

Solution:

16*81 =1296

Remainder (1294/16) = -2 {1294 = 16*81 – 2}

Remainder (1298/16) = 2 {1298 = 16*81 + 2}

Remainder (1294*1298/16) = -2*2 = -4 = -4+16 = 12

Take a Free SSC CGL Tier 2 Mock Test for Quant

4) 310 + 510 is divisible by

(a) 34

(b) 26

(c) 8

(d) 20

Solution:

310 + 510 = 95 + 255

We know, (a+ bn) is divisible by (a + b), when n is odd.

So,

310 + 510 is divisible by 9 + 25 = 34

Download FREE e-books on various topics of Quant here

5) What is remainder obtained if 45518 is divided by 19

(a) 0

(b) 3

(c) 4

(d) 1

Solution:

Since 19 is prime, Euler’s number of 19 = 19 (1 – 1/19) = 18

Hence, by Euler’s remainder theorem, the remainder = 1

Take a Free SSC CGL Tier 2 Mock Test for Quant

6) What is the remainder of 15+25+ 35 + 45 + 55 + 65+75+…..+ 505 when divided by 5

(a) 3

(b) 4

(c) 2

(d) 0

Solution:

When the power ‘5’ is divided by cyclicity of the numbers 0, 1, 5 and 6, the remainder = 1

When the power ‘5’ is divided by cyclicity of the numbers 2, 3, 7 and 8, the remainder = 1

When the power ‘5’ is divided by cyclicity of the numbers 4 and 9, the remainder = 1

15+25+ 35 + 45 + 55 + 65+75+…..+ 505 =11+21+ 31 + 41 + 51 + 61+71+…..+ 501 = Sum of first 50 natural numbers = 50*51/2 = 1275, divisible by 5 and hence remainder = 0

Take a Free SSC CGL Tier 2 Mock Test for Quant

7) What is the unit digit of 287*586*878

(a) 6

(b) 9

(c) 2

(d) 4