"The Cracker" Practice Book for Algebra and Number System

1 Adda247 Publications For any detail, mail us at

Publications@adda247.com
 "The Cracker" Practice Book for Algebra and Number System

Important Concepts & Formulae

for Algebra and Number System
Number System
A. Classification of Numbers

1. Decimal Number System 10 Digits (0, 1, 2, 3, 4, 5, 6, 7, 8, 9)

e.g. 4679 made from above digits.

2. Face Value = Number is itself in decimal number system.

e.g. face value of 4 is 4.
6=6
7=7
3. Place Value
e.g. in the number 4679
Place value of 6 = 600
Place value of 7 = 70
Place value of 4 = 4000
Place value of 9 = 9

Note – In unit digit face value is the place value

2 Adda247 Publications For any detail, mail us at

Publications@adda247.com
 "The Cracker" Practice Book for Algebra and Number System

4. Integer – Integers are whole numbers, negative of whole numbers, and zero.
i) Zero is an Integer
ii) Zero is an even number
iii) 1 is neither prime nor composite
iv) 0 is neither positive nor composite
Integer

Positive Integer Zero Negative Integer

(1, 2, 3, 4, ….. ∞) (0) (– ∞, …. –3, –2, –1)

Integer

Even Odd
Number divisible by 2 Number not divisible by 2
(–∞, ….4, –2, 0, 2, 4, ….∞) (–∞, …. –3, –1, 1, 3, ….∞)

Positive Integer

Prime Number 1 is Neither Prime Number Composite Number

Nor Composite Number Number having more Number having only two
than two factors.
Factors- 1 and itself
Note -
1) Smallest Prime = 2
2) 2 is an even prime Number
3) There are 15 Prime Numbers between 1 to 50
50 to 100 – 10 Prime Numbers
1 to 100 – 25 Prime Numbers

5. Relative Prime - Set of two number having HCF = 1

e.g. {1, 3}, {9, 25}

6. Co-Prime Number – Set of two prime numbers

e.g. {2, 3}, {5, 7}

Note - Every Co-Prime number is relatively prime number.

7. Twin Prime Number - Set of two Prime numbers having difference 2.

e.g. {5, 7}, {17, 19}.

Perfect Number - If sum of all factors of a number (excluding itself) is equal to original number then
number is called Perfect Number.

3 Adda247 Publications For any detail, mail us at

Publications@adda247.com
 "The Cracker" Practice Book for Algebra and Number System

B. Unit Digit

1. Cyclicity = 1
{0, 1, 5, 6}
2. Cyclicity = 2
4𝑜𝑑𝑑 = 4 9𝑜𝑑𝑑 = 9
4𝑒𝑣𝑒𝑛 = 6 9𝑒𝑣𝑒𝑛 = 1
{4, 9}
3. Cyclicity = 4
{2, 3, 7, 8}

Step 1 – Divide n by 4 and find out the remainder (R)

Step 2 - {2, 3, 7, 8}𝑅 → unit digit.

Eg. 341 × 742 × 843 . Find unit digit

Sol. 341 × 742 × 843
Cyclicity = 4 divide power by 4 find R.
Unit digit → 31 × 72 × 83 → 3 × 9 × 2 → 27 × 2 → 4

Eg. Find unit digit of 1! + 2! + 3! + ………+100!

Sol. 1! + 2! + 3! + 4! + 5! +…. +100! (from 5! to 100! Every term has 0 in the last)
1 + 2 + 6 + 24 → 2 + 1 = 3

Note – If any power gets divided by 4 completely, then take R = 4

C. Divisibility Rule

1. Divisibility of Zero - 0 is divisible by any number except 0. But no number is divisible by 0.

2. Divisibility by 1 - 1 is not divisible by any number except 1. But all numbers are divisible by 1.
3. Divisibility by 2 - Number will be divisible by 2 if last digit be is divisible by 2.
4. Divisibility by 4 – Number will be divisible by 4 if last 2 digit is divisible by 4.
5. Divisibility by 8 - Number will be divisible by 8 if last 3 digits is divisible by 8.
6. Divisibility by 16 – Number will be divisible by 16 if last 4 digits is divisible by 16.

