CAT Number System Practice Test 2: Factors, Remainders and Divisibility
For CAT aspirants who have finished the basics of number system, this sectional test is a next-stage check on factors, remainders, divisibility and digit-based problems. It mixes factor counting, coprime counting, trailing zeros, nested radicals, floor-function sums and number bases. Aptitude360 gives a worked solution for every question.
Topics covered in this Number System sectional test
- Counting factors divisible by one number but not another
- Perfect-square factors of a factorial
- Numbers coprime to a given number with a remainder condition
- Remainders of large powers and trailing zeros in factorial ratios
- Simplifying nested square roots
- Absolute value inequalities and floor-function sums
- Telescoping series, digit sums and number bases
- Difference of squares, simultaneous remainders and comparing large powers
Key Number System formulas
- Factors of \( p^{a}q^{b}r^{c} \): \( (a+1)(b+1)(c+1) \)
- Totient of \( n=p^{a}q^{b} \): \( \phi(n)=n\left(1-\dfrac{1}{p}\right)\left(1-\dfrac{1}{q}\right) \)
- Trailing zeros in \( n! \): \( \sum_{k\ge 1}\left\lfloor\dfrac{n}{5^{k}}\right\rfloor \)
- Fermat (\( p \) prime, \( p\nmid a \)): \( a^{p-1}\equiv 1 \pmod{p} \)
- Telescoping: \( \dfrac{2}{n(n+2)}=\dfrac{1}{n}-\dfrac{1}{n+2} \)
Revision tips for CAT number theory
- Write every number in prime factorised form before counting factors
- For 'divisible by A but not B' problems, count with A and subtract those divisible by both
- Check nested radicals by squaring the whole expression
- Look for remainder cycles before using theorems for large powers
Who should take this CAT Number System test
CAT and OMET aspirants who know the core Number System rules and want harder, mixed practice before full-length mocks.