Professional Documents
Culture Documents
CAT Quant
CAT Quant
Squares
12=144 24=576
Cubes
Power of 2
Power of 5
2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97 = 25
101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199 =
21
………………………………………………………………………………………………………….
……………………………………………………………………………………………………………
Divisibility Rules =
……………………………………………………………………………………………………………
To check whether a number is a prime number => Take the square root of that number and check for all
the prime numbers leading upto the square root.
For a composite number N = (x^a) (y^b) (z^c), Total number of divisors = (a+1)*(b+1)*(c+1)
Let N be a composite number such that N = (2^a)*(y^b)*(z^c) where y and z are prime factors.
Then total number of divisors = (a+1)*(b+1)*(c+1)
Total number of even divisors = (a)*(b+1)*(c+1)
Total number of odd divisors = (b+1)*(c+1)
Let N be a composite Number N = (x^a) (y^b) (z^c), where x, y and z are prime factors
x a +1−1 b+1
∗y −1
x −1
Then the sum of the divisors for ∗z c+1−1
y−1
N=
z−1
Let N be a composite Number N = (x^a) (y^b) (z^c), where x, y and z are prime factors
( a+1 )∗( b+1 )∗(c+1 )
Then the product of the divisors for N=( x a y b z c ) 2
Let N be a composite Number N = (x^a) (y^b) (z^c), where x, y and z are prime factors
If N is not a perfect square then the number of ways N can be written as a product of two factors
=(a+1)*(b+1)*(c+1)/2 = Number of divisors/2
If N is a perfect square then the number of ways N can be written as a product of two factors
=((a+1)*(b+1)*(c+1)+1)/2 = (Number of divisors+1)/2
If N is a perfect square then the number of ways N can be written as a product of two different factors
=((a+1)*(b+1)*(c+1)-1)/2 = (Number of divisors - 1)/2
Let N be a composite Number N = (x^a) (y^b) (z^c), where x, y and z are prime factors
Then N*(1-1/x)*(1-1/y)*(1-1/z) numbers have no factor in common with N.
The number of ways a composite number can be resolved into two factors which are prime to each
other = 2^(n-1), where n is the number of different prime factors of the number.
……………………………………………………………………………………………………………
All numbers can be represented as multiples of 3 in the form of 3n, 3n+1, 3n+2
All numbers can be represented as multiples of 3 in the form of 4n, 4n+1, 4n+2, 4n+3
All Prime numbers greater than 3 can be written in the form of 6n+1 or 6n-1. But every number of this
form might not be a prime number
……………………………………………………………………………………………………………
……………………………………………………………………………………………………………
If a and b are any two odd prime numbers then a^2-b^2 = composite and a^2+b^2 is also composite
The remainder for the division of the square of any prime number with 12 is 1.
……………………………………………………………………………………………………………
Number of zeroes in an expression = minimum of (number of 5s, number of 2s) in its prime factors
Of n consecutive whole numbers a, a+1, a+2, …….. a+n-2 + a+n-1, one and only one number is divisible
by n.
The difference between xy and yx will always be divisible by 9. ((xy)-(yx))/9
The square of an odd number when divided by 8 will always leave the remainder 1
The product of three consecutive numbers will always be divisible by 6.
The product of three consecutive numbers first of which is even will always be divisible by 24.
If m and n are two integers then (m+n)! is always divisible by m!*n!
(a)^n/(a+1) leaves a remainder of a if n is odd and 1 if even n is even
Remainder Theorem
Base System
Averages
Alligations
Percentages
Mensuration
Trigonometry
Geometry
Algebra
Theories of Equation
Then the values for which the equations is equal to zero is called the roots of the equation and is given
by f’(x).
The highest whole number power of x is called the degree of the equation
Properties of roots
Special Cases
Quadratic Equations
Progressions
AP, GP, HP
AP & AM
GP & GM
AGP
Logarithms
Piecewise Functions
Composite Functions
Periodic Functions
Inverse of a function
Function as a series
Set Theory
Logarithm
Probability
Coordinate Geometry