Introduction to Number System for RRB Exams

If you are preparing for Indian Railway Recruitment Board (RRB) examinations such as RRB NTPC (Non-Technical Popular Categories), RRB Group D, RRB Technician Grade I, or RRB Technician Grade III, there is one foundational Mathematics topic you simply cannot afford to skip: the Number System. Whether you are calculating quick remainders, testing the divisibility of a massive ten-digit number, or finding the unit digit of an exponential expression, the Number System forms the absolute backbone of the Quantitative Aptitude section.

Many aspirants treat the Number System lightly, assuming it only involves basic school-level arithmetic. However, in the actual Computer-Based Test (CBT), RRB frames clever, time-consuming questions around prime numbers, recurring decimals, factors, remainder theorems, and divisibility rules. Without the right conceptual clarity and speed shortcuts, a single question can eat up two to three precious minutes. Conversely, once you master the patterns and tricks in this chapter, you can solve most Number System questions in under 15 to 20 seconds with 100% accuracy.

In this comprehensive guide, we will break down every single sub-topic of the Number System tailored specifically to the latest TCS/RRB exam pattern. From classification of numbers and divisibility rules to unit digit cyclicity, trailing zeros, and previous year solved examples, everything you need to score full marks is organized right here.

Topic Weightage and Importance

In the Mathematics section of RRB exams, the Number System is consistently one of the highest-weightage topics. Because concepts from the Number System also overlap with Simplification, LCM and HCF, and Algebra, mastering this chapter creates a multiplier effect across your entire Quantitative Aptitude score.

RRB Exam StageTotal Maths QuestionsExpected Questions from Number SystemDifficulty Level
RRB NTPC CBT-1302 to 4 QuestionsEasy to Moderate
RRB NTPC CBT-2353 to 5 QuestionsModerate
RRB Group D (CBT)252 to 4 QuestionsEasy to Moderate
RRB Technician Grade I & III20 - 252 to 3 QuestionsModerate

As seen in recent railway recruitment cycles, questions frequently focus on four high-yield areas: composite divisibility rules (like 72, 88, and 99), unit digit calculation, converting recurring decimals into fractions, and finding the number of factors or trailing zeros. Securing these 3 to 5 marks effortlessly gives you a decisive edge over lakhs of competitors, especially when cut-offs are decided by fractions of a mark.

Key Concepts and Formulas

Let us systematically build your toolkit from the ground up, covering every essential concept, theorem, and shortcut formula required for RRB exams.

1. Classification of Numbers

Understanding how numbers are categorized prevents silly mistakes in statement-based questions that RRB loves to ask.

  • Natural Numbers (\(N\)): Counting numbers starting from 1, i.e., \(1, 2, 3, 4, \dots\). Note that 0 is not a natural number.
  • Whole Numbers (\(W\)): All natural numbers including zero, i.e., \(0, 1, 2, 3, \dots\).
  • Integers (\(Z\)): All positive numbers, negative numbers, and zero, i.e., \(\dots, -3, -2, -1, 0, 1, 2, 3, \dots\). Zero is neither positive nor negative.
  • Rational Numbers (\(Q\)): Numbers that can be expressed in the form \(\frac{p}{q}\), where \(p\) and \(q\) are integers and \(q \neq 0\). Examples: \(\frac{3}{4}, -5, 0.25, 0.\overline{3}\).
  • Irrational Numbers: Numbers that cannot be written as \(\frac{p}{q}\) and have non-terminating, non-repeating decimal expansions. Examples: \(\sqrt{2}, \sqrt{5}, \pi, e\). Remember: \(\frac{22}{7}\) is rational, whereas \(\pi\) is irrational!
  • Prime Numbers: Natural numbers greater than 1 that have exactly two distinct factors: 1 and the number itself. Examples: \(2, 3, 5, 7, 11, 13\). Important exam facts: 2 is the smallest and only even prime number; 1 is neither prime nor composite; there are 25 prime numbers from 1 to 100 (15 from 1 to 50, and 10 from 51 to 100).
  • Composite Numbers: Natural numbers greater than 1 that have more than two factors. The smallest composite number is 4, and the smallest odd composite number is 9.
  • Co-prime Numbers: Any two numbers whose Highest Common Factor (HCF) is 1. They do not necessarily have to be prime individually. Example: \((8, 15)\) or \((14, 25)\).
  • Twin Prime Numbers: Two prime numbers with a difference of 2. Examples: \((3, 5), (5, 7), (11, 13), (17, 19)\).