Note –
1) A number will be perfect square if its last digit has (0, 1, 4, 5, 6, 9)
Last digit

 ×
0 2
1 3
4 7
5 8
6
9

4 Adda247 Publications For any detail, mail us at

Publications@adda247.com
 "The Cracker" Practice Book for Algebra and Number System

2) A number is a perfect square if its last 2 digits must be divisible by 4

Last 2 digit

 ×
24 14
44 34
84 54
64 74
. 94
 ×
16 26
36 46
76 66
56 86
96
7. Divisibility by 3 - Number will be divisible by 3 if sum of digits of number is divisible by 3.
8. Divisibility by 9 - Number will be divisible by 9 if sum of digits of number is divisible by 9.
9. Divisibility by 11 -

1 + 2 + 1 + 1 = 5 ⇒ This sum must be 0, 11, 22 …..

So, 98754321 Not divisible by 11.

10. Divisibility of 13 –
How to make divisibility rule of any prime number?
Let x = odd factor
Solve the equation 3x+1=13 for x
x=4
Method – Multiply last digit by 4 and add the result in the remaining part. If the resultant is divisible
by 13, then given number is divisible by 13.
Eg.
65 : - 4 × 5 = 20
20 + 6 = 26 divisible by 13
So, 65 also divisible by 13.

11. Divisibility of 19 –
9x + 1 = 19
x=2
Method – Multiply last digit by 2 and add the result in the remaining part. If the resultant is divisible
by 19, then given number is divisible by 19
Eg.
361 : - 1 × 2 = 2
2 + 36 = 38 divisible by 19
So, 361 also divisible by 19.

5 Adda247 Publications For any detail, mail us at

Publications@adda247.com
 "The Cracker" Practice Book for Algebra and Number System

D. Factors

Note - Factors are always positive.

1. Number of even factors – Given number must be divisible by 2

No. of even factors of 2𝑝 𝑏𝑞 𝑐 𝑟 = 𝑝(𝑞 + 1)(𝑟 + 1)
Eg.
100 = 22 × 52
20 50
[21 51 ]
22 52
2 × 3 → 6 No. of even factors.

2. Number of odd factors – Given number must not be divisible by 2. Hence power of 2 is not to be
counted.
No. of odd factor of 2𝑝 𝑏𝑞 𝑐 𝑟 = 20 (𝑞 + 1)(𝑟 + 1)
⇒ 1 (q + 1) (r + 1)
Eg.
100 = 22 × 52
𝑜𝑑𝑑 20 50
𝑒𝑣𝑒𝑛 [2 × 51 ]
1

𝑒𝑣𝑒𝑛 22 × 52
1×3=3
No. of odd factors of 100 is 3.

3. Sum of factors –
Sum of factors of 𝑎 𝑝 𝑏𝑞 𝑐 𝑟 = (𝑎 0 + 𝑎1 + ⋯ 𝑎 𝑝 )(𝑏0 + 𝑏1 + ⋯ (𝑐 0 + 𝑐1 . . 𝑐1 )
Eg.
100 = 22 × 52
20 → 50
21 → 51
22 → 52
20 (50 + 51 + 52 )
21 (50 + 51 + 52 )) = (50 + 51 + 52 )(20 + 21 + 22 )
22 (50 + 51 + 52 )

6 Adda247 Publications For any detail, mail us at

Publications@adda247.com
 "The Cracker" Practice Book for Algebra and Number System

4. Sum of even factors - Here only 20 will be counted and rest of the power of 2 will not be counted.
Sum of even factors of 2𝑝 𝑏 𝑞 𝑐 𝑟 = (21 + 22 + ⋯ 2𝑝 )(𝑏0 + 𝑏1 + ⋯ 𝑏𝑞 )(𝑐 0 + 𝑐1 + ⋯ 𝑐 𝑟 )
Eg.
240 = 24 × 31 × 51
Sum of even factors = (21 + 22 + 24 )(30 + 31 )(50 + 51 )
⇒ 30 × 4 × 6 = 720

