CAT Number Theory Mock Test 4: GCD, Floor Sums and Recursive Functions
Floor sums, GCDs of large powers, factorial equations and recursive functions are the focus of CAT Number System Sectional Test 4, a quant set on Aptitude360. It also brings in binomial divisibility, nested radicals and absolute value equations. Every question has a worked solution.
What CAT Number System Test 4 asks you to solve
- GCD of numbers of the form two to a power minus one, and GCD and LCM pairs
- Highest power of a prime dividing a central binomial coefficient
- Factorial plus a constant equal to a perfect square
- Floor summations, floor equations and floors of binary logarithms
- Recursive sequences, functional equations and multiplicative functions
- Divisibility by ninety-nine, coprime counting and sums of odd divisors
- Nested radicals, absolute value equations, and telescoping products and series
- Digital roots and the integer part of surd powers
Number theory rules worth memorising
- GCD of Mersenne-type numbers: \( \gcd(2^{a}-1,2^{b}-1)=2^{\gcd(a,b)}-1 \)
- Legendre's formula, prime \( p \): \( v_{p}(n!)=\sum_{k\ge 1}\left\lfloor \dfrac{n}{p^{k}} \right\rfloor \)
- Divisor sum of \( p^{a} \): \( \dfrac{p^{a+1}-1}{p-1} \)
- Euler's totient: \( \phi(n)=n\prod_{p\mid n}\left(1-\dfrac{1}{p}\right) \)
- Telescoping: \( \dfrac{k}{(k+1)!}=\dfrac{1}{k!}-\dfrac{1}{(k+1)!} \)
How to prepare for these CAT number theory questions
- For recursive functions, compute the first few terms and look for a pattern before generalising.
- Split floor sums into ranges where the floor value stays constant.
- For factorial equations, use the units digit or a small modulus to rule out large values quickly.
- For coprime counting, apply inclusion and exclusion on the prime factors.
Who this sectional test suits
CAT aspirants at an advanced stage of Number System preparation who want questions that link number theory with functions and algebra.