2. Master Table of Divisibility Rules

Divisibility questions are the absolute favorites of RRB exam setters. Memorizing these rules will help you eliminate wrong options in seconds.

DivisorDivisibility RuleQuick Example
2The last digit must be even (0, 2, 4, 6, or 8).458 ends in 8 (Divisible)
3The sum of all digits must be divisible by 3.531: \(5+3+1=9\) (Divisible)
4The number formed by the last 2 digits must be divisible by 4.7824: 24 is divisible by 4
5The last digit must be either 0 or 5.945 ends in 5 (Divisible)
6The number must be divisible by both 2 and 3.732 is even and \(7+3+2=12\)
7Double the last digit and subtract it from the remaining number; repeat until small enough to check by 7.343: \(34 - (2 \times 3) = 28\) (Divisible)
8The number formed by the last 3 digits must be divisible by 8. Shortcut: If the 3rd-last digit is even, check the last 2 digits by 8; if odd, add 4 to the last 2 digits and check by 8.9512: 512 is divisible by 8 (Odd 3rd-last: \(12+4=16\), divisible by 8)
9The sum of all digits must be divisible by 9.8379: \(8+3+7+9=27\) (Divisible)
11The difference between the sum of digits at odd places and the sum of digits at even places is either 0 or a multiple of 11.1364: \((1+6)-(3+4) = 0\) (Divisible)
13Multiply the last digit by 4 and add it to the remaining truncated number; repeat and check for a multiple of 13.169: \(16 + (9 \times 4) = 52\) (Divisible)

Composite Divisibility Trick (72, 88, 99, 36, 45): To test divisibility by a large composite number \(D\), split \(D\) into two co-prime factors. For example, for 72, check 8 and 9 (never 6 and 12, as they are not co-prime!). For 88, check 8 and 11. For 99, check 9 and 11. For 45, check 5 and 9.

3. Unit Digit Concepts and Cyclicity

Finding the last digit (unit digit) of large powers like \(237^{543}\) relies on the cyclicity rule. Every digit from 0 to 9 repeats its unit digit after a fixed cycle of powers.

  • Digits with Cyclicity 1 (0, 1, 5, 6): No matter what positive integer power you raise them to, the unit digit never changes. For example, \((126)^{999}\) always ends in 6, and \((435)^{248}\) always ends in 5.
  • Digits with Cyclicity 2 (4, 9):
    • For 4: \(4^{\text{odd}}\) ends in 4; \(4^{\text{even}}\) ends in 6.
    • For 9: \(9^{\text{odd}}\) ends in 9; \(9^{\text{even}}\) ends in 1.
  • Digits with Cyclicity 4 (2, 3, 7, 8): Divide the exponent \(n\) by 4 and find the remainder \(r\).
    • If \(r = 1, 2,\) or \(3\), the unit digit is the unit digit of \((\text{base unit digit})^r\).
    • If \(r = 0\) (completely divisible by 4), always replace the power with 4, i.e., calculate \((\text{base unit digit})^4\).

4. Remainder Theorem and Division Algorithm

The fundamental division formula connects dividend, divisor, quotient, and remainder:

$$\text{Dividend} = (\text{Divisor} \times \text{Quotient}) + \text{Remainder}$$

Negative Remainder Concept: While the actual remainder is always non-negative (\(0 \le r < \text{divisor}\)), using negative remainders temporarily makes tough exponential calculations effortless. For example, when 17 is divided by 18, the positive remainder is 17, and the negative remainder is \(-1\) (since \(17 - 18 = -1\)). If your final answer comes out negative, simply add the divisor to get the positive remainder.

Important Polynomial Divisibility Identities:

  • \(a^n - b^n\) is always divisible by \((a - b)\) for all natural numbers \(n\).
  • \(a^n - b^n\) is divisible by \((a + b)\) when \(n\) is even.
  • \(a^n + b^n\) is divisible by \((a + b)\) when \(n\) is odd.

