Ladakh PSC /Quantitative Aptitude

Number system

Arithmetic · free study notes · Updated

📚 Ladakh PSC – Quantitative Aptitude

Topic: Number System


1. Simple Explanation

The number system deals with the representation, properties, and operations on numbers. In the PSC syllabus, you’ll encounter:

  • Natural, whole, integer, rational, irrational, real, and complex numbers.
  • Place value system (decimal, binary, octal, hexadecimal).
  • Prime, composite, perfect, amicable, and other special numbers.
  • Number bases and conversion between them.
  • Divisibility rules and digital roots.

Understanding these fundamentals helps solve problems on divisibility, number patterns, and base‑conversion quickly.


2. Key Points to Remember

Concept What to Know Quick Tips
Number Types • Natural (1,2,…)
• Whole (0,1,…)
• Integers (…,-2,-1,0,1,2,…)
• Rationals (fractions)
• Irrationals (√2, π)
• Reals (rationals + irrationals)
• Complex (a+bi)
Use the symbol ℕ, ℤ, ℚ, ℝ, ℂ.
Divisibility Rules 2: last digit even
3: sum of digits %3=0
4: last 2 digits %4=0
5: last digit 0 or 5
6: divisible by 2 & 3
9: sum of digits %9=0
10: last digit 0
Memorise table; quick checks.
Digital Root Repeated sum of digits until a single digit. Useful for 3, 9, 11 checks. dr(n) = 1 + (n-1) mod 9 for n>0.
Prime Numbers Numbers >1 with no divisors other than 1 & itself. Check divisibility up to √n.
Composite Numbers Any integer >1 that isn’t prime. Has at least one divisor other than 1 & itself.
Perfect Numbers Sum of proper divisors equals the number (e.g., 6, 28). Use Euclid‑Euler theorem for even perfect numbers.
Number Bases - Decimal (base‑10)
- Binary (base‑2)
- Octal (base‑8)
- Hexadecimal (base‑16)
Conversion: multiply/divide by base; use remainders.
Base Conversion 1) Decimal → base‑b: repeated division.
2) Base‑b → Decimal: Σ digit × bⁿ.
Practice with 2, 8, 16.
Multiplication/Addition in Different Bases Perform operations as usual but carry/borrow accordingly. Remember base‑b carry > = b.

3. Worked Example

Problem (PSC style)

Find the digital root of ( 7^5 ) and determine if it is divisible by 9.

Step‑by‑Step

  1. Compute ( 7^5 )
    [ 7^5 = 7 \times 7 \times 7 \times 7 \times 7 = 16807 ]

  2. Find the digital root

    • Sum digits: (1+6+8+0+7 = 22)
    • Sum again: (2+2 = 4)
      So, digital root = 4.
  3. Check divisibility by 9

    • A number is divisible by 9 iff its digital root is 9 (or 0).
    • Digital root = 4 ≠ 9 → Not divisible by 9.

Answer: Digital root = 4; not divisible by 9.


4. Quick Revision Summary

Topic Quick Flashcard
Number Types ℕ, ℤ, ℚ, ℝ, ℂ
Divisibility 2,3,4,5,6,9,10 rules
Digital Root 1 + (n-1) mod 9
Prime Test Check till √n
Perfect Number Sum proper divisors = number
Base Conversion Div/Rem for Dec→Base; Σdigit×bⁿ for Base→Dec
Carry in Base‑b Carry when sum ≥ b

Tip: Create a one‑page cheat sheet with divisibility rules and a table of small primes (≤100) for quick reference during exams.

Happy studying! 🚀

Your note

Page 1

Doubt hai is topic me?

Free AI teacher se poocho — 24/7, step by step.