5. Sum of odd factors – For odd factor it is necessary that it is not divisible by 2. Hence power of 2 is
not to be counted.
Sum of odd factors of 2𝑝 𝑏𝑞 𝑐 𝑟 ⇒ 20 (𝑏0 + 𝑏1 + ⋯ 𝑏𝑞 )(𝑐 0 + 𝑐1 + ⋯ 𝑐 𝑟 )
Eg. 240 = 24 × 31 × 51
⇒ (20 )(30 + 31 )(50 + 51 ) = 1 × 4 × 6 = 24.

6. Average of factors –
𝑆𝑢𝑚 𝑜𝑓 𝑓𝑎𝑐𝑡𝑜𝑟
Average of factors = 𝑁𝑜.𝑜𝑓 𝑓𝑎𝑐𝑡𝑜𝑟𝑠

7. Perfect Number - If the sum of all factors of a number (excluding itself) is equal to the number than
number is called Perfect Number.

8. Number of Prime factors - If 𝑎 𝑝 𝑏𝑞 𝑐 𝑟 than No. of prime factors is p + q + r.

Eg.
No. of prime factors of 213 315 516→ 13 + 15 + 16 = 44

9. Common factor –
a. 𝑥 𝑛 + 𝑎 𝑛 if n = odd
Then C. F. = x + a
b. 𝑥 𝑛 + 𝑎 𝑛 if n = even
Then C.F. = No common factor
c. 𝑥 𝑛 − 𝑎 𝑛 if n = odd
C.F. = x – a
d. If n = even
C.F. = x + a, x – a

Use of Common factor

1723 +2923
Eg(1) 23
. Find Remainder.
Sol. C.F. = 17 + 29 = 46
46
= 2, ⇒ 𝑅 = 0
23
Eg(2) 3 + 782 will be divisible by ?
41

Sol. 341 + (72 )41 → 341 + 4941

C.F = 3 + 49 = 52
52
=2⇒R=0
26
So divisible by 26.

7 Adda247 Publications For any detail, mail us at

Publications@adda247.com
 "The Cracker" Practice Book for Algebra and Number System

10. How to find maximum power of a Prime Number

n n n
[P1 ] + [p2 ] + [p3 ] + ⋯ . ]
Greatest integer function
[2.5] = 2
[7.5] = 7

Eg(1) Find the maximum power of 3 in 60! ?

60 60 60
Sol - [ 3 ] + [ 9 ] + [27]
20 + 6 + 2 = 28
Or

= 20 + 6 + 2 = 28
Eg(2) If 133! is exactly divisible by 6𝑛 . Find the maximum value of n?
Sol –

44 + 14 + 4 + 1 = 63

E. Number of Zeros

No. of zeros = No. of 5

𝑛 𝑛 𝑛
= [ ] + [ 2] + [ 3] + ⋯
5 5 5

Eg(1) Find No. of zeros in 100! ?

Sol –

20 + 4 = 24

Eg(2) Find No of zeros in 2 × 4 × 6 × …. × 250?

Sol –
2125 × 125!=2125 (1 × 2 × 3 × … × 125)

25 + 5 + 1 = 31 = No. of zeros.

8 Adda247 Publications For any detail, mail us at

Publications@adda247.com
 "The Cracker" Practice Book for Algebra and Number System

F. Remainder Theorem

1. Dividend = divisor × quotient + remainder

Eg.

17 = 5 × 3 + 2
Note –
a.

Divisor = x = r1 + r2 − r3

Eg - When a certain number is divided by a certain divisor leaves remainder 43 and another
number is divided by same divisor leaves remainder 37. If sum of both number is divided by
same divisor leaves remainder 13. Find divisor?
Sol. Divisor = 43 + 37 – 13 = 67
x
b. → Rem. = R
X
2x 2R
→ Rem. =
D D

