CAT Number System Practice Set 3: Remainders, Bases and Divisors
CAT Number System Sectional Test 3 is a CAT quant practice set on Aptitude360 that focuses on Number System topics alongside some algebra questions. It covers remainders of large powers, number bases, divisor counting, perfect cubes, trailing zeros, surd simplification and the minimum of absolute-value sums. A worked solution is provided for every question.
Topics covered in Number System Test 3
- Remainders of large powers and power towers, and remainders of sums of powers
- Unknown number bases and digit sums
- Counting divisors from prime factorisation, and HCF and LCM pairs
- Perfect cubes, trailing zeros in products, and palindromes with divisibility tests
- Comparing and simplifying surds using conjugates
- Minimum of a sum of absolute values, and floor of square roots
- Integer solutions of reciprocal equations and numbers written as a difference of squares
- Primality checks through algebraic factorisation, and alternating sums of squares
Key Number System formulas for this set
- Divisors of \( p^{a}q^{b}r^{c} \): \( (a+1)(b+1)(c+1) \)
- HCF and LCM: \( \text{HCF}\times\text{LCM}=A\times B \)
- Euler's theorem, \( \gcd(a,n)=1 \): \( a^{\phi(n)}\equiv 1 \pmod{n} \)
- Trailing zeros of \( n! \): \( \sum_{k\ge 1}\left\lfloor \dfrac{n}{5^{k}} \right\rfloor \)
- Sophie Germain identity: \( a^{4}+4b^{4}=(a^{2}+2b^{2})^{2}-(2ab)^{2} \)
- Difference of squares: \( x^{2}-y^{2}=(x-y)(x+y) \)
Revision tips for CAT remainder and divisibility questions
- Reduce the base modulo the divisor before applying cyclicity or Euler's theorem.
- For base problems, convert every number to base ten and solve the resulting equation.
- For divisor and cube questions, write the full prime factorisation first.
- Find integer solutions of reciprocal equations by clearing denominators and factorising.
Who this Number System set is for
CAT and OMET aspirants who have finished the basics of number theory and want harder, mixed practice on remainders, factors and bases.