Telangana Police Constable – Quantitative Aptitude
Topic: Number System
1. Simple Explanation
The Number System section tests your ability to work with different types of numbers (integers, fractions, decimals, etc.) and perform basic operations on them.
-
Types of numbers
- Natural numbers (1, 2, 3, …)
- Whole numbers (0, 1, 2, …)
- Integers (…, –3, –2, –1, 0, 1, 2, 3, …)
- Rational numbers (fractions, terminating/ repeating decimals)
- Irrational numbers (π, √2)
- Real numbers (all rationals + irrationals)
- Complex numbers (a + bi) – usually not in police exam
-
Common operations
- Addition, subtraction, multiplication, division
- Fractions → LCM, GCD, reducing
- Decimal places → rounding, truncation
- Powers and roots (square, cube, nth root)
-
Key concepts
- Prime factorization – express a number as product of primes.
- LCM (Least Common Multiple) – smallest number divisible by given numbers.
- GCD (Greatest Common Divisor) – largest number that divides given numbers.
- Divisibility rules (2,3,4,5,6,7,8,9,10,11,12) – quick checks.
- Unit digit – last digit of a product or sum.
- Modular arithmetic – remainder after division.
2. Key Points
| Concept | What to remember | Quick Tip |
|---|---|---|
| Prime factorization | Every integer >1 can be written as product of prime numbers. | Use small primes first (2,3,5,7…). |
| LCM | LCM(a,b) = (a × b) / GCD(a,b) |
For 3 numbers: LCM(L, a, b) = LCM(LCM(L,a), b). |
| GCD | Highest common divisor. | Euclid’s algorithm: GCD(a,b) = GCD(b, a mod b). |
| Divisibility by 9 | Sum of digits divisible by 9. | Quick check for large numbers. |
| Divisibility by 11 | Alternating sum of digits divisible by 11. | e.g., 1-2+3-4+… |
| Unit digit of powers | Cycle repeats (2→4→8→6). | Know cycles for 0–9. |
| Fraction vs Decimal | 1/2 = 0.5 (terminating), 1/3 = 0.333… (repeating). | Recognize patterns. |
| Rational vs Irrational | √2, π, e are irrational. | Any fraction of integers is rational. |
3. Worked Example
Problem:
Find the LCM of 48, 60, and 90.
Step‑by‑Step Solution
-
Prime factorization
- 48 = 2³ × 3
- 60 = 2² × 3 × 5
- 90 = 2 × 3² × 5
-
Take the maximum power of each prime
- For 2: max(3,2,1) = 3 → 2³
- For 3: max(1,1,2) = 2 → 3²
- For 5: max(0,1,1) = 1 → 5¹
-
Multiply
LCM = 2³ × 3² × 5 = 8 × 9 × 5 = 72 × 5 = 360
Answer: LCM(48,60,90) = 360
4. Quick Revision Summary
- Number Types: Natural, Whole, Integer, Rational, Irrational, Real.
- Prime Factorization → LCM & GCD.
- LCM: Use
(a × b) / GCD(a,b)or take max prime powers. - GCD: Euclid’s algorithm.
- Divisibility Rules: 2,3,4,5,6,7,8,9,10,11,12.
- Unit Digit: Look at last digit; use cycles for powers.
- Fractions ↔ Decimals: Recognize terminating vs repeating.
- Modular Arithmetic: Remainder =
number mod divisor.
Tip for exam: Practice quick factorization, memorize prime cycles for powers, and use the divisibility rules as a fast screening tool before performing full calculations.