Number System – Most Important Notes (For NTPC, SSC, etc.
1. Basic Definitions:
• Natural Numbers: 1, 2, 3, 4, ... (Start from 1)
• Whole Numbers: 0, 1, 2, 3, ...
• Integers: ..., -3, -2, -1, 0, 1, 2, 3, ...
• Rational Numbers: Numbers in the form of p/q where q ≠ 0
• Irrational Numbers: Numbers that can't be expressed as p/q (like √2, π)
• Prime Numbers: Numbers divisible by 1 and itself only. (2, 3, 5, 7, 11, ...)
• Composite Numbers: Numbers with more than 2 factors (4, 6, 8, 9, 10, ...)
2. Divisibility Rules (1–20):
• 2: Last digit even (0, 2, 4, 6, 8)
• 3: Sum of digits divisible by 3
• 4: Last 2 digits divisible by 4
• 5: Last digit 0 or 5
• 6: Divisible by 2 and 3 both
• 7: Double last digit and subtract from rest. Result divisible by 7
• 8: Last 3 digits divisible by 8
• 9: Sum of digits divisible by 9
• 10: Last digit 0
• 11: Alternating sum of digits divisible by 11
• 12: Divisible by 3 and 4
• 13–20: Learn through practice (less commonly asked)
3. Prime Numbers (1 to 100):
2, 3, 5, 7, 11, 13, 17, 19, 23, 29,
31, 37, 41, 43, 47, 53, 59, 61, 67,
71, 73, 79, 83, 89, 97
4. LCM & HCF:
• LCM (Lowest Common Multiple): Smallest number divisible by both.
• HCF (Highest Common Factor): Highest number that divides both.
• LCM × HCF = Product of two numbers
Example:
Find LCM and HCF of 12 and 18
LCM = 36, HCF = 6
12×18 = 216 = LCM × HCF = 36×6
5. Remainder Theorem Tricks:
• (a^n) ÷ b
→ Use cyclicity or Euler’s theorem (in advanced cases)
→ Find unit digit or pattern for last digit type questions
• Remainder when a number is divided by 9 or 11
→ Use sum of digits
6. Unit Digit (Last Digit) Tricks:
• Find last digit of: 7^83
Cyclicity of 7: 7, 9, 3, 1 → 4 digits pattern
83 mod 4 = 3 → Answer = 3rd digit = 3
Cyclic patterns:
• 2: 2, 4, 8, 6 (length 4)
• 3: 3, 9, 7, 1
• 4: 4, 6 (length 2)
• 5: 5 (length 1)
• 6: 6 (length 1)
• 7: 7, 9, 3, 1
• 8: 8, 4, 2, 6
• 9: 9, 1
7. Number of Factors (N = a^m × b^n ...):
• Total Factors = (m+1)(n+1)...
Example:
N = 2^3 × 3^2
Factors = (3+1)(2+1) = 4 × 3 = 12 factors
• Sum of Factors = [(a^(m+1) -1)/(a-1)] × [(b^(n+1) -1)/(b-1)] ...
8. Perfect Squares Identification:
• Unit digit should be: 0, 1, 4, 5, 6, or 9
• Never ends with: 2, 3, 7, 8
• Even number of total factors → NOT a perfect square
• Odd number of total factors → Perfect square
9. Miscellaneous Tricks:
• Number of zeroes at end = Count of 5s in prime factorization (for factorials)
• Greatest 4-digit number divisible by x → (9999 ÷ x) × x
• Smallest 5-digit number divisible by x → ((10000 + x - 1) ÷ x) × x