📌 Phrasal Verbs Learn with real exam usage 🔗 Fixed Prepositions Concept clarity with practice ⏱️ Tenses Rules • Examples • Tricks 📘 Grammar Rules All SSC rules in one place 🧠 One Word Substitution High-frequency SSC words 💬 Idioms & Phrases Meaning + usage 📐 Math Formula Fast revision for SSC 🧮 Math Calculator Instant calculation • Smart & Fast ✍️ SSC Spell Master Correct spelling • Exam focused
Skip to content
SSC Focus

Number System for SSC CGL 2027: Formulas, Divisibility Rules & PYQs

Number System for SSC CGL 2027 forms the bedrock of Quantitative Aptitude across Tier 1 and Tier 2. With TCS consistently asking 3 to 4 direct questions on divisibility, unit digit, remainder theorem, and factors, mastering this chapter gives you quick, guaranteed marks. This comprehensive guide covers complete formulas, divisibility shortcuts, cyclicity tables, and examination tips aligned with the latest SSC CGL exam patterns.

To plan your full quantitative syllabus alongside other subjects, explore our SSC Maths Hub, practice with interactive timers in our SSC Study Tools, and review the structured 1-year timeline in our SSC CGL 2027 Preparation Strategy for Beginners.

1. Classification of Numbers

Understanding the number hierarchy prevents conceptual errors in statement-based questions:

  • Natural Numbers (N): Counting numbers starting from 1: {1, 2, 3, 4, …}.
  • Whole Numbers (W): Natural numbers including zero: {0, 1, 2, 3, …}. Smallest whole number is 0.
  • Integers (Z): Positive and negative whole numbers: {…, -3, -2, -1, 0, 1, 2, 3, …}.
  • Rational Numbers (Q): Numbers expressible as p/q where p and q are integers and q ≠ 0 (e.g., 3/4, -7/2, 0.333…). Decimals are either terminating or recurring.
  • Irrational Numbers: Numbers that cannot be written as p/q with non-terminating, non-repeating decimal expansions (e.g., √2, √3, π, e).
  • Real Numbers (R): Union of all rational and irrational numbers.
  • Prime Numbers: Numbers greater than 1 having exactly two factors (1 and itself). 2 is the only even prime and smallest prime. (15 primes up to 50; 25 primes up to 100).
  • Composite Numbers: Natural numbers greater than 1 having more than 2 factors (e.g., 4, 6, 8, 9). 1 is neither prime nor composite.
  • Co-Prime Numbers: Any two numbers having HCF = 1 (e.g., 8 and 9, 15 and 28).
  • Perfect Numbers: Sum of proper divisors equals the number itself (e.g., 6 = 1+2+3; 28 = 1+2+4+7+14).

2. Complete Divisibility Rules (TCS SSC Patterns)

Divisibility rules are tested heavily in missing-digit questions (finding x and y if a 9-digit number is divisible by 72 or 88):

  • Divisibility by 2, 4, 8, 16: Check last n digits (2¹ = last digit even; 2² = last 2 digits div by 4; 2³ = last 3 digits div by 8; 2⁴ = last 4 digits div by 16).
  • Divisibility by 3 and 9: Sum of digits must be divisible by 3 or 9 respectively.
  • Divisibility by 5 and 25: Last digit 0 or 5 (for 5); last two digits 00, 25, 50, or 75 (for 25).
  • Divisibility by 6: Number must be divisible by both 2 and 3.
  • Divisibility by 7, 11, 13 (Universal 3-Digit Rule): Group into 3 digits from right to left. Alternate addition and subtraction of these 3-digit groups. If the result is divisible by 7, 11, or 13, the whole number is divisible.
  • Divisibility by 11 (Standard): (Sum of digits at odd places) – (Sum of digits at even places) = 0 or a multiple of 11.
  • Divisible by 72 (8 × 9): Check last 3 digits for 8, then sum of digits for 9.
  • Divisible by 88 (8 × 11): Check last 3 digits for 8, then odd/even difference for 11.
  • Divisible by 99 (9 × 11): Check sum of digits for 9 and alternating difference for 11.

3. Unit Digit and Cyclicity

Unit digit problems depend on the power cyclicity of each digit from 0 to 9:

  • Cyclicity 1 (0, 1, 5, 6): Any power of these numbers always ends in the same digit (5ⁿ always ends in 5; 6ⁿ always ends in 6).
  • Cyclicity 2 for 4: 4^(odd) ends in 4; 4^(even) ends in 6.
  • Cyclicity 2 for 9: 9^(odd) ends in 9; 9^(even) ends in 1.
  • Cyclicity 4 for 2: 2¹=2, 2²=4, 2³=8, 2⁴=6 (divide power by 4, use remainder).
  • Cyclicity 4 for 3: 3¹=3, 3²=9, 3³=7, 3⁴=1.
  • Cyclicity 4 for 7: 7¹=7, 7²=9, 7³=3, 7⁴=1.
  • Cyclicity 4 for 8: 8¹=8, 8²=4, 8³=2, 8⁴=6.
  • Factorial Unit Digits: For n ≥ 5, n! always ends in 0 because it contains factors of 2 and 5.

4. Remainder Theorem & Algebraic Remainder Formulas

Remainder questions can be solved quickly using standard modular arithmetic shortcuts:

  • Division Algorithm: Dividend = (Divisor × Quotient) + Remainder.
  • Negative Remainder Concept: If (17 / 18), remainder is -1. Thus (17³⁶ / 18) = (-1)³⁶ = +1 remainder.
  • Fermat’s Little Theorem: If p is prime and HCF(a, p) = 1, then a^(p-1) / p leaves remainder 1.
  • Algebraic Identity (Odd Power): (aⁿ + bⁿ) is always divisible by (a + b) when n is odd.
  • Algebraic Identity (All Powers): (aⁿ – bⁿ) is always divisible by (a – b) for all values of n.
  • Algebraic Identity (Even Power): (aⁿ – bⁿ) is divisible by both (a – b) and (a + b) when n is even.

5. Factors and Number of Zeroes

For any number N expressed as prime factors N = pᵃ · qᵇ · rᶜ:

  • Total Number of Factors: (a + 1)(b + 1)(c + 1).
  • Number of Odd Factors: Ignore 2ᵃ and take factors of remaining prime powers: (b + 1)(c + 1).
  • Number of Even Factors: Total Factors – Odd Factors = a(b + 1)(c + 1).
  • Sum of Factors: [(p^(a+1) – 1)/(p – 1)] × [(q^(b+1) – 1)/(q – 1)] × [(r^(c+1) – 1)/(r – 1)].
  • Number of Trailing Zeroes in N!: Number of zeroes is determined by the power of 5: [N/5] + [N/25] + [N/125] + … (integer parts only).

6. Top TCS Exam Tips for SSC CGL 2027

To maximize speed during the quantitative section:

  • Option Elimination: In divisibility problems with variables (x, y), test option values directly for the last 3 digits rather than setting up algebraic equations.
  • Digital Root Checking: Use digit sum mod 9 to quickly verify multiplication and fraction arithmetic in seconds.
  • Daily Formula Drills: Practice 15 minutes of mental calculation and number system tricks daily alongside your regular mock tests.

Leave a Comment

Your email address will not be published. Required fields are marked *

error: Content is protected !!
Scroll to Top