x
c. → Rem. = R
D
x2 R2
→ Rem. =
D D
x R3
→ Rem. =
D D

2. Conjective Remainder –
43
15 657
60
57
45
12

Conjective remainder → 5, 12

3. Successive Remainder -

If 243 is successively divided by 5, 7, 4 leaves remained 3, 6, 2.

9 Adda247 Publications For any detail, mail us at

Publications@adda247.com
 "The Cracker" Practice Book for Algebra and Number System

4. Concept of Remainder –
A+B+C+D A +B +C +D
a. M
→ R = R RM R R

A×B×C×D AR ×BR ×CR ×DR

b. M
→R= M

c. Concept Negative Remainder –

27+29
5
=1
28×29
= −2 × −1 = 2
5

d. Concept of Modularity -
14 21
→R=2 R→3
4 6
÷3 ×3
7 7
→R=1 →R=1
2 2

5. Remainders of algebraic expressions

x+a
x
→R=a
(x+a)2 x2 +a2 +2ax
→ ⇒ R = a2
x x
(x+a)3 x3 +a3 +3ax(x+a)
x
→ x
→ P − a3
. .
. .
(x+a)n
x
→ R = an
Or
(tx+a)x
x
→ R = an [t − multiple of x]

1723 +2923
Eg - Find remainder in ?
23
(23−6)23 +(23+6)23
Sol. 23
→ R = (−6)23 + 623 = 0

6. Totient Method –
AD(ϕ)
D
→R=1
D (ϕ) − totient
A, D relatively prime or Co-prime numbers

How to find totient

1
5 ∶ −5 (1 − ) = 4
5
1 1
10 : - 2 × 5 → 10 (1 − 2) (1 − 5) = 4

For any prime number

1
Totient → a = a (1 − )
a
a–1
so, totient of 17 = 16
13 = 12

10 Adda247 Publications For any detail, mail us at

Publications@adda247.com
 "The Cracker" Practice Book for Algebra and Number System
25557
Eg. find R
13
Sol. Totient 13 = 12
5557
12
⇒R=1
21
13
⇒R=2

32
3232
Eg. 9
find R.
Sol.
1
9 = 32 D(ϕ) = 9 (1 − ) = 6
3
3232
→R=4
6
324 (27+5)4 54 25×25
9
→ 9
→ 9
→ 9
→ R = −2 × −2 = 4

7. Fermat Theorem -
aP−1
=R→1
P
P is a Prime number and a, p both are co-prime

2100
Eg. Find the remainder in 101
?
2100
Sol - 101
→ R = 1.

8. Wilson Theorem –
(P−1)!
P
= P −1 remainder
P is a prime no.
281
Eg. Find the remainder in 29
?
Sol – Remainder is 28.

9. Cyclicity / Pattern Theorem –

37100
Eg1. Find the remainder in ?
7
Sol –
1. Basic method
(37)100 (2)100 21 ×299 2×(23 )33
7
= 7
= 7
= 7
2×(8)33
= 7
⇒ Remainder = 2 × 1 = 2

2. Using cyclicity theorem

(37)100 (2)100
7
= 7
Finding out cyclicity remainder
21 ÷ 7 = 2
22 ÷ 7 = 4} These remainders are repeated
23 ÷ 7 = 1
The power of 2 from where the cycle starts repeating i.e. 3, the given power in question will
be divided by 3.
100 99+1
∴ 3 = 3 = Remainder = 1
Hence,
2100 100 21
7
= 3
= 7
⇒ Remainder = 2

11 Adda247 Publications For any detail, mail us at

Publications@adda247.com
 "The Cracker" Practice Book for Algebra and Number System

3. Using Totient method

(37)100 (35+2)100 2100 100
= = → D(ϕ) → =R=4
7 7 7 6
24 16
∴ 7
= 7
⇒ Remainder = 2