5. Factors (Divisors) of a Number

Suppose a composite number \(N\) is written in its prime factorization form: $$N = 2^a \times p^b \times q^c$$ where \(p\) and \(q\) are odd prime numbers. Then:

  • Total Number of Factors: $$(a + 1)(b + 1)(c + 1)$$
  • Number of Odd Factors: Ignore the power of 2 completely: $$(b + 1)(c + 1)$$
  • Number of Even Factors: $$a(b + 1)(c + 1)$$ (or Total Factors minus Odd Factors)
  • Sum of All Factors: $$\left(\frac{2^{a+1} - 1}{2 - 1}\right) \times \left(\frac{p^{b+1} - 1}{p - 1}\right) \times \left(\frac{q^{c+1} - 1}{q - 1}\right)$$
  • Product of All Factors: $$N^{\frac{\text{Total Factors}}{2}}$$

6. Number of Trailing Zeros in Factorials

A trailing zero is created by a pair of \((2 \times 5)\). In any factorial \(n! = 1 \times 2 \times 3 \times \dots \times n\), 2 appears far more frequently than 5. Therefore, the number of trailing zeros equals the highest power of 5 in \(n!\):

$$\text{Number of Zeros} = \left\lfloor \frac{n}{5} \right\rfloor + \left\lfloor \frac{n}{25} \right\rfloor + \left\lfloor \frac{n}{125} \right\rfloor + \left\lfloor \frac{n}{625} \right\rfloor + \dots$$

Here, \(\lfloor x \rfloor\) denotes the greatest integer (floor) value obtained by ignoring the decimal part after division.

7. Recurring Decimals to Fractions

To convert a recurring decimal like \(0.ab\overline{cd}\) into \(\frac{p}{q}\) form without forming equations, use this direct shortcut:

$$\text{Fraction} = \frac{(\text{Complete number after decimal}) - (\text{Non-repeating digits})}{\text{As many 9s as repeating digits, followed by as many 0s as non-repeating digits}}$$

For example, $$0.2\overline{37} = \frac{237 - 2}{990} = \frac{235}{990} = \frac{47}{198}$$.

8. Essential Sum Formulas for Series

  • Sum of first \(n\) natural numbers: $$S_n = \frac{n(n+1)}{2}$$
  • Sum of squares of first \(n\) natural numbers: $$\sum n^2 = \frac{n(n+1)(2n+1)}{6}$$
  • Sum of cubes of first \(n\) natural numbers: $$\sum n^3 = \left[\frac{n(n+1)}{2}\right]^2$$
  • Sum of first \(n\) odd natural numbers: $$n^2$$
  • Sum of first \(n\) even natural numbers: $$n(n+1)$$

Solved Examples (Step-by-Step)

Let us apply these formulas to four classic RRB exam-level problems so you can see exactly how to execute them during the test.

Example 1: Composite Divisibility (72 Rule)

Problem: If the 9-digit number \(389x6378y\) is completely divisible by 72, find the value of \(\sqrt{6x + 7y}\).

Step-by-Step Solution:

  • Step 1: Break 72 into two co-prime factors: \(72 = 8 \times 9\). The number must be divisible by both 8 and 9.
  • Step 2 (Apply rule of 8): The last three digits \(78y\) must be divisible by 8. Dividing 780 by 8 gives a quotient of 97 and remainder 4. To make it divisible by 8, we need 4 more, so \(784 \div 8 = 98\). Hence, \(y = 4\).
  • Step 3 (Apply rule of 9): Now substitute \(y = 4\) and add all the digits: $$3 + 8 + 9 + x + 6 + 3 + 7 + 8 + 4 = 48 + x$$.
  • Step 4: For \(48 + x\) to be divisible by 9, the nearest multiple of 9 greater than 48 is 54. Thus, $$48 + x = 54 \implies x = 6$$. (Since \(x\) is a single digit from 0 to 9, \(x = 6\) is the unique value).
  • Step 5: Substitute \(x = 6\) and \(y = 4\) into the expression: $$\sqrt{6(6) + 7(4)} = \sqrt{36 + 28} = \sqrt{64} = 8$$.

Answer: 8

Example 2: Unit Digit of Complex Products

