CAT Number System Mock Test 5: Remainders, Divisors and Factorials
CAT Number System Sectional Test 5 is a quant mock for CAT aspirants who have finished the number theory basics and want exam-level practice. It covers remainders, divisor counting, factorial powers, base conversion, floor equations and divisibility. Every problem on Aptitude360 comes with a detailed solution.
Number System topics in this CAT sectional test
- Remainders of large powers and last digits of a power
- Divisor counting from prime factorisation and smallest numbers with a given divisor count
- Highest powers of a number in factorials and trailing zeros
- Divisibility rules for composite divisors and missing-digit problems
- Floor function and modulus equations
- HCF and LCM pairs, base conversion and digit reversal
- Integer solutions of Diophantine-type equations and perfect powers
Key Number System formulas for CAT
- Divisors of \( p^{a}q^{b}r^{c} \): \( (a+1)(b+1)(c+1) \)
- Power of prime p in n!: \( \sum_{k=1}^{\infty}\left\lfloor\dfrac{n}{p^{k}}\right\rfloor \)
- Euler's theorem (coprime a, n): \( a^{\phi(n)}\equiv 1 \pmod{n} \)
- HCF and LCM: \( \text{HCF}\times\text{LCM}=a\times b \)
- Cube identity: \( (a-b)^{3}=a^{3}-b^{3}-3ab(a-b) \)
Revision tips for CAT Number System
- Write every number in prime factorised form before tackling divisor or perfect power questions.
- Split a composite divisor into coprime factors and combine the remainders.
- For floor equations, bound the variable between consecutive integers first.
Who this sectional test suits
CAT and OMET aspirants in the later stage of quant preparation who want a topic test on Number System.