23
3523
Eg.2. Find of the remainder =?
16
Sol.
1. Using cyclicity theorem
23 23 23
3523 (32+3)23 323 3N
16
→ 16
→ 16 = 16
Finding out cyclicity 31 ÷ 16 = 3
3² ÷ 16 = 9
3³ ÷ 16 = 11
34 ÷ 16 = 1
2323 (20+3)23 323
→ → ⇒ R = (−1)23 = −1 + 4 = 3
4 4 4
23
3523 2323 353 (3)3
∴ 16
= 4
= 16
= 16
⇒ R = 11

2. Using Totient method

23 23 23
3523 (32+3)23 323
→ →
16 16 16
2 1
Totient of 16 → 16 = 4 → 16 (1 − ) = 12 = D(ϕ)
4
23
323 2323
→ →R→ (−1)23 + 12 = 11
16→D(ϕ) 12
Now,
3511 311 (34 )2 .33
→ → ⇒ R → 11
16 16 16

G. LCM AND HCF

1. Least Common Multiple (LCM) - LCM of x, y, z is the smallest number which is exactly divisible by
x, y, z.
Eg.
Multiple of 12 – 12, 24, 36, 48, 60, 72, 84, 96
16 – 16, 32, 48, 64, 80, 96
Common – 48, 96
Least – 48. → LCM
How to find LCM?
a. Prime factor Method -
12 → 2 × 2 × 3
16 → 2 × 2 × 2 × 2
LCM → 2 × 2 × 3 × 2 × 2 = 48
b. Division Method –

LCM – 2 × 2 × 3 × 4 = 48

12 Adda247 Publications For any detail, mail us at

Publications@adda247.com
 "The Cracker" Practice Book for Algebra and Number System

c. Shortcut Method –
Eg. 12, 16
Let LCM be the largest number of the two = 16
4 3

12
4 is present in 16 but 3 is not present in 16, hence multiply 16 with 3 to get the
LCM.
LCM = 16×3 = 48

Eg. 3 3 4 3 5 3

LCM of 9, 12, 15
LCM → 15 × 3 × 4 = 180

Eg. 5 5 5 7 6 7

LCM of 25, 35, 42

LCM → 42 × 25 = 1050

Questions Answers
Find the smallest number which is exactly divisible by x, y, z? LCM of x, y, z.

Find the smallest number which is divided by x, y, z and LCM of (x, y, z) + r

leaves remainder r?

Find the smallest number k which is divided by x, y, z and LCM of (x, y, z) – k, where
leaves remainder a, b, c respectively. k=x–a=y–b=z–c

Eg. Find the smallest no. which is divided by 25, 15, 30 and leaves remainder 21, 11, 26
respectively?
25 15 30
Sol. K = 21 11 26
4 4 4
LCM →

Smallest No. → 150 – 4 = 146

Why k be subtracted?

13 Adda247 Publications For any detail, mail us at

Publications@adda247.com
 "The Cracker" Practice Book for Algebra and Number System

Eg. Find the smallest number which is divided by 2, 3, 4, 5, 6 and leaves remainder 1 in each
case but number is exactly divisible by 7?
Sol - LCM of 2, 3, 4, 5, 6
⇒ 6 × 5 × 2 = 60
60 + 1 but divisible by 7.
60k+1
⇒R=O
7
56k + 4k + 1
Now put k = 1, 2, 3, . ______n.
⇒K=5

60 × 5 + 1 = 301 Ans.

2. Highest Common Factor (HCF) –

HCF of x, y, z is the largest number which can divide x, y, z exactly

Eg.
12 → 1, 2, 3, 4, 5, 6, 12
Factor
16 → 1, 2, 4, 8, 16
Common → 1, 2, 4
Highest → 4 → HCF

3. How to find HCF?

a. Prime factor Method -
12 → 2 × 2 × 3
16 → 2 × 2 × 2 × 2
HCF → 2 × 2 = 4.

b. Division Method -

Final divisor = 4
Quotients = 1, 3

