CAT Number System Mock Test 1: Divisors, Remainders and Bases
This is for CAT aspirants who have studied number system theory and now need demanding topic-wise practice. CAT Number System Sectional Test 1 covers divisor counting, remainder theorems, ending digits of large powers, number bases and LCM-HCF equations. Aptitude360 gives a worked solution for every question.
Topics in this CAT Number System sectional test
- Counting divisors with conditions such as being a perfect square but not a perfect cube
- Remainders of factorials, sums of factorials and large powers
- Ending digits of very large powers and towers of exponents
- Trailing zeros in large products
- Number bases and terminating representations in a non-decimal base
- LCM-HCF equations, reciprocal equations and the difference of two squares
- Primality of algebraic expressions, greatest integer function and the Chinese remainder idea
Key number system formulas and rules
- Divisors of \( N=p^{a}q^{b} \): \( (a+1)(b+1) \)
- Wilson's theorem, \( p \) prime: \( (p-1)! \equiv -1 \pmod{p} \)
- Euler's theorem: \( a^{\phi(n)} \equiv 1 \pmod{n} \) if \( \gcd(a,n)=1 \)
- Power of prime \( p \) in \( n! \): \( \sum_{k\ge1}\left\lfloor \dfrac{n}{p^{k}} \right\rfloor \)
- LCM and HCF: \( \text{LCM}\times\text{HCF}=a\times b \)
- Difference of squares: \( x^{2}-y^{2}=(x-y)(x+y) \)
Revision tips for CAT number theory
- Write a number as a product of prime powers before counting any type of divisor.
- For difference-of-squares counts, check that both factors have the same parity.
- Use Euler's theorem or cyclicity to reduce huge exponents before finding remainders.
- For LCM-HCF equations, write both numbers as the HCF times coprime factors.
Who should take this sectional test
It suits CAT and OMET aspirants at the post-theory stage of number system preparation who want harder, exam-style questions on a single topic.