Sign in
Please select an account to continue using cracku.in
↓ →
Fermat's Theorem - For any integer $$a$$ and prime number $$p$$, $$a^p-a$$ is always divisible by $$p$$
Wilson's Theorem - For a prime $$p$$, remainder when $$(p-1)!$$ i divided by $$p$$ is $$(p-1)$$
Euler's Theorem - If M and N are co-prime to each other then the remainder when $$M^{\phi(N)}$$ is divided by N is 1
Formula Video
Previous Year Stats
Remainder Theorems
1
question from CAT exam over the past 5 years
Formulas Asked Together in Previous Papers
Divisibility by different numbers
1 PYQHCF and LCM
1 PYQ
Educational materials for CAT preparation
