๐ Number System Complete Cheat Sheet for JKSSB & SSC
A one-stop guide to master Number System for all competitive exams โ JKSSB, SSC, Railway, Banking, and State PSCs.
๐งฉ 1. Basics of Number System
| Type | Definition | Examples |
|---|---|---|
| Natural Numbers (N) | Counting numbers starting from 1 | 1, 2, 3, โฆ |
| Whole Numbers (W) | Natural numbers + Zero | 0, 1, 2, 3, โฆ |
| Integers (Z) | Positive + Negative + Zero | -3, -2, -1, 0, 1, 2, 3 |
| Rational Numbers (Q) | Can be expressed as p/q | ยฝ, -ยพ |
| Irrational Numbers | Cannot be expressed as p/q | โ2, ฯ |
| Real Numbers (R) | All Rational + Irrational | โ2, 5, 1.2 |
| Prime Numbers | Divisible only by 1 and itself | 2, 3, 5, 7, 11 |
| Composite Numbers | More than two factors | 4, 6, 8, 9 |
๐ข 2. Divisibility Rules (Super Shortcut Table)
| Number | Divisibility Rule |
|---|---|
| 2 | Last digit even (0,2,4,6,8) |
| 3 | Sum of digits divisible by 3 |
| 4 | Last two digits divisible by 4 |
| 5 | Last digit 0 or 5 |
| 6 | Divisible by both 2 and 3 |
| 7 | Double the last digit, subtract from remaining number โ result divisible by 7 |
| 8 | Last three digits divisible by 8 |
| 9 | Sum of digits divisible by 9 |
| 10 | Last digit 0 |
| 11 | Difference between sum of odd and even position digits divisible by 11 |
๐ง Trick:
๐ If a number is divisible by 18, it must be divisible by 2 and 9.
๐ For 12, check divisibility by 3 and 4.
๐ฅ 3. HCF & LCM Shortcuts
๐น HCF (Greatest Common Divisor)
- Prime Factorization Method: Find common primes, multiply lowest powers.
- Shortcut:
HCF ร LCM = Product of two numbers
๐น LCM
- Multiply all primes with highest power.
Example:
HCF & LCM of 12 and 18
๐ 12 = 2ยฒ ร 3ยน
๐ 18 = 2ยน ร 3ยฒ
โก HCF = 2ยน ร 3ยน = 6
โก LCM = 2ยฒ ร 3ยฒ = 36
โ
Check: 6 ร 36 = 12 ร 18 = 216
โก 4. Remainder & Modulo Tricks
๐น Basic Rule:
a โก b (mod m) means (a - b) is divisible by m.
๐น Shortcut Tricks:
| Case | Rule | Example |
|---|---|---|
| Large powers | Find cyclicity of last digit | 7ยน =7, 7ยฒ=49(9), 7ยณ=343(3), 7โด=2401(1) โ cycle 7,9,3,1 |
| Division remainder | (a+b) mod m = (a mod m + b mod m) mod m |
(26+39) mod 5 = (1+4) mod 5 = 0 |
| Negative remainder | Add divisor to make it positive | (-3) mod 7 = 4 |
๐ง Shortcut Example:
Find remainder when 7ยนโฐโฐ is divided by 10
โ Cyclicity of 7 = (7,9,3,1) โ length = 4
โ 100 mod 4 = 0 โ 4th term = 1 โ
๐งฎ 5. Unit Digit & Last Digit Tricks
๐น Shortcut Steps:
- Find the cyclicity of last digit.
- Find power mod cycle length.
| Base | Cycle | Length |
|---|---|---|
| 2 | 2,4,8,6 | 4 |
| 3 | 3,9,7,1 | 4 |
| 4 | 4,6 | 2 |
| 7 | 7,9,3,1 | 4 |
| 8 | 8,4,2,6 | 4 |
| 9 | 9,1 | 2 |
โ
Example:
Find unit digit of 9ยณโต โ cycle (9,1) โ odd power โ 9
๐งฑ 6. Factorization Shortcuts
๐น Number of Factors
If N = a^p ร b^q ร c^r, then
๐ Total factors = (p+1)(q+1)(r+1)
๐น Sum of Factors
๐ Sum = [(a^(p+1)โ1)/(aโ1)] ร [(b^(q+1)โ1)/(bโ1)] ร โฆ
Example:
N = 36 = 2ยฒ ร 3ยฒ
Factors = (2+1)(2+1)=9
Sum = [(2ยณโ1)/(2โ1)]ร[(3ยณโ1)/(3โ1)] = 7ร13=91 โ
๐ง 7. Perfect Squares & Cubes Tricks
| Observation | Shortcut |
|---|---|
| Last digit of square canโt be 2,3,7,8 | So if number ends with these โ not perfect square |
| Square of number ending in 5 โ ends with 25 | e.g., 25ยฒ=625 |
| Cube of even = even; Cube of odd = odd | Simple elimination trick |
๐ 8. Place Value & Face Value
| Term | Meaning | Example |
|---|---|---|
| Face Value | Actual value of digit | In 345, FV of 4 = 4 |
| Place Value | Digit ร place | In 345, PV of 4 = 40 |
๐ง Tip:
- For quick subtraction type questions, write expanded form once, then eliminate same places.
๐งฎ 9. Conversion Tricks
| Conversion | Formula |
|---|---|
| Binary โ Decimal | Multiply each digit by 2โฟ (right to left) |
| Decimal โ Binary | Divide by 2, write remainders reverse |
| Octal โ Decimal | Multiply digits by 8โฟ |
| Hex โ Decimal | Multiply digits by 16โฟ |
โ
Example:
Binary 1011 = (1ร8)+(0ร4)+(1ร2)+(1ร1)=11
๐ง 10. Miscellaneous Quick Tricks
- Sum of first n natural numbers: n(n+1)/2
- Sum of first n odd numbers: nยฒ
- Sum of first n even numbers: n(n+1)
- Sum of squares (1ยฒ+2ยฒ+...+nยฒ): n(n+1)(2n+1)/6
- Sum of cubes: [n(n+1)/2]ยฒ
โ
Example:
Sum of first 10 even numbers = 10ร11=110
๐งฎ 11. Important Conceptual Differences
| Concept | Shortcut Understanding |
|---|---|
| Prime | Only 2 divisors |
| Co-prime | HCF = 1 (not necessarily prime) |
| Perfect Number | Sum of divisors = number (6, 28) |
| Composite | More than 2 factors |
| Twin Primes | Difference = 2 (e.g. 11,13) |
๐ง 12. Smart Solving Strategies (Exam-Focused)
- Always eliminate options using unit digit logic first.
- Avoid full multiplication โ use divisibility + remainder tricks.
- Convert ratios or fractions to decimals mentally when comparing.
- Donโt calculate LCM fully if ratio-based. Work with factor logic.
- Time-Saver: Learn cyclicity patterns (2,3,4,7,8,9) by heart.
โ๏ธ 13. Practice Challenge Set (Quick Warm-Up)
- Find remainder when 17โต is divided by 10.
- Unit digit of (13)โทโธ.
- Find HCF and LCM of 72 and 108.
- How many factors does 120 have?
- Find sum of first 20 even numbers.
- Check divisibility of 378 for 11.
- Which number is co-prime with 45?