CAT Number System Mock Test 6: Remainders, Factorials and Floor Functions
CAT Number System Sectional Test 6 is a quant practice set focused on Number System topics and related quant problems, covering remainders, factorial powers, floor functions, bases and integer solutions. Aptitude360 provides a written solution for every question, so each method, from cyclicity to divisor sums, can be checked after you solve.
Topics covered in Number System Sectional Test 6
- Remainders of large powers and factorial sums using modular arithmetic
- Greatest integer (floor) function equations and sums
- Numbers written in different bases and digit reversal
- Highest power of a composite number dividing a factorial or product
- Counting whole-number solutions of linear equations
- Palindromes, digit products and divisibility rules
- LCM and GCD relations, divisor sums and perfect-number style conditions
- Absolute value inequalities and perfect square expressions
Key formulas and rules for CAT Number System
- Euler's theorem, when \( \gcd(a,n)=1 \): \( a^{\phi(n)}\equiv 1 \pmod{n} \)
- Wilson's theorem for prime \( p \): \( (p-1)!\equiv -1 \pmod{p} \)
- Power of prime \( p \) in \( n! \): \( \sum_{k\ge 1}\left\lfloor \dfrac{n}{p^{k}} \right\rfloor \)
- LCM and GCD: \( \text{lcm}(a,b)\times\gcd(a,b)=a\times b \)
- Divisor sum of \( p^{a} \): \( \dfrac{p^{a+1}-1}{p-1} \)
- Floor bounds: \( x-1<\lfloor x\rfloor\le x \)
Revision tips for number theory in CAT
- Split a large modulus into coprime factors and combine the results when Euler's theorem gets heavy
- For floor equations, write x as an integer part plus a fractional part and test each interval
- For the highest power of a composite divisor, find the power of each of its prime factors in the product, divide by that prime's exponent in the divisor, and take the smallest whole-number quotient
- Write a and b as multiples of their GCD to turn LCM and GCD conditions into simple equations
Who should take this sectional test
CAT and OMET aspirants who have finished Number System theory and want challenging, exam-style problems to test their speed and accuracy.