Problem: Find the unit digit of the expression \((173)^{45} \times (244)^{28} \times (397)^{99}\).

Step-by-Step Solution:

  • Step 1: Focus only on the unit digit of each base number: \(3^{45} \times 4^{28} \times 7^{99}\).
  • Step 2: For \(3^{45}\), the cyclicity of 3 is 4. Divide 45 by 4: remainder is 1. So the unit digit is \(3^1 = 3\).
  • Step 3: For \(4^{28}\), the exponent 28 is an even number. Remember our shortcut: \(4^{\text{even}}\) always ends in 6.
  • Step 4: For \(7^{99}\), the cyclicity of 7 is 4. Divide 99 by 4: \(99 = 4 \times 24 + 3\), so remainder is 3. The unit digit is \(7^3 = 343\), which ends in 3.
  • Step 5: Multiply the three unit digits together: $$3 \times 6 \times 3 = 54$$. The unit digit of 54 is 4.

Answer: 4

Example 3: Remainder Theorem Using Negative Remainder

Problem: What is the remainder when \((67^{67} + 67)\) is divided by 68?

Step-by-Step Solution:

  • Step 1: Divide each term individually by 68 using the negative remainder concept.
  • Step 2: When 67 is divided by 68, the remainder is \(-1\) (because \(67 = 68 \times 1 - 1\)).
  • Step 3: Replace 67 with \(-1\) in the expression: $$(-1)^{67} + (-1)$$.
  • Step 4: Since 67 is an odd power, \((-1)^{67} = -1\). Adding the second term gives $$-1 + (-1) = -2$$.
  • Step 5: A final remainder cannot be negative, so add the divisor 68 to \(-2\): $$68 - 2 = 66$$.

Answer: 66

Example 4: Total, Odd, and Even Factors

Problem: Find the total number of factors, odd factors, and even factors of 720.

Step-by-Step Solution:

  • Step 1: Perform prime factorization of 720: $$720 = 72 \times 10 = (8 \times 9) \times (2 \times 5) = (2^3 \times 3^2) \times (2^1 \times 5^1) = 2^4 \times 3^2 \times 5^1$$.
  • Step 2 (Total Factors): Add 1 to every exponent and multiply: $$(4+1)(2+1)(1+1) = 5 \times 3 \times 2 = 30$$.
  • Step 3 (Odd Factors): Ignore the power of 2 (\(2^4\)) and multiply the incremented exponents of the odd primes: $$(2+1)(1+1) = 3 \times 2 = 6$$.
  • Step 4 (Even Factors): Subtract odd factors from total factors: $$30 - 6 = 24$$. (Alternatively, use \(a(b+1)(c+1) = 4 \times 3 \times 2 = 24\)).

Answer: Total Factors = 30, Odd Factors = 6, Even Factors = 24

Common Mistakes to Avoid

Even well-prepared candidates lose easy marks in the Number System because of small conceptual traps. Watch out for these frequent errors:

  • Assuming 1 is a Prime Number: Remember, 1 has only one factor (itself), whereas a prime number must have exactly two distinct factors. Always start counting prime numbers from 2.
  • Using Non-Coprime Factors for Divisibility: A common error when checking divisibility by 12 or 72 is splitting 12 into \(2 \times 6\) or 72 into \(6 \times 12\). This gives wrong answers because 2 and 6 are not co-prime (for instance, 18 is divisible by both 2 and 6, yet not by 12). Always choose co-prime pairs like \((3, 4)\) for 12 and \((8, 9)\) for 72.
  • Taking Power as 0 in Unit Digit Calculations: When the exponent is completely divisible by 4 (such as \(2^{40}\)), students often compute \(2^0 = 1\), which is completely wrong! When the remainder is 0, you must raise the base unit digit to the 4th power: \(2^4 = 16 \implies 6\).
  • Forgetting to Convert Negative Remainders Back: If your calculation yields a remainder of \(-3\) when dividing by 19, never stop there. Always add the divisor back (\(19 - 3 = 16\)) to get the true remainder.
  • Miscounting Digits in Recurring Decimals: In numbers like \(0.12\overline{3}\), remember to put one 9 for the single repeating digit (3) and two 0s for the two non-repeating digits (1 and 2) in the denominator, giving 900.
  • Ignoring