c. Shortcut method –
HCF can never be greater than the difference of two numbers. HCF may be difference or
factor of difference.

Note - If two number are divided by their difference or factor of difference then it leaves
same remainder.
14 Adda247 Publications For any detail, mail us at
Publications@adda247.com
 "The Cracker" Practice Book for Algebra and Number System

Eg. In finding the HCF of two number by division method then three quotients are 5, 4, 3 and
final divisor is 32. Find the number?
Sol.

Questions Answers
Find the largest number which can divide x, HCF of x, y, z
y, z exactly.

Find the largest number which can divided HCF of x–r, y–r, z–r
x, y, z and leaves remainder ‘r’ in each case. or
HCF of |x − y|, |y − z|, |z − x|

Find the largest number which can divided HCF of (x-a), (y-b), (z-c)
x, y, z and leaves remainder a, b, c.

Eg. Two number 225 and 147 are divided by a two digit number that leaves same remainder.
How may two digit number are possible?
Sol.

4. Relation between HCF and LCM

⇒ Product of two number = Product of their HCF and LCM
Note - If HCF of two number is H then number can be Hx and Hy where x and y are relatively prime
numbers.

5. LCM and HCF of decimal

Eg. LCM and HCF of 0.6, 1.8, 0.36.
Sol.
6 18 36
Gererally we go with this ,
10 10 100
,
36
LCM = 10 = 3.6
6
HCF = = 0.065
{ 100 }
Totally wrong.

60 180 36 12
HCF of , , → = 0.12 Ans.
100 100 100 100

15 Adda247 Publications For any detail, mail us at

Publications@adda247.com
 "The Cracker" Practice Book for Algebra and Number System

6. LCM and HCF of fraction

a c e LCM of a,c,e
LCM of b , d , f = HCF of b,d,f

a c e HCF of a,c,e
HCF of b , d , f = LCM of b,d,f

Eg. Four bells ring after an interval 9, 12, 15, 18 sec. In 36 min how many times will they ring together?
Sol. LCM of 9, 12, 15, 18 = 18 × 2 × 5 = 180 sec. = 3 min.
36
3
= 12 time + 1 time = 13 times
↓
first time

H. Sequence and Series

1. Arithmetic Progression (AP) –

AP series
→ a, a + d, a + 2d, a + 3d………
⇒ a =1st term, d = Common difference
⇒ nth term, Tn = a + (n – 1)d
n n
⇒ Sum of n terms, Sn = 2 [2a + (n − 1)d] = 2 [a + l], where l is the last term
Note –
n(n+1)
1. Sum of 1st ‘n’ natural numbers = 2
2 last term+1
2. Sum of 1st ’n’ odd numbers = n → [where ⇒ n = 2
]
Last term
3. Sum of 1st ‘n’ even numbers = n(n + 1) → [n = 2
]
n(n+1)(2n+1)
4. Sum of squares of 1st ‘n’ natural numbers = 6
n(n+1) 2
5. Sum cubes of 1st n natural numbers = [ ]
2
2n (n+1)(2n+1)
6. Sum of squares of 1st n even numbers = 3

2. Geometric Progression (GP) –

⇒ nth term = t n = ar n−1
where a is the first term, r is the common ratio, and n is the number of terms.
⇒ Sum of n terms of a geometric progression
a(1−rn )
Sn = 1−r when r ≠ 1
sn = na when r = 1
Where n = number of
terms, a = first term, and d = common difference
a
⇒ Sum of infinite GP = 1−r, where -1<r<1.

16 Adda247 Publications For any detail, mail us at

Publications@adda247.com
 "The Cracker" Practice Book for Algebra and Number System

I. Surds and Indices

1. Laws of Indices
a. am × an → am+n
am
b. = am−n
an
c. (am )n → amn
n
d. am → am×mx…..n times ≠ amn
a n an
e. (ab)n → an bn , ( ) → n
b b
n
n
(−a) → a → n = even
f. ]
−an → n = odd
1
g. = a−n
an
h. am = an , then m = n or am = bm then a = b

