CAT Numbers & Number Theory: Concepts and Formulas
11 concepts for CAT Numbers & Number Theory (Number Systems), from basics to CAT-level shortcuts.
- Classification of Real Numbers & Recurring Decimals
Understand the structure of real numbers, convert pure and mixed recurring decimals to fractions, and quickly identify terminating versus non-terminating decimals.
- Master Divisibility Rules & Digital Invariants
Master the mechanics behind divisibility rules, learn to construct rules for composite numbers, and leverage digital roots to rapidly verify arithmetic operations.
- Factors, Divisors & Product Splitting
Deconstruct numbers into prime factors to calculate the total number of divisors, their sum, their product, and how to split numbers into paired factors.
- Euler’s Totient Function phi(N) & Co-prime Counting
Master Euler's Totient function to count the number of co-primes less than a number, find their sum, and unlock advanced modular arithmetic shortcuts.
- LCM & HCF Classic Exam Models
Demystify complex remainder puzzles using the standardized LCM and HCF models, and learn how to solve simultaneous divisibility conditions instantly.
- Cyclicity, Units Digits & Last Two Digits
Predict the final digits of astronomically large powers using the rules of cyclicity, modular reduction, and binomial expansion patterns.
- Advanced Remainders: Binomial, Fermat & Cyclicity
Demolish complex remainder problems using the Binomial Theorem, negative remainders, and Fermat's Little Theorem.
- Successive Division & Ladder Algorithms
Master the mechanics of successive division where the quotient of one step becomes the dividend of the next, and reverse-engineer the original number.
- Factorials, Legendre’s Formula & Trailing Zeros
Unpack massive factorials to count trailing zeros, identify the highest powers of primes hidden within, and evaluate consecutive product divisibility.
- Practice Set 1: Foundation & Conceptual Drill
Comprehensive 25-question practice drill mirroring Chapter 8 Exercise 1 with fresh thematic scenarios and mathematically verified solutions.
- Practice Set 2: Advanced & CAT Exam-Level Drill
Rigorous 25-question advanced drill mirroring Chapter 8 Exercise 2 with multi-variable constraints and authentic CAT-level traps.
Key formulas
| Terminating Condition | q=2m×5n Fraction p/q (in lowest terms) terminates if q has only 2 and 5 as prime factors. |
|---|
| Pure Recurring to Fraction | 0.x1x2...xk=10k−1x1x2...xk Denominator consists of k nines. |
|---|
| Mixed Recurring to Fraction | 0.abcxy=99000abcxy−abc Nines equal to repeating digits, zeros equal to non-repeating digits. |
|---|
| Divisibility by 8 | N≡(Last 3 digits)(mod8) If the hundreds digit is even, just check the last two digits for divisibility by 8. If odd, add 4 to the last two digits. |
|---|
| Divisibility by 11 | ∑Odd places−∑Even places=11k Count places from right to left (or left to right, it yields the same absolute difference). |
|---|
| Composite Divisor N = a \times b | gcd(a,b)=1 The factors used to check composite divisibility must be strictly co-prime. |
|---|
| Total Number of Factors | T=(a+1)(b+1)(c+1)… Bases p1, p2, p3 must be distinct prime numbers. |
|---|
| Sum of Factors | S=∏pi−1piai+1−1 Based on the sum of geometric progressions. |
|---|
| Product of Factors | P=NT/2 Matches factors in pairs from the outermost inwards. |
|---|
| Euler's Totient phi(N) | ϕ(N)=N∏(1−pi1) p_i are the unique prime factors of N. The exponents don't matter in the parenthesis. |
|---|
| Sum of Co-primes to N | Sum=2N×ϕ(N) Valid for N > 2. |
|---|
| Totient of a Prime | ϕ(P)=P−1 Every number less than a prime is co-prime to it. |
|---|
Recent CAT questions on Numbers & Number Theory
- CAT 2025 Slot 1 Quant Q4
The number of distinct pairs of integers (x, y) satisfying the inequalities x y 3 and x + y < 14 is
- CAT 2025 Slot 1 Quant Q7
In a 3-digit number N, the digits are non-zero and distinct such that none of the digits is a perfect square, and only…
- CAT 2025 Slot 2 Quant Q2
Suppose a,b,c are three distinct natural numbers, such that 3ac = 8(a+b) . Then, the smallest possible value of…
- CAT 2025 Slot 2 Quant Q5
If m and n are integers such that (m+2n)(2m+n) = 27 , then the maximum possible value of 2m-3n is
- CAT 2025 Slot 2 Quant Q9
The sum of digits of the number (625)^65 (128)^36 , is
- CAT 2025 Slot 2 Quant Q12
The number of divisors of (2^6 3^5 5^3 7^2) , which are of the form (3r+1) , where r is a non-negative integer, is
- CAT 2025 Slot 3 Quant Q5
For a 4-digit number (greater than 1000), sum of the digits in the thousands, hundreds, and tens places is 15. Sum of…
- CAT 2025 Slot 3 Quant Q8
The sum of all the digits of the number (10^50+10^25-123) , is