2. Laws of surds
n n
a. √a → a
n
n n n n a √a
b. √ab = √a. √b, √b = n
√b
m n n
c. √ √a = mn√a = √ m√a
m m
n
d. ( √a) = (a) n

√a × √b = √ab

ALGEBRA
A collection of variables and constant connected by Mathematical symbols and the rules.

Type 1. Formula based algebra

1. Square formula
1. (a + b)² = a² + b² + 2ab
2. (a – b)² = a² + b² - 2ab
3. (a + b)² = (a – b)² + 4ab
4. (a - b)² = (a + b)² - 4ab
5. (a² - ab + b²) (a² + ab + b²) = a4 + a²b² + b²
6. (a + b)² – (a - b)² = 4ab
7. a² - b² = (a + b) (a -b)

In this type question use direct formula

→ same question belong to perfect square

2. Cube formula
1. (a + b)³ = a³ + b³ + 3ab (a + b)
2. a³ + b³ = (a + b)³ -3ab (a + b)
3. a³ + b³ = (a + b) (a² - ab + b²)
4. (a -b)³ = a³ - b³ - 3ab (a -b)
5. a³ - b³ = (a – b)³ + 3ab (a -b)
6. a³ - b³ = (a – b) (a² + ab + b²)

17 Adda247 Publications For any detail, mail us at

Publications@adda247.com
 "The Cracker" Practice Book for Algebra and Number System

Special case 1. If a² - ab + b² = 0 then a³ + b³ = 0

⇒ if b = 1, then a2-a+1=0, then a3+1 = 0 or a3 = -1

Special case 2. If a² + a + 1 = 0 then a³ - 1 = 0 or a³ = 1

a b
Special case 3. If + = 1 then a³ + b³ = 0
b a
1 1 1
⇒ If − = then a3 + b3 = 0
a b a−b

a b
Special case 4. If b + a = −1 then a³ - b³ = 0
a b 1
⇒ If b + a = a+b then a3 − b3 = 0

1
Special case 5. If ab (a + b) = 1 then a3b3 − a3 − b3 = 3

3. Cube formulae of three variables

a³ + b³+ c³ - 3abc
1
= 2 (a + b + c)[(a − b)2 + (b − c)2 + (c − a)2 ]
= (a + b + c)(a2 + b2 + c 2 − ab − bc − ca)

(i) If (a + b + c) = 0
Then a³ + b³+ c³ - 3abc = 0
a³ + b³ + c³ = 3abc

(ii) If a³ + b³ + c³ - 3abc = 0
a, b and c are distinct no
then, a + b + c = 0

(iii) a³ + b³+ c³- 3abc = 0

a, b and c all are +ve integer no then, a = b = c.

(iv) a² + b²+ c² - ab – bc – ca = 0
a²+ b² + c² = ab + bc + ca
then a = b= c

4. Square of three variable

(a + b + c)² = a² + b² + c² + 2(ab + bc ca)

Type II – Type Base Questions

1 1
1. If x − x = a then x + x2 = a2 + 2 2
1
and x 4 + x4 = (a2 + 2)2 − 2

1 1
2. If x + x = a then x 3 + x3 = a3 − 3a
1 1
If x − = a then x 3 − = a3 + 3a
x x3

1
3. If x + x = a
1
Then x 5 + = (a2 − 2)(a3 − 3a) − a
x5
1
If (x − ) = a, then
x
1
x − x5 = (a2 + 2)(a3 + 3a) − a
5

18 Adda247 Publications For any detail, mail us at

Publications@adda247.com
 "The Cracker" Practice Book for Algebra and Number System
1 1
4. x + x = a, then x 6 + x6 = (a3 − 3a)2 − 2

1 1
5. x + x = a, then x 7 + x7 = ((a2 − 2)2 − 2) × (a3 − 3a) − a
1 1
x − x = a, then x 7 − x7 = ((a2 + 2)2 − 2) ×(a³+3a) + a

1 1
6. If x + x = √2 then x 2 + x2 = 0 or x 4 + 1 = 0 o x 4 = −1

1 1
7. x + = ±√b 2 + 4 & x − = ±√a2 − 4 ,
x x
Is also applicable of any power of x.

1 1
8. If x + = √3 then x 3 + = 0 or x 6 = −1
x x3

1
9. If x + = 2 then x = 1
x
1
If x + = -2 then x = -1
x

1 1
10. If x n + = a then x n − = ±√a2 − 4
xn xn
1 1
If x n − = b then x n − = ±√b 2 + 4
xn xn

1
11. When a + = 1,
a
Or,
a2 − a + 1 = 0
Then a³ = -1
Or,
a³ + 1 = 0
1
⇒When a + a = −1
Or,
a²+ a + 1 = 0
then,
a³ = 1

12. If x + y = 0, then x = -y
Or
x = 0, y = 0
⇒ if x² + y² = 0
then, x² = 0, x = 0
and, y² = 0, y = 0
⇒ if (x - 1)² + (y – 2)² = 0
then we can say x = 1 and y = 2

1
13. Rationalising factor of the surd x = √a ± √b and x = √a ∓ √b
Note :
1 1
If xy = 1 then 1+x + 1+y = 1

19 Adda247 Publications For any detail, mail us at

Publications@adda247.com
 "The Cracker" Practice Book for Algebra and Number System

Type III – Maximum and Minimum Value

1. For quadratic expression ax² + bx + c

⇒ If a is – ve then graph has a maxima

b
⇒ for maximum value of expression, x = 2a
4ac−b²
Maximum value of expression =
4a
⇒ if a is + ve then graph has a minima

b
⇒ for minimum value of expression x = 2a
4ac−b²
⇒ minimum value of expression x =
4a

Note - Maximum value of a (function) + b(inverse function) minimum value is 2√ab

b
ax n + n ≥ 2√ab
x

2. Arithmetic Mean (AM) & Geometric Mean (GM)

⇒ A and b are two numbers
Then,
a+b
A. M = 2
And G.M. = √ab
⇒ Thus, when a, b and c are three numbers
Then,
A. M. = a + b + c
3
G.M. = √abc

⇒ Relation between A.M & G.M

⇒ A.M. ≥ G.M.
When a, b, c are + ve Real number
1
m and m are two numbers
1
m+ 1
A. M. = 2
m
, G.M = √m × m
⇒ A.M. ≥ G.M.
1
m+ 2 1
2
m
≥ √m × m
1
m+
m
≥1
2
1
m+
2
≥2m

⇒ When m is +ve Real number.

20 Adda247 Publications For any detail, mail us at

Publications@adda247.com
 "The Cracker" Practice Book for Algebra and Number System
1
Minimum value of m + m = 2
And,
⇒ We can say minimum value
1
mn + mn = 2
When m is + ve real number
Note : ⇒ If x + y will be given then, xy will be maximum, when x=y
⇒If x, y will be given then x + y will be minimum when x = y here x & y (+ve) real number

Type IV - Componedo & Dividendo

a x a+b x+y
If = then C & D ⇒ =
b y a−b x−y
Special case :
2nab x+na x+nb
If x = a+b
then x−na + x−nb = 2

Type V – Quadratic Equation

Quadratic equation ax² + bx + c = 0

⇒ roots of equation are
−b+√b2 −4ac −b−√b2 −4ac
α= 2a
,β 2a
b
⇒ sum of roots = α + β = −
a
c
⇒ product of roots = αβ =
a
⇒ An equation whose roots are α and β is given by
x² - (α + β)x+ αβ = 0
⇒ Discriminant (D) = b² - 4ac

Note : In some question will use concept of ratio

a c e
If b = d = f = k
a±c c±e a±e a±c±e
then b±d = d±f = b±f = b±d±f = k

21 Adda247 Publications For any detail, mail us at

Publications@adda247.com