NUMBER SYSTEM

1.

 Number System

INTRODUCTION
It would not be an exaggeration to say that one cannot imagine having
strong hold in QA without the knowledge of Numbers. Numbers are one
of the most important chapters for CAT. Every year almost 3-4 direct
questions come from this chapter, but its applications are widely used
to solve questions from other sections like Modern Math, Geometry and
Algebra. One needs a very careful and rigorous practice to understand the
fundamentals involved in it.

1. CLASSIFICATION OF NUMBERS
Number System

2.
REAL NUMBERS
Numbers which can be represented on number line. For each real number
there is a unique point on number line.

Examples:
2, 3, 7.54, –3.47, 5, 23 etc.
Key Note

22
• Actual value of π ≠ . It is just
7
RATIONAL NUMBERS approximated for calculation
Numbers which can be represented in p/q form purpose.
(where, p and q are integers and q ≠ 0) • Any recurring decimal that form
Examples: a fixed pattern is a rational
number and hence can be
2.5, 3/7, 11, –53, –207, 5.333,…………. etc. p
exposed in form.
q
IRRATIONAL NUMBERS
Examples : 3.43333………….
Numbers which can not be represented in p/q
0.55555………….
form. All decimals that are non-terminating and
non-recurring comes under irrational category. 1.27777………….
• 
Only non-terminating and non-
Examples:
recurring decimals are irrational
n, Prime No, 3
5 …………. etc. rest in all case,it is rational.

Expressing recurring decimals to p/q form:

Example 1:

Convert 0.7777,…………. in p/q form:

7
Sol. K=
9
Explanation:
Let’s assume, K = 0.7777 ...(i)
10 K = 7.7777 ...(ii)
Number System

7
From, (ii) – (i), 9K = 7 K= Ans.
9

3.
 Example 2:

Convert 1.233333…………. in p/q form:

111 37
Sol. K= =
90 30
Explanation:
Let’s say K = 1.2333………….
In first step we will take non recurring digits in left side of decimal.
10 K = 12.3333 ...(i)
Now, 100K = 123.3333 ...(ii)
111 37
From, (ii) – (i), 90K = 111 =
K = Ans.
90 30

Example 3:

Conduct 3.0535353…………. in p/q form.

3023
Sol.
990
Explanation:
3053 − 30 3023
=
Using trick: 3.053 = Ans.
990 990

Example 4:

23
If 0.XYZXYZXYZ………… = Key Note
27
Find X + Z – Y
• “0” is neither positive or negative
Sol. 4 integer.
• 
Mind here if in any question it
Explanation:
is asked to take non-negative
XYZ 23 integers one need to consider
0.XYZXYZXYZ………… = 0. XYZ
= =
999 27 zero and positive integers
23 × 999 both. Similarly for non-positive
Number System

⇒ XYZ = = 851
27 integers one need to consider
zero and negative integers both.
Hence, X + Z – Y = 8 + 1 – 5 = 4 Ans.

4.
 Example 5:

If N = 0. a1 a2 a1 a2 a1 a2......, then which of the following number should be

multiply with 'N' so that it becomes an integer.
(1) 999 (2) 1998
(3) 9990 (4) 297

Sol. (4); 297)

Explanation:
We have, 0. a1 a2 a1 a2 a1 a2......,
Or, N = 0. a1 a2
Since, number is non-terminating but repeating
p
Therefore, it can be expressed in the form of
q
a 1 a2
Hence, N = Short Trick
99
Now, to make it an integer we need to multiply by
Step 1 : Represent the number in
99 or multiply of 99.
the form of bar.
Therefore, 4th option is correct choice. Eg : 1.573333…………. = 1.573

INTEGERS Step 2 : For numerator, write the

whole number as it is and subtract
Integers are the complete numbers or the the numbers that are not repeating.
numbers that are not fractions. Integers are of
3 types: So, numerator of
= 1573 − 157 = 1416
1.573
1. Positive integers: 1, 2, 3, 4, 5,………….
2. Negative integers: –1, –2, –3, –4,…………. Step 3 : For denominator, write as
many 9’s as the number of digits
3. Zero
repeated followed by 0’s as many
times as number of digits non-
FRACTIONS
repeated after decimal.
Fraction represents the part or portion of a whole So, denominator of
thing. It can be categories in 3 ways:
1. Proper fraction:
Number System


When numerator is less than denominator.
1416 118
E.g. : 2/3, 5/7, 11/15 etc. Hence, 1.573
= =
900 75

5.
 2. Improper fraction:
When numerator is greater than denominator. Previous Year Question
E.g. : 5/3, 9/7, 7/4 etc.
How many 3-digit numbers are
3. Mixed fraction: there, for which the product of

As the name suggest its combination of their digits is more than 2 but less
natural number and fraction. than 7?

3 1 2
E.g. : 2 , 3 , 1 etc.
5 2 7

Integers can be further classified in two important categories :

1. Even Numbers:

Integers which are divisible by 2 or integers of the form 2n (where, n is
a natural number).
E.g. : 0, 2, 4, 6, –10, 12 etc.

2. Odd Numbers:
Integers which are not divisible 2 or integers of the form (2n – 1) (where,
n is a natural number).
E.g. : 1, 3, 5, 7, –3, –5, –13 etc.

SOME IMPORTANT PROPERTIES OF EVEN AND ODD NUMBERS

(a) Even × any number = Even (b) Odd × Odd = Odd
(c) Even + Even = Even (d) Even + Odd = Odd
(e) Odd + Odd = Even
(f) (Even)N = Even; where N is natural number.
(g) (Odd)N = Odd; where N is a natural number.

Example 5:

Given a and b are positive odd integers and c is positive even integer. Which
of the following is odd?
(1) (a + b)2 × c (2) a2 + c2 – b2
Number System

(3) (a + b + c) (a – b) (4) a2 (b + c)

Sol. (4); a2 (b + c)

6.
Explanation:

(A) (a
 + b)
 × C
2

(No Need
to check)
↓
Even
Any number × Even ⇒ Even Trivia

(B) a2 + c2 – b2 Originally even and odd were

classified as natural numbers but
↓ ↓ ↓
Odd Even Odd in today’s time they are considered
under integers classification (i.e.,
⇒ Odd + Even – Odd even and odd can be non-positive
⇒ Odd – Odd ⇒ Even integers also).

(C)

Any number × Even ⇒ Even

(D) a2 (b + c)
↓ ↓ ↓
Odd Odd Even
⇒ Odd × (Odd + Even) ⇒ Odd × Odd ⇒ Odd
Hence, option “D” is correct.

Integers can also be classified as :

1. Whole Number : Whole numbers are non-negative integers.

E.g. : 0, 1, 2, 3, 4, 5,………..

2. N
 atural Numbers : Positive integers are natural numbers. These are also
known as counting numbers.
E.g. : 1, 2, 3, 4, 5,………..

Natural numbers can be classified in 3 categories :

Prime number, Composite number and 1.

1. Prime Number :
Number System

Natural numbers having exactly 2 distinct factors are called prime.

E.g. : 2, 3, 5, 7, 11,………..

7.
 •  ll prime numbers are either divisible by 1 or
A
itself.
• very prime number greater than 3 can be
E
Key Note
written in the form of (6k + 1) or (6k – 1)
• 1 is neither prime nor composite.
(where, k is a natural number) but vice-versa
is not always true. • 
2 is only even prime number
and it is also the smallest prime
13 = 6 × 2 + 1 → Prime
number.
29 = 6 × 5 – 1 → Prime
• 
3, 5, 7 is only triplet of prime
But, 6 × 4 + 1 = 25 → Not prime
number which are at a difference
•  P is a prime number greater than 3 then P2
If of 2. No other triplet of prime
– 1 is always divisible by 24. numbers satisfies this condition.

2. Composite Number :
Natural numbers having at-least 3 distinct factors are called composite.
E.g. : 4, 6, 8, 9, 10,………..

How to check whether a number is prime or not?

One need to check the divisibility of given number by all prime numbers
less than the square root of given number.

For examples : Let us check 259.

259 < 17

Only check the divisibility of 259 by prime numbers less than 17.
13,   11,   7
×   ×   ×
Previous Year Question
∴ 259 is divisible by 7, hence it is not prime.

In a six-digit number, the sixth,

3. Co-Prime Numbers : Pair of numbers whose that is, the rightmost, digit is the
HCF is 1. sum of the first three digits, the
E.g.: (2, 3), (7, 8), (11, 15) etc. are coprime pairs. fifth digit is the sum of first two
digits, the third digit is equal to
Mind here in coprime pair it is not necessary the first digit, the second digit is
for both the numbers to be prime. twice the first digit and the fourth
digit is the sum of fifth and sixth
Number System

digits. Then, the largest possible

value of the fourth digit is

8.
2. DIVISIBILITY RULES

Rule for 2n or 5n type numbers :

Last n digits of the number should be divisible Previous Year Question
by 2n or 5n
If the product of three consecutive
For Example : positive integers is 15600 then,
the sum of the squares of these
Rule for 4 :
integers is:
4 = 22; check only last two digits of the number.
(1) 1777 (2) 1785
E.g. : 237896 is divisible by 4 because 96 is
(3) 1875 (4) 1877
divisible by 4.

Rule for 125 :

125 = 53, check if last 3 digits of number is divisible by 125.

Example 1:

Check if 1112131415……….1920 is divisible by 16? If not find the remainder.

Sol. 16

Explanation:
For divisibility rule of 16 (= 24) divide only last 4 digits of the number.
Rem [1920/16] = 0
Hence, 1112131415………. 1920 is completely divisible by 16.

Example 2:

1457865XY is divisible by 8. What can be the maximum value of X + Y

(1) 11 (2) 12
(3) 14 (4) 16

Sol. (3); 14
Number System

Explanation:
1457865XY is divisible by 8, so 5XY should be divisible by 8.

Start putting the values as X = 0 and Y = 0; 500 is not divisible by 8.

9.
 Put X = 0 and Y = 1; 501 is not divisible by 8.
Put X = 0 and Y = 2; 502 is not divisible by 8.
Put X = 0 and Y = 3; 503 is not divisible by 8.
Put X = 0 and Y = 4; 504 is divisible by 8.
Next numbers divisible by 8 would be at difference of 8.
So, all XY = {04, 12, 20, 28, 36, 44, 52, 60, 68, 76, 84, 92}
Maximum of X + Y = 6 + 8 = 14. Option (3) is correct.

Rule for 3 :
Sum of digits of the number should be divisible by 3.
E.g. : 23481 is divisible by 3 because 2 + 3 + 4 + 8 + 1 = 18 is divisible by 3.

Rule for 9 :
Sum of digits of the number should be divisible by 9.
E.g. : 3615184 is divisible by 9 because 3 + 6 + 5 + 1 + 8 + 4 = 27 is divisible
by 9.

Digital Sum :

Digital sum is the sum of digits of the number till a single digit is obtained.
E.g. : Digital sum of 247 is 2 + 4 + 7 = 13 → 1 + 3 = 4
Remainder obtained by dividing any number by 9 is equal to the digital sum
of that number. Digital sum of all the multiplies of 9 is 9.
Hence, for the divisibility of 9 one should use the concept of digital sum to
easily approach the problem.

Rule for 11 :
If the difference of sum of digits at odd places and sum of digits at even
places is 0 or any multiple of 11 then the number is divisible by 11. (Assign
alternate + and – sign from right hand side, add all + values of all – values
and then take their difference)
E.g. : Check 1253478
+ – + – + – + Previous Year Question
1 2 5 3 4 7 8
How many 3-digit numbers are
= (8 + 4 + 5 + 1) ~ (7 + 3 + 2) = 18 ~ 12 = 6 there, for which the product of
Number System

their digits is more than 2 but less

Which is not divisible by 11.
than 7?
Hence, the given number is not divisible by 11.

10.
DIVISIBILITY RULES FOR COMPOSITE NUMBERS
Divisibility rules of composite numbers can be easily created by following
two rules :
1. Select coprime factors of the composite number.
2. Product of these coprime factors should be equal to the composite number.

For Example :
Divisibility rule of 6 → (2, 3); if a number is divisible by 2 and 3 both it must
be divisible by 6.
Divisibility rule of 21 → (3, 7); if a number is divisible by 3 and 7 both it must
be divisible by 21.
Divisibility rule of 72 → (8, 9); if a number is divisible by 8 and 9 both it must
be divisible by 72.

Example 3:

If a and b are the two digits of the number 843ab such that this number is
divisible by 40, then a + b can be?
(1) 1 (2) 2
(3) 3 (4) 5

Sol. (2); 2
Explanation:
For divisibility by 40 number should be divisible
by 8 and 5 both.
For divisibility by 5, b can be 0 or 5. But, if we
take b = 5 number becomes odd and it would
not be divisible by 8.
Hence, b = 0.
Now, last 3 digits of 843ab, i.e., 3a0 should be
divisible by 8. Previous Year Question
Put, a = 2 → 320 is divisible by 8.
The mean of all 4 digit even natural
Next number would be 320 + 40 = 360. numbers of the form ‘aabb’, where
So, there are two values of a = {2, 6} a > 0, is
Number System

Hence, a + b can be either 2 + 0 = 2 or 6 + 0 = 6. (1) 5544 (2) 4466

Option (2) is correct. (3) 4864 (4) 5050

11.
 COMMON DIVISIBILITY RULE OF 7, 11 AND 13

7, 11 and 13 are the factors of 1001 and they are coprime to each other.
1001 = 7 × 11 × 13
Remainder [103/1001] = –1
Also, Remainder [103/7] = –1,
Remainder [106/7] = 1
Remainder [109/7] = –1; and so on.
Same result we get in case of 11 and 13 also.
To check the divisibility of any large number by 7, 11 or 13 or to find the
remainder, make pairs of 3 digits from right hand side and assign alternate
+ and – sign to the pairs. Add all + pairs and all – pairs and then take their
difference. If this difference is divisible by 7 or 11 or by 13, then the original
number would be divisible by 7 or 11 or by 13.
E.g. : Check divisibility of 10573240035 by 7
– + – +
⇒ 10 | 573 | 240 | 035 — (Make pairs from right side)
⇒ (573 + 35) ~ (10 + 240)
⇒ 608 ~ 250    ⇒ 358
∴ 358 is not divisible by 7, the given number is not divisible by 7.

Example 4:

Find remainder when 151152153………. 199200 is divisible by 13.

Sol. 12

Explanation:
From 151 to 200 there are total 50 numbers of 3 digits.

Take pair of two consecutive numbers from right side and add them up.
Number System

⇒ + 1 + 1 + 1 + 1 ………… up to 25 times.   ⇒ 25
 25 
Rem   = 12
 13 

12.
3. SUCCESSIVE DIVISION

In successive division the quotient obtained in first division acts as dividend

for the second division and quotient obtained in second division acts as
divided for third division and son on.
Let’s consider a number N is successively divided
by a, b and c and remainder obtained are r1, r2 Short Trick
and r3 respectively.
a)N(q1 b) q1 (q2 c) q2 (q3
⇒ ⇒
r1 r2 r3
⇓ ⇓ ⇓
N = aq1 + r1  q1 = bq2 + r2 q2 = cq3 + r3

Let q3 = 0 ⇒ q2 = r3

So, q1 = br3 + r2 Create two columns of divisor and

remainder. Start from last row of
N = a(br3 + r2) + r1
second column, go diagonally up and
N = abr3 + ar2 + r1 multiply (br3) then add horizontally
(br3 + r2) again go diagonally upward
⇒ This is least such number
multiply {a (br3 + r2)} then add
For general number. horizontally {a(br3 + r2) + r1}.

Example 1:

How many three-digit numbers exist which on successive division by 5, 8

and 9 leaves remainder of 2, 3 and 4 respectively?

Sol. 3

Explanation:

General form of the number is = LCM (5, 8, 9) K + 177 = 360 K + 177

Number System

Put, K = 0, 1, 2, 3, ……………
Desired three digit number = 177, 537 and 897.
Hence, 3 such numbers are possible.
13.
 Example 2:

A number is successively divided by 5, 7 and 11 and leaves remainder 1, 3

and 5 respectively. Find the respective remainders when order of division
is reversed?

Sol. 2

Explanation:

So, the least such number is 191.

When the order of divisor is changed.

Hence, respective remainder when number is successively divided by 11, 7

and 5 are 4, 3 and 2.

4. FACTOR THEORY

FACTOR

Factors are the natural numbers less or equal to the given number that
divide it completely.
Basically, factors are the divisors of the given number.
E.g. : Factors of 12 → 1, 2, 3, 4, 6, 12
Factors of 56 → 1, 2, 4, 7, 8, 14, 28, 56.

PRIME FACTORIZATION
Number System

According to Fundamental Theorem of Arithmetic, every natural number

(except 1) can be represented as product of one or more prime numbers.

14.
And, this process of breaking down any number to the product of prime
numbers is known as prime factorization.

E.g. : 24 = 2 × 2 × 3 = 22 × 3
60 = 6 × 10 = 22 × 3 × 5

In general, prime factorization of number N is represented as :

N = pa × qb × rc  (Where, p, q and r the prime numbers and a, b
and c are whole numbers).

FINDING NUMBER OF FACTORS

36 = 6 × 6 = 22 × 32
        ↓   
↓
 20   30 
 1  1
2  3 
 2  2
       2  3 
        ↓    ↓
   3 ways 3 ways Key Note

Total = 3 × 3 = 9 factors. • Number of factors of any perfect

If N = pa × qb × rc square is always odd.
Numbers of factors of N • Number of factors of square of
any prime number is 3.
= (a + 1) × (b + 1) × (c + 1)

NUMBER OF EVEN AND ODD FACTORS

Even Factor :

1800 = 18 × 100 = 2 × 32 × 102 = 2 × 32 × 22 × 52

= 22 × 32 × 52
↓ ↓ ↓

 21   30   50 
 2  1  1
2  3  5 
 3  2  2
 2   3  5 
Number System

   
3

ways
3 Ways
3 ways

Even factors = 3 × 3 × 3 = 27.

15.
 Note :  One should not take 2° while calculating even factors because
2° = 1; and it’s any combination with other prime numbers will
give odd factor only.

Odd Factors :

1800 = 23 × 32 × 52
2 is even prime number and any exponent of 2 (except 2°) will also be an
even number.
Hence, while calculating odd factors one should neglect 2 from prime
factorization.

1800 = 22 × 32 × 52
↓ ↓ ↓
 30   50 
 1  1
(2 )
0
3  5 
 2  2
3  5 

Odd factors = 1 × 3 × 3 = 9

NUMBER OF PERFECT SQUARE AND PERFECT CUBE FACTORS

For perfect square factors only consider even power of prime number.

For Example :

1800 = 25 × 37 × 73
↓ ↓ ↓
 30 
 20   2
 2 3   70 
2   4  2 
 4
2 3  7 
   36 
 
↓ ↓ ↓
3 ways 4 ways 2 ways

Number of perfect square factors of N = 3 × 4 × 2 = 24

Number System

For perfect cube factors consider the power of prime number which are
multiple of 3.

16.
For Example :

N = 25 × 37 × 73
↓ ↓ ↓ Previous Year Question
 30 
 20   3  70  How many natural numbers less
 3  3   3  than or equal to 15 have 4 factors
2   6
3 7 
  each?
↓ ↓ ↓
2 ways 3 ways 2 ways

Number of perfect cube factors of N = 2 × 3 × 2 = 12

FINDING SUM OF THE FACTORS

Consider a number N = 23 × 32 × 54
Sum of factors of N can be given as :
= (20 + 21 + 22 + 23) × (30 + 31 + 32) × (50 + 51 + 52 + 53 + 54)

Now, the given expression is in G.P. and use know that:

a(rn − 1)
Sum of GP = ,r>1
(r − 1)

Where, a → first term

r → common ratio
and n → number of terms

2°(24 − 1) 3°(33 − 1) 5°(55 − 1)

Therefore, × ×
(2 − 1) (3 − 1) (2 − 1)
= 15 × 13 × 781 = 152295

Note: If any number say 'N' can be expressed as:

N = ap × bq × cr ×......,
where a, b, c are prime factors and p, q, r, ∈ W, then

(ap+ 1 − 1)(bq+ 1 − 1)(cr + 1 − 1)

Sum of all factors/divisors = × ......
(a − 1)(b − 1)(c − 1)
Number System

17.
 FINDING PRODUCT OF THE FACTORS
Let’s take a small number and understand the concept behind product of
factors.
20 = 1, 2, 4, 5, 10, 20

Product of factors =

= (1 × 20) (2 × 20) (4 × 5)
= 20 × 20 × 20 = 203

Observe here, 20 has 6 factors, which can be paired in 3 ways.

So, it can be generalized.

 no. of factors 
 
Product of factors of N = N 2 

Note : The above formula is applicable even when total number of factors
are odd (as in case of perfect squares).

In how many ways a number can be written as product of its two factors?
Let’s see for 40
40 → 1, 2, 4, 5, 8, 10, 20, 40 = Total 8 factors

40 = (1 × 40

40= (1 × 40) 
= (2 × 20)
 4 ways
= (4 × 10) 
= (5 × 8) 

So, it is obvious that if a number has n number of factors (and n is even),

they can be paired in n/2 ways to get the product as original number.

Total no. of ways of writing any number as product

Total No. of factors
of it's two factors =
2
Number System

This is applicable when total number of factors is even for any number (i.e.,
Non-perfect square numbers).

18.
When number of factors are odd (for perfect squares) :

16 = There are 2 ways of writing 16 as its two distinct factors.

But, there is one more way = (4 × 4)
So, total ways of writing 16 as it’s two factors is 3.

Therefore, one can generalize :

Number of ways of writing any number as it's two

 Total No. of factors − 1 
"distinct" factors =  
 2 
Total number of ways of writing any number as it's
 Total no. of factors + 1 
two factors =  
 2 

In how many ways a number can be written as product of its two co-prime
factorts?
Let’s see for 48
48 = 16 × 3 = 24 × 31

Writing 48 as product of it’s 2 corpime factors.

48= (1, 24 × 3) ⇒ (1 , 48)

 2 ways
= 4
(3, 2 ) ⇒ (3, 16) 

By permutation and combination concept it can be shown that number of

ways of writing any number as product it’s two co-prime factors = 2p – 1.
Where, p is number of prime numbers used in prime factorization.
E.g. : 120 = 12 × 10 = 23 × 31 × 51
So, p = 3 {∴ 3 prime number are used in prime factorization}

Total ways of writing 120 as it’s co-prime factors

= 23–1 = 22 = 4 Ans.
Number System

And, can manually verify also,

120 = (1, 23 × 3 × 5), (3, 23 × 5), (5, 23 × 3), (23, 3 × 5).

19.
 Finding the number when it’s number of factors are given:
Let us understand it by an example:
If a number N has 10 factors.
N = P1a × P2b × P3c × ………….
So, (a + 1) (b + 1) (c + 1) …………. = 10
Now, see in how many ways 10 can be written as product of two numbers,
three numbers and so on.
Accordingly, the value of a, b, c,…………. can be determined.
10 → (1 × 10) → (a + 1) (b + 1) = 1 × 10 ⇒ a = 0, b = 9
→ (2 × 5) → (a + 1) (b + 1) = 2 × 5 ⇒ a = 1, b = 4
Hence, N = P10 × P29 = P29 or P9 (where, P can be any prime number)
  Or,
N = P11 × P24 = P1P24
(Where, P1 and P2 can be any two distinct prime numbers)

Example 1:

If N3 has 70 factors. Find minimum value of N.

Sol. 72

Explanation:
Try to breakdown 70 as product of two numbers, three numbers and so on.
70 → 1 × 70 ⇒ N3 = p69 ⇒ N = p23
→ 2 × 35 ⇒ N3 = pq34
(Not possible because exponents of prime numbers should be multiple of 3)
70 → 5 × 14 ⇒ N3 = p4 q13 (Not possible)
→ 7 × 10 ⇒ N3 = p6 q9 ⇒ N = p2 q3  
→ 2 × 5 × 7 ⇒ N3 = pq4 r6 (Not possible)

So, N can be either p23 or p2q3 type.

For minimum value of N.
Number System

Take N = p2q3
Put, p = 3 and q = 2 (Two least prime numbers)
Hence, Nmin = 32 × 23 = 9 × 8 = 72 Ans.

20.
 Example 2:

If N = 25 × 34 × 56 × 72. Find :
(i) Number of perfect square factors of N
Previous Year Question
(ii) Number of perfect cube of factors of N
(iii) Number of factors of N which are How many factors of 24 × 35 × 104
multiple of 100 are perfect squares which are
greater than 1?
Sol. (i) 72, (ii) 12, (iii) 300

Explanation:

(i) Number of perfect squares factors of N

N= 25 × 34 × 56 × 72
↓ ↓ ↓ ↓
 50 
 20   30   2
 2  2 5   70 
2  3   4  2 
 4
2 
 4 5   7
 

 3   56 
 
 2 Ways
3 Ways 3 Ways
4 Ways

Total perfect square factors = 3 × 3 × 4 × 2 = 72 Ans.

(ii) Number of perfect cube factors of N

N= 25 × 34 × 56 × 72
↓ ↓ ↓ ↓
 50 
 20   30   3
 3   3  5  ( )
70
 
 2
  
3 
    3
2 Ways 2 Ways  5
  1Way

3 Ways
Total perfect cube perfect = 2 × 2 × 3 × 1 = 12 Ans.

(iii) Factors which are multiple of 100

N = 25 × 34 × 56 × 72
∴ 100 = 22 × 52
Number System

N = 22 × 52 (23× 34× 54 × 72)

So, number of factors which are multiple of 100.
= (3 + 1) (4 + 1) (4 + 1) (2 + 1) = 4 × 5 × 5 × 3 = 300 Ans.

21.
 Example 3:

Find the number of solutions of a × b = 1980, where a and b are natural

numbers.

Sol. 36
Previous Year Question
Explanation:
N = 1980 = 198 × 10 = 22 × 32 × 5 × 11 How many pairs (a, b) of positive
integers are there such that a ≤ b
Total number of factors of N
and ab = 42017
= (2 + 1) (2 + 1) (1 + 1) (1 + 1) = 3 × 3 × 2 × 2 = 36
(1) 2019 (2) 2018
Number of ways of writing N as product of its two (3) 2020 (4) 2017
factors
Total no. of factors 36
= = = 18
2 2
\ Variables a and b are mentioned in the question so one need to find ordered
solution, i.e., (a, b) and (b, a) would be counted as 2 different solutions.

Therefore, a × b = 1980 will have = 2 × 18 = 36 solutions.

Example 4:

If all the factors of 5880 are written in ascending order, from left to right,
find the factor which occupies the 43rd from the left end.

Sol. 980

Explanation:
N = 5880 = 23 × 31 × 51 × 72
Number of factors of 5880 = 4 × 2 × 2 × 3 = 48
Let’s write some of factors. 5880 → 1, 2, 3, 4, 5, 6, 7,……….. 5880
Notice here, 1st factor × 48th factor = 1 × 5880 = 5880
Similarly, 2nd factor × 47th factor = 5880
And, so on, hence, it can be concluded that product of factors equidistant
from both ends is equal to number itself. Therefore,
Number System

⇒ 6th factor × 43rd factor = 5880

⇒ 6 × 43rd factor = 5880
5880
⇒ 43rd factor = = 980 Ans.
6
22.
5. HCF AND LCM

Factors are numbers that divides the given number completely and
multiples are the numbers that are divisible by given number.
For example factors of 18 are 1, 2, 3, 6, 9 and 18.
Multiples of 18 are 18, 36, 54, 72………….

HIGHEST COMMON FACTOR (HCF)

It is the largest number that divides the given set of

numbers completely.

Examples : Find HCF of 15, 24 and 36. Key Note

Factors of 15 are → 1, 3, 5, 15.
Factors of 24 are → 1, 2, 3, 6, 8, 12, 24. • HCF of given set of numbers is
always less than or equal to the
Factors of 36 are → 1, 2, 3, 4, 6, 9, 12, 18, 36.
smallest number in the set.
So, the highest common factor of 15, 24 and 36 is 3.
• LCM of given set of numbers is
always greater than or equal to
LEAST COMMON MULTIPLES (LCM) the largest number in the set.
It is the least number that is completely divisible by • HCF is the factor of LCM.
the given set of numbers.

Example : Find LCM of 9, 18 and 24.

Multiples of 9 are → 9, 18, 27, 36, 45, 54, 63, 72, 81………….
Multiples of 18 are → 18, 36, 54, 72, 90………….
Multiples of 24 are → 24, 48, 72, 96………….
So, the least common Multiples of 9, 18 and 24 is 72.

Finding HCF and LCM by factorizatiomn method :

Factorize all the given numbers. To find HCF look for common prime numbers
and take their highest common power. And to find LCM take all prime numbers
used in prime factorization and write their highest powers available.

Example 1:
Number System

Find HCF and LCM of 216, 252, 306

Sol. 25704

23.
 Explanation:

Primefactorise all the numbers.

216 → 23 × 33
252 → 22 × 32 × 7
306 → 2 × 32 × 17

For HCF, it can be observe that prime numbers 2 and 3 are common in all
and highest common power of 2 is 1 and highest common power of 3 is 2.
HCF = 21 × 32 = 18

For LCM, write all the prime numbers used in prime of factorization with
their highest power.
LCM = 23 × 33× 7 × 17 = 25704.

Example 2:

If LCM of first 40 natural numbers is N, then find the LCM of first 46 natural
numbers.

Sol. LCM of (1, 2, 3, 4, 5,…………. 46) = N × 41 × 43

Explanation:

LCM of first 40 natural numbers is N it means N includes all the prime

numbers up to 40 with their highest power.

{1, 2, 3, 4, 5,…………. 40} = N

Now, number from 41 to 46 are added in the list. So, one need to include all
new prime numbers added and also look for any change in highest power
of already used prime numbers in N.
41 → Prime → Add
42 → 2×3×7 → It will not update the N
43 → Prime → Add
44 → 22 × 11 → No update in N again
45 → 32 × 5 → Again no update required
Number System

46 → 2 × 23 → No update

Hence, LCM of (1, 2, 3, 4, 5,…………. 46) = N × 41 × 43

24.
 Example 3:

LCM of (5n × 48, 250, 32 × k) is 26 × 55 × 32 find maximum of (n + k).

Sol. 56255

Explanation:
5n × 48 → 24 × 3 × 5n
250 → 2 × 53
32K → 25 × K
∴ LCM includes all the prime numbers with their highest power, so
maximum exponent of 5 that is possible is 5.
Hence, maximum value of n can be 5 here.
To maximize K, it can be taken as K = 2 × 32 × 55 = 56250
So, number 32K = 26 × 32 × 55 (which is equal to LCM)
Therefore, maximum of (n + k) = 5 + 56250 = 56255 Ans.

Finding HCF by minimum difference method

Find the minimum difference between the pair of numbers and one of the
factors of this difference would be the HCF of given numbers.

Example 4:

Find HCF of 276, 372, 588 and 708.

Sol. 12

Explanation:
Take the minimum difference between any two numbers.
Minimum difference = 372 – 276 = 96
Now, start checking the factors of 96 that will divide given numbers
completely. Use the concepts of divisibility to quickly figure out the value.
Check the factors in decreasing order as one need to find HCF here.
96 → 25 × 3;  Factors → 96, 48, 32, 24, 16, 12
× × × × × √
Number System

So, 12 is highest factor of 96 that divides all the numbers completely.

Hence, 12 is required HCF.

25.
 APPLICATION RULES OF HCF AND LCM
y The largest number that will exactly divide a, b and c is HCF (a, b, c).
y The largest number that will divide a, b and c leaving remainder of x, y and
z respectively is HCF (a – x, b – y, c – z).
y The largest number that divides a, b and cleaving the same remainder in
each case is HCF (a – b, b – c, c – a).
y The smallest number which is exactly divisible by a, b and c is LCM
(a, b, c).
y The smallest number when divided by a, b and c leaves the same reminder
r in each case is [LCM (a, b, c) + r].
y The smallest number when divided by a, b and c leaves the remainder p, q
and r respectively is [LCM (a, b, c) – m], where a – p = b – q = c – r = m.

Example 5:

The least multiple of 8, which leaves a remainder of 4, when divided by 9,

15, 18 and 30 is.

Sol. 184

Explanation:
Least number which is divisible by 9, 15, 18 and 30 is LCM of
(9, 15, 18, 30) = 90.
General form of all such numbers = 90 K
As in question it says that number leaves a remainder of 4 on dividing by 9,
15, 18 and 30. So, required number = 90 K + 4
Now, to figure out least multiple of 8 put values of K = 1, 2, 3,……. and check.
Put K = 1, 90 × 1 + 4 = 94 → Not divisible by 8.
Put K = 2, 90 × 2 + 4 = 184 → Divisible by 8.
Hence, 184 is the desired number.

Example 6:
Number System

On dividing a certain number by 8, 10 and 12, the remainders obtained are 2,

4 and 6 respectively. Find largest 3-digit number satisfying this condition.

Sol. 954

26.
 Explanation:
Notice here, the difference between the divisors and their remainders is
constant.
⇒ 8 – 2 = 10 – 4 = 12 – 6 = 6
General form of the number = LCM (8, 10, 12) K – 6
= 120 K – 6
Largest three-digit number can be obtained at K = 8
⇒ 120 × 8 – 6 = 960 – 6 = 954 Ans.

Example 7:

For some industrial experiment 40 litres of mud water, 72 litres of saline

water, and 88 litres of distilled water was ordered. Lab attendant wants to
pack them in cans, so that each can contains the same litres of water, and
he can’t mix any two in a can. What is the least number of cans required?

Sol. 25

Explanation:
To keep the minimum number of cans one need to maximize the capacity
that each can holds. So, first out the maximum capacity of cans that can
store all 40 L, 72 L and 88 L of water completely. It is basically the HCF of
(40, 72, 88) = 8.

Capacity of each can = 8L

40 72 88
Number of cans required = + +
8 8 8
= 5 + 9 + 11 = 25 Ans.

SOME GENERAL RULES OF HCF AND LCM

y If two numbers are given m and n then m × n = HCF × LCM

y If HCF of m and n is h; assume m = ha and n = hb; where HCF (a, b) = 1.
y HCF of fractions = HCF of numerators/LCM of denominators
Number System

y LCM of fractions = LCM of numerators/HCF of denominators

y HCF of (xp – 1, xq – 1) = xHCF(p, q) – 1

27.
 Example 8:

The product of two numbers is 6480 and their H.C.F. is 9. How many such
pair of numbers are possible?

Sol. 2

Explanation:
Let’s take the numbers as 9a and 9b where a and b are co-prime, i.e., HCF
(a, b) = 1
⇒ 9a × 9b = 6480    ⇒ ab = 80    ⇒ ab = 24 × 51

Number of ways of writing a number as product of its two co-prime factors

= 2p–1 (where, p is number of prime numbers used in prime factorization).
Here, p = 2
Co-prime pairs possible = 22–1 = 21 = 2
a × b = (1, 80) and (5, 16)
Hence, 2 pairs are possible.

Example 9:

The sum of two number is 121 and their HCF is 11. How many such pairs of
numbers are possible?

Sol. 5 pairs

Explanation:
Let’s take the numbers as ha and hb where a and b are co-prime numbers.
⇒ ha + hb = 121 ⇒ h(a + b) = 121
⇒ 11 (a + b) = 121 ⇒ a + b = 11
(a, b) ≡ (1, 10), (2, 9), (3, 8), (4, 7), (5, 6)

So, total 5 pairs of numbers are possible.

Note : One can also use Euler number to find number of co-prime pairs.
Number System

Number of ways of writing N as sum of two co-prime numbers

1
= (Euler number of N)
2

28.
 Example 10:

LCM of 2 natural numbers a and b where a > b is 429. What is the maximum
possible sum of the digits of b?

Sol. 12

Explanation:
429 = 3 × 11 × 13
So, a and b can have only these 3 prime numbers Previous Year Question
with their highest power as 1. So, different
possibilities are: How many pairs (a , b) of positive
integers are there such that a ≤ b
(a, b) → (3 × 11 × 13, 1) = (429, 1)
and ab = 42017
→ (3 × 11 × 13, 3) = (429, 3)
(1) 2019 (2) 2018
→ (3 × 11 × 13, 11) = (429, 11)
(3) 2020 (4) 2017
→ (3 × 11 × 13, 13) = (429, 13)
And, so on………….
But to maximize sum of digits of b

(a, b) → (3 × 11 × 13, 3 × 13) = (429, 39)

Or,
→ (11 × 13, 3 × 13) = (143, 39)

Hence, maximum value of sum of digits of b = 3 + 9 = 12

SURDS
Surds are square roots that cannot be reduced to give a whole number.
They are irrational numbers.

Example of surds: 5, 2 + 2 5, 2 56

y If two surds are equal then their rational and irrational parts are equal.

For example: If a + b =3 + 8 6
To compare we can write it as:
a + b =3 + 8×8×6
Number System

a+ b=3 + 384

Therefore, a = 3 and b = 384

29.
 CONJUGATE OF SURDS
Conjugate are introduced to simplify surds.
(a – ib) is the conjugate of (a + ib) and (a + ib) is the conjugate of (a – ib).

For example: (7 − 5 6) is the conjugate of (7 + 5 6) .

y If a surd is in the denominator, then we have to multiply and divide by the

conjugate. This is also known as Rationalization.

Example 1:

1
Rationalise
5+2 2

Sol.
Explanation:
1
Given term:
5+2 2

Conjugate of (5 + 2 2) is (5 − 2 2) .

Therefore, to simplify, we need to multiply and divide the given expression

by (5 − 2 2) .
1 (5 − 2 2)
Hence, ×
(5 + 2 2) (5 + 2 2)
(5 − 2 2)
   [Since, (a + b) (a –b) = a2 – b2]
(5)2 − (2 2)2
5−2 2 5−2 2
= =
25 − 8 17

Example 2:

5+ 3
If = a + b , where ‘a’ and ‘b’ are rational numbers, then find a + 2b.
5− 3

Sol.
Number System

Explanation:
5+ 3
a+ b =
5− 3

30.
On Rationalization,
(5 + 3) (5 + 3)
a+ b =
(5 − 3) (5 + 3)

(5)2 + ( 3)2 + 2 × 5 × 3
a+ b =
(5)2 − ( 3)2

    [Using (a + b)2 = a2 + b2 + 2ab and (a + b) (a – b) = a2 – b2]

25 + 3 + 10 3
a+ b =
25 − 3

28 + 10 3
a+ b =
22

28 10 3
a+ b = +
22 22

28 300
a+ b = +
22 484
28 300
Now, a = ; b=
22 484
28 2 × 300
Therefore, a + 2b = +
22 484
308 + 300
a + 2b =
242
608 304
a + 2b= =
242 121

COMPARISON OF SURDS
To compare two surds, we can do follow the following approaches:
(1) Subtracting and adding same integer, so that we can compare easily.
(2) By squaring
(3) We can also compare by finding their integral ranges.

Example 3:
Number System

If =
a 7 + 6 and =
b 2 + 11 , then which of ‘a’ and ‘b’ is greater.

31.
 Sol.
Explanation:
We have, =
a 7+ 6

=
b 2 + 11

On squaring: a=
2
13 + 2 42

b=
2
13 + 2 22

On comparing: Clearly 42 > 22

Therefore, a > b

Example 4:

If=
a 4 + 11 and =
b 3 + 13 , then find which of ‘a’ and ‘b’ is greater.

Sol.
Explanation:
We have, =
a 4 + 11 and, =
b 3 + 13

Now, a=
2
15 + 2 44 and, b=
2
16 + 2 39

Also, we can write the above expressions as:

2 44
a2 − 15 = ...(1)

b2 − 15 =1 + 2 39 ...(2)

Squaring equation (1) and (2)

(a2 – 15)2 = 276 ...(3)
(b2 – 15)2 = 1 + 156 + 4 39
= 157 + 4 39

Also, 6 < 39 < 7

So, 39 = 6 . abc

Therefore, (b2 – 15)2 ...(4)

From (3) and (4)
Number System

We can conclude: a < b

32.
SQUARE ROOT OF SURDS
We know that: (a + b)2 = a2 + b2 + 2ab
We should express the surd in the form of (a2 + b2 + 2ab), then compare
(a2 + b2) with the rational part and 2ab with irrational part.

Example 5:

Find the square root of 13 + 6 7 .

Sol.
Explanation:

13 + 6 7 =13 + 2 63

7 + 9 + 2 7 ×=
9 ( 7)2 + (3)2 + 2 × 7 × 3

= (3 + 7)2

Therefore, 13 + 6 7 = (3 + 7)2

Hence, 13 + 6 7 =± (3 + 7)

INDICES
Indices is the method of taking a power or root of a number. The power,
also known as index, tells how many times a number have to multiply by
itself.

For example: 34 means that you have to multiply 3 by itself four times
= 3 × 3 × 3 × 3 = 81.
In ab, ‘a’ is called the base and ‘b’ is called the power, exponent or index.

RULES OF INDICES
1. a° = 1 2. a1 = a 3. 1n = 1
am
4. am × an = am+n 5. = am−n 6. (am)n = am×n
an
n
an  a 
Number System

n
(m )
7. amn = a 8. an × bn = (ab)n 9. = 
bn  b 
m
1
11. a n = a
n m
10. a −n =
an
33.
 Example 6:

2
Simplify 325 × 53 − (22 )3 ÷ 3

Sol.
Explanation:
2 2
26
325 × 53 − (22 )3 ÷ 3 = (25 )5 × 125 −
3
2
5× 64
= 2 5
× 125 −
3
64 64 1436
=4 × 125 − = 500 − =
3 3 3

COMPARING INDICES
(1) B
 y taking HCF of powers and then dividing the powers by the HCF will; help
in comparing indices, in case powers of numbers are integers.

Example 7:

Which of the following numbers has the largest value?

(1) 396 (2) 548
(3) 2524 (4) 272

Sol.
Explanation:
HCF (92, 72, 48, 24) = 24
96
Now, ( 3 ) 24
= 3=
4
81
48
( 5) 24= 5=
2
25
24
( 25)=
24 =
251
25
Number System

72
( 2) 24= 2=
3
8

Hence, (3)96 is the largest.

34.
(2) If powers are fraction, then indices can be compared by multiplying each of
the power by the LCM of denominators of fraction.

Example 8:

Which of the following is smallest value ?

1 1
(1) 38         (2) 4 12    
1 1
(3) 5 16        (4) 924

Sol.
Explanation:
LCM (8, 12, 16, 24) = 48
1
×48
Now, (3)8 = 3=
6
729
1
×48
(4) 12 = 4=
4
256
1
×48
(5) 16 = 5=
3
125
1
×48
(9)24 = 9=
2
81
1

Hence, (9)24 is the smallest value.

Example 9:

If 7x+1 = 49y and 8x = 128y × 16, then find the value of 2x+y.

Sol.
Explanation:
In each of the above equations, the bases are powers of the same number.
Therefore, 7x+1 = 49y
⇒ 7x+1 = 72y
⇒ x + 1 = 2y
Number System

⇒ x = 2y – 1 ...(1)

35.
 Also, 8x = 128y × 16
23x = 27y × 24 Previous Year Question
⇒ 2 =2
3x 7y+4

5x – 3y = 13438 and 5x – 1 + 3y + 1
⇒ 3x = 7y + 4
= 9686, then x + y equals.
Putting value of x from equation (1)
3(2y – 1) = 7y + 4
6y – 1 = 7y + 4
y = –5
Therefore, x = 2y – 1
x = 2x(–5) – 1
x = –11

Now, 2x+y = 2(–5) + (–11)

−16 1 1
2= =
16
2 65536

6. UNIT DIGIT

To find the unit digit, one need not to consider the complete number.
Operation can be performed at unit digit only to get the results.

Unit places can be directly added, subtracted or multiplied but can’t be

divided.

For Example :
Find unit digit of (5266 × 7869 – 24372)

Explanation:
Previous Year Question
6×9–2=4–2=2
If m and n are integers such that
( 2)
19
× 34 × 42 × 9m × 8n
=3n × 16m × ( 4
64 )
then m is
Number System

(1) –16 (2) –20

(3) –24 (4) –12

36.
CYCLICITY

Unit digit of all the digits from 0 to 9 when raised to some power repeats
itself in a certain cycle.
Based on cyclicity all ten digits {0, 1, 2, 3,..…..… 9} can be divided in to three
categories :

0 2
1 3
5 4 7
6 9 8

Cyclicity = 1 Cyclicity = 2 Cyclicity = 4

Digits with cyclicity 1 :

Any number ending with 0 or 1 or 5 or 6 raised to any power (except 0) will

always end in 0 or 1 or 5 or 6 respectively. That is why these digits have
cyclicity as 1.

51 = 5 61 = 6
52 = 25 62 = 36
53 = 125 63 = 216
54 = 625 64 = 1296

          

Example 1:

(i) (375)37 × (436)289 + (3741)2895

37
(ii) 3536 + 76214!

Sol. (i) 1, (ii) 1

Explanation:
(i) (375)37 × (436)289 + (3741)2895
Number System

As unit digits are 5, 6 and 1 which has cyclicity = 1 and hence these
digits repeat itself irrespective of their powers.

37.
 (375)37 → Unit digit = 5
(436)289 → Unit digit = 6
(3741)2895 → Unit digit = 1
⇒ 5×6+1
⇒ 0 + 1 = 1 Ans.

37
(ii) 3536 + 76214!
37
Unit digit of 3536 = 5
Unit digit of 76214! = 6
⇒ 5+6
⇒ 1 Ans.

Digits with cyclicity 2 :

Unit digits of numbers ending with 4 or 9 repeats itself after every 2nd power
or it can be also said that numbers ending with 4 or 9 raised to any power
(except 0) will have only 2 different answers of unit digit.

Therefore, the cyclicity of 4 and 9 is two

41 = 4 91 = 9
42 = 16 92 = 81
43 = 64 93 = 729
44 = 256 93 = 729
45 = 1024 94 = 6561

          

It can be observed that, unit digit of Previous Year Question

(− − − − − − 4)Odd = 4
Let m and n be natural numbers
(− − − − − − 4)Even =6 such that n is even and 0.2 < m/20,
n/m, n/11 < 0.5 then m – 2n equals
Number System

(− − − − − − 9)Odd =9
(1) 4 (2) 2
(− − − − − − 9)Even = 1
(3) 1 (4) 3

38.
 Example 2:

Find unit digits of (324)397 + (689)322 – (79)731

Sol. 6

Explanation:
(324)397 → Odd
4Odd → 4
⇒ (689)322 → Even
9Even → 1
⇒ (79)731 → Odd
9Odd → 9

Hence, 4 + 1 – 9 = 5 – 9
= –4 {∴ Unit digit can’t be negative so take 10 carry and odd}
= –4 + 10 = 6

Example 3:

..................∞ 32 .................∞
 151617 3031 
Find unit digits of  14 × 29 
 
Sol. 4

Explanation:
17.............∞ ...........∞
15 16 17
( 14) ⇒ Figure out whether 1516 would be even or odd.

15 → Odd number and (Odd)Any power ⇒ Odd number

17 ...........∞
Hence, 1516 ⇒ Odd number

Unit digit of (14)odd = 4Odd ⇒ 4

32...............∞
3031
Similarly, ( 29)
Number System

30 → Even number and (even)Any power ⇒ Even number

........∞
3132
Hence, 30 ⇒ Even number
Unit digit of (29)even ≡ 9Even ⇒ 1. Finally 4 × 1 = 4 Ans.

39.
 Digits with cyclicity 4 :

Unit digits of numbers ending with 2 or 3 or 7 or 8 repeats itself after every

4th power or it can be also said that numbers ending with 2 or 3 or 7 or 8
raised to any power (except 0) will have 4 different answers of unit digit.
Therefore, the cyclicity of 2, 3, 7 or 8 is four

21 = 2  31 = 3  71 = 7  81 = 8 
   
22 = 4  32 =9  72 = 49  82 = 64 
   
23 = 8  33 = 27  73 = 343  83 = 512 
   
24 = 16  34 = 81  74 = 2401  84 = 4096 
25 = 32 35 = 243 75 = 16807  85 = 32768

                      

It can be observed that each of 2, 3, 7 and 8 repeats after 4th power.

Method to find unit digit of numbers having cyclicity 4 :

y Divide the power (index) by 4 and find remainder.

y If remainder is 1, 2 or 3 raise the unit digit of number to the power 1, 2
and 3 respectively.
y If remainder is 0 raise the unit digit of number to the power 4.

For Example :
Find unit digit of 23746
 746 
Remainder  =2
 4 
Unit digit = 32 = 9 Ans.

Note : Remainder can be obtained by dividing last 2 digit of the number in

case of divisibility by 4.

Example 4:
Number System

Find out digit of 34256 × 76738

Sol. 4

40.
Explanation:

 56 
Rem   = 0
4
Unit digit of 34256 = 24 = 6
 38 
Rem   = 2
 4
Unit digit of 76738 = 72 = 9
Hence, 6 × 9 = 4 Ans.

Example 5:

55
Find unit digit of 5354

Sol. 1

Explanation:
Because cyclicity of 3 is 4, divide the index, i.e., 5455 by 4 and check remainder
5455 = 54 × 54 × 5453 = (2 × 27) (2 × 27) × 5453
= 4 × (27 × 27 × 5453) = 4 N type
 5455 
Hence, Rem   =0
 4 
55
Unit digit of 5354 = 34 = 1 Ans.

Example 6:

If unit digit of 48a is 2 then which of the following can be value of a?

(1) 20 (2) 21 (3) 22 (4) 23

Sol. (4); 23

Explanation:
Cyclicity of 8 is 4
81 = 8 or 84k + 1
82 = 64 or 84k + 2
Number System

83 = 512 or 84k + 3
‘a’ should leave remainder as 3 when divided by 4, i.e., it should e 4K + 3 type.
Hence, option (4) is correct answer.
41.
 Example 7:

Unit digit of (5!)5! + (4!)4! + (3!)3! + (2!)2! + (1!)1!

Sol. 7

Explanation:
It can be noticed that any factorial greater than 4 will have at least one zero
at the end.

(5!)5! = (120)120 → Unit digit = 0

(4!)4! = (24)24 = 424 → Even ⇒ Unit digit = 6
(3!)3! = 66 ⇒ 6Any power ⇒ Unit digit = 6
(2!)2! ⇒ 22 ⇒ Unit digit = 4
(1!)1! ⇒ 11 ⇒ Unit digit = 1

Adding all unit digits = 0 + 6 + 6 + 4 + 1 = 7 Ans.

Example 8:

If n is a natural number, then how many distinct values of unit digit of

(2n + 4n + 6n + 8n) can assume?

Sol. 2

Explanation:
It is seen that cyclicity of all the digit is either 1 or 2 or 4. But, for simplicity
one can also take cyclicity of all the digits as 4. It would not affect unit
digit’s results.

So, here n can be of four types :

4k type → {4, 8, 12, 16,………….}
(4k + 1) type → {1, 5, 9, 13,………….}
Previous Year Question

(4k + 2) type → {2, 6, 10, 14,………….} How many of the integers 1, 2,…,
(4k + 3) type → {3, 7, 11, 15,………….} 120, are divisible by none of 2, 5
and 7?
When, n = 4k, put n = 4
Number System

(1) 41 (2) 42
= 24 + 44 + 64 + 84
(3) 40 (4) 43
=6+6+6+6=4

42.
 When, n = 4k + 1, put n = 1
= 21 + 41 + 61 + 81
=2+4+6+8=0 Rack your Brain
When, n = 4k + 2, put n = 2
If a and x are distinct natural
= 22 + 42 + 62 + 82 numbers less than 10 and xa has
=4+6+6+4=0 unit digit 1. Find maximum of (x + a).

When, n = 4k + 3, put n = 3
= 23 + 43 + 63 + 83
=8+4+6+2=0

So, it can be witnessed that for any value of n unit digit of 2n + 4n + 6n + 8n

is having only two distinct values, i.e., 0 and 4.

Hence, answer = 2.

7 LAST TWO DIGIT

In this section generally last two digits of a number raised to some power
is asked.

When the unit digit of base is 1 :

(61)43 = (1 + 60)43
(x + a)n = nC0 xn a0 + nc1 xn–1 a1 +………….nCn x0 an
(1 + 60)43 = C0 × 143 × 600 +
43
C1 × 142 × 601 +
43
C2 × 141 × 602 +………….
43

In the expansion after 2nd term, all the terms will have at least 2 zeros at
the end. So, it will not affect the last 2 digit calculation and these terms
can be neglected.

(1 + 60)43 = 1 × 1 × 1 + 43 × 1 × 60
= 1 + 2580 = 2581

Last two digit is 81.

With proper observation it can be concluded

Number System

(– – – b 1) XYZ
⇒ Unit digit = 1
Tenth digit = b × z

43.
 Example 1:

Find last 2 digits of (531)437

Sol. 11

Explanation:
(531)437 ≡ (31)437
     ↑   ↑
= 11 Ans.

Important observation :

Last two digits of square of any number of (50N ± K) type is same as the
square of K.

Last two digits of (50N ± K)2 =

Last two digits of K2

For Example :
782 = (50 × 2 – 22)2 = 6084
222 = 484
1692 = (50 × 3 + 19)2 = 28561
192 = 361

When unit digit of base is 3, 7 or 9 :

34 = 81,   74 = 2401,   92 = 81
To find out the last two digits of numbers ending with 3, 7 or 9 convert the
base to get “1” at unit place and then apply the method of finding last two
digit of base ending with “1”

Example 2:

(i) 3275 (ii) 217438 (iii) 5954

Sol. (i) 07; (ii) 09; (iii) 61

Explanation:
Number System

(i) 3275 = (34)68 × 33 = (81)68 × 27

= 41 × 27 = 07 Ans.

44.
(ii) 217438 = 17438 = (174) × 172
= (172 × 172)109 × 89
= (89 × 89)109 × 89
= (892)109× 89
= (21)109 × 89 {∴ Last 2 digits of 892 = 112 = 21}
= 81 × 89 = 09 Ans.

(iii) 5954 = (592)27 {∴ Last 2 digits of 592 = 92 = 81}

= (92)27 = (81)27 = 61 Ans.

When the unit digit of bsae is 5 :

Let’s suppose the base ending in 5 has its tenth digit as b and exponent is N.
( b 5)N

When both b and N are odd the last two digit would be 75, otherwise it
would be 25.

Example 3:

Find last two digits of :

(i) 435289
(ii) 5835242 + 395871

Sol. (i) 75; (ii) 00

Explanation:
(i) 435289 = 435289 → odd
      ↑
Previous Year Question
Last 2 digit would be 75
If m and n are integers such that
(ii) 5535242 → Even + 395871 → odd
( 2)
19
↑ ↑ × 34 × 42 × 9m × 8n
Odd Odd
⇓ ⇓
=3n × 16m × ( 4
64 )
Last two digit Last two digit then m is
Number System

25 75 (1) 16 (2) 20
(3) 24 (4) 12
= 25 + 75 = 00 Ans.

45.
 When the unit digit of base is even :

It is the specialty of number 24 that

(24)Odd ⇒ Last 2 digits are 24
(24)Even ⇒ Last 2 digits are 76

The above results can be re-written as

(210)Odd ⇒ Last 2 digits are 24

(210)Even ⇒ Last 2 digits are 76

Example 4:

Find last two digits of :

(i) 834
(ii) 6243
(iii) 5736218

Sol. (i) 04; (ii) 28; (iii) 56

Explanation:

(i) 834 = (23)34 = 2102

= (210)10 × 22
= 76 × 04 = 04 Ans.

(ii) 6243 = (2 × 31)43 = 243 × 3143

= (210)4 × 23 × 3143
= 76 × 08 × 91 = 28 Ans.

(iii) 5736218 = 36218 = (22 × 32) 218

≡ 36218 = (22 × 32)218
= 2436 × 3436
= (210)43 × 26 × (34)109
Number System

= 24 × 64 × (81)109
= 24 × 64 × 21 = 56 Ans.

46.
8. REMAINDER

In a mathematical operation remainders can be added, subtracted and

multiplied for simplification purpose.

 A +B  A  B
 =    +  
 P r  r  P r
P

 A ×B  A  B
 =    × 
 P r  P r  P r

 A −B A B

  =   – 
 P r  r  P r
P

Example 1:

Find remainder when (239 × 457 – 218) is divided by 5.

Sol. 0

Explanation:

 239 × 457 – 218 

 
 5 r

 239   457   218 

=
  4,=
 =
 2,   3
 5 r  5 r  5 r

So, remainder = 4 × 2 – 3 = 5

When any number is divided by 5, the possible values of remainder can be

0, 1, 2, 3 and 4. If remainder obtained is greater than 4 then further divide
the remainder till one gets a suitable value of remainder.
5
Remainder   = 0
5
Hence, final answer is 0.

NEGATIVE REMAINDER
Number System

Concept of negative remainder is only introduced to reduce the complexity

of finding remainders. But, negative is never accepted as the final answer.

47.
 So, if in any problem one gets the negative remainder at the end of solution;
add it to the divisor and it will give positive remainder, which would be the
final acceptable answer.

 32  → + 4 (Positive remainder)
Rem  
 7  → – 3 (Negative remainder)

Negative remainder + divisor = Positive remainder

–3 + 7 = 14

 60  → + 6
Rem  
 9  → –3

Note : While solving the remainder problem one can select any of positive
or negative remainder but it is always advised to select the smaller
out of positive and negative remainder to simplify the calculation.

Example 2:

Find Remainder when (252 × 398 × 496) is divided by 25.

Sol. 16

Explanation:
+2 −2 −4
252 × 398 × 496
= (2) × (–2) × (–4) = 16 Ans.
25

CANCELLATION FACTOR

Sometimes it is easy to simplify the given question by cancelling out the

common factors from numerator and denominator and then perform
the division. But, the remainder obtained should be multiplied by the
cancellation factor to get the remainder of original question.

Example 3:
Number System

Find remainder when 308 is divided by 12.

Sol. 8

48.
Explanation:
308 = 4 × 77
12 = 4 × 3
308 4 × 77 77
= =
12 4×3 3
 77 
Rem   = 2
3
 308 
Hence, Rem  = 4 × 2 = 8 Ans.
 12 

SIMPLE REMAINDER PROBLEMS

 (a ± 1)m 
 = (±1)
m

 a r
 (na ± 1)m 
 = (±1)
m

 a r
 (na ± K)m 
 = (± K)
m

 a r
In this type of questions one’s motive should be to make dividend in such
form that leaves remainder as +1 or –1. Sometimes it would not be possible
to get such form of dividend in that case proceed with +K or –K as remainder.

Example 4:

Find remainder of the following :

12637 330 3219
(i) (ii) (iii)
5 16 24

Sol. (i) 1; (ii) 9; (iii) 8

Explanation:
12637
(i)
5
 126 
Rem   = +1
Number System

 5 
 12637 
Rem   =(+1)37 =1 Ans.
 5 

49.
 330 (34 )7 × 32 817 × 9
(ii)
= =
16 16 16
 817 
Rem  =  1= 1
7

 16 
9
Rem   = 9
 16 
Hence, Rem = 1 × 9 = 9 Ans.

3219 (25 )19 295

(iii) = =
24 23 × 3 23 × 3
292
Cancelling out by 23 = 8 =
3
 292 
Rem   =(−1)92 =1
 3 
 3219 
Hence, Rem   = 1 × 8 = 8 Ans.
 24 

EULER THEOREM

If and b are the co-prime numbers and φ(b) is the Euler totient function of
 a φ(b) 
b then Rem  =1
 b 

For purpose of solving problems Euler theorem can be also generalized as

 m 
 am   a  φ(b) Rem
Rem   =  
 b   b Rem

EULER TOTIENT FUNCTION

Euler totient function of any number ‘N’ represents the number of numbers
before N that are co-prime to N.

For Example :
Let’s calculate φ  (12)
Write all the numbers before 12 that are co-prime to it = 1, 5, 7, 11.
Number System

So, there are total 4 numbers.

φ  (12) = 4

50.
Method to calculate euler totient function :

Primefactorize the number N

N = pa × qb × rc × …………..

 1  1  1
φ(N) = N ×  1 −   1 −   1 −  .................
 a  b  c

Example 5:

φ  (40)

Sol. 16
Key Note
Explanation:
40 = 8 × 5 = 23 × 5 If P is prime number, φ (P) =P − 1
 1  1 1 4
φ  (40) = 40  1 −   1 −  = 40 × × = 16 Ans.
 2  5 2 5

Example 6:

Find remainder when 28109 is divided by 37.

Sol. 28

Explanation:
Applying Euler theorem, φ  (37) = 37 – 1 = 36
 109 
 28109   28  36 Rem
Rem  =    = 28 =1
28 Ans.
 37   37 Rem

Example 7:

Find remainder when 13194 is divided by 48.

Sol. 25
Number System

Explanation:
Apply Euler theorem, 48 = 24 × 3

51.
  1  1 1 2
φ  (48) = 48 ×  1 −   1 −  = 48 × × = 16
 2  3 2 3
 194  Previous Year Question
 13194   13  16 Rem
Rem  =    = 13
=2
169
 48   48 Rem How many of the integers 1, 2, …,
120, are divisible by none of 2, 5
 169  and 7?
Further divide 169 by 48 =   = 25 Ans.
 48 Rem
(1) 41 (2) 42
(3) 40 (4) 43
FERMAT’S THEOREM

If P is a prime number and a and P are coprime.

 aP   aP −1 
=
Rem   a= or Rem   1
P  P 

It can be noticed that Fermat is a special case of Euler theorem only.

Example 8:

Find remainder when 625 divided by 13.

Sol. 6

Explanation:
13 is a prime number and 6 and 13 are co-prime to each other. Hence, apply
Fermat Theorem.
 612 
Rem   = 1
 13 

 625   612 × 612 × 6 

Rem   = Rem   = 1 × 1 × 6 = 6 Ans.
 13   13 

WILSON THEOREM

If P is a prime number.

 (P − 2) ! 
Rem  =1 or P – 1
 P 
Number System

 (P − 2) ! 
and Rem  =1
 P 

52.
 Example 9:

Find remainder when 27! is divided by 29.

Sol. 1

Explanation:
 27 ! 
Rem  =1
 29 

Example 10:

Find remainder when 25! is divided by 232.

Sol. 483

Explanation:
 25 !  25 × 24 × 23 × 22 !
Rem  2  =
 23  232

Cancelling out by 23

 25 × 24 × 22 ! 
Rem 
23  = 2 × 1 × (−1) = −2
 
Or,

= –2 + 23 = 21   (Multiply by cancellation factor)

= 483 Ans.

CHINESE REMAINDER THEOREM (CRT)

CRT is applied in problems where divisor is a composite number that can

be split into two co-prime numbers.

Let’s understand the application of CRT by an example.

Example 11:
Number System

Find remainder when 724 is divided by 88.

53.
 Sol. 25

Explanation: Rack your Brain

7 
24
Rem   Any prime number when divided
 88 
by 24 leaves a remainder r. How
⇒ 88 = 8 × 11 (Split into two co-prime numbers) many values r can hold?
 724 
⇒ Rem  =(−1)24 =1
 8 
 24 
 724   
 7  10 R (Using Euler theorem)
⇒ Rem   =  
 11   11 R
74 72 × 72 49 × 49 5 × 5 25
= = = = = = 3
11 11 11 11 11
It can be clearly observed that 724 is either of the form of 8x + 1 or 11y + 3.

According to CRT the final remainder would be smallest number satisfying.

8x = 1 = 11y + 3 …(i)
8x = 11y + 2 (x and y are non-negative integers)
At y = 0, x→ Not integer
At y = 1, x → Not integer
At y = 2, x = 3
Smallest solution of equation (i) is obtained at x = 3 and y = 2
Hence, the remainder = 8 × 3 + 1 = 25 Ans.
  
Or,
11 × 2 + 3 = 25

Example 12:

Find remainder when 2140 is divided by 95.

Sol. 16

Explanation:
Number System

95 → 5 × 19 (Co-prime pairs)
 2140 
Rem  = ?
 95 

54.
  2140 
⇒ Rem  =  1= 1
40

 5 
 2140 
⇒ Rem  =  1= 1 (Apply Euler theorem)
40

 5 
Previous Year Question
24 16
= = = 16
19 19 What is the remainder when 7700
is divided by 100?
Applying CRT, 5x + 1 = 19y + 16
(1) 1 (2) 61
5x = 19y + 15
(3) 41 (4) 21
At, y = 0, x = 3
Hence, remainder is 5 × 3 + 1 = 16
 
Or,
   19 × 0 + 16 = 16

9. FACTORIALS

Factorials are defined as :

N! = N × (N – 1) × (N – 2) × …………. 3 × 2 × 1
For example, 6! = 6 × 5 × 4 × 3 × 2 × 1

Note : 0! = 1

FINDING HIGHEST POWER OF A PRIME IN ANY FACTORIAL

Let’s understand it by an example.

E.g. : Find highest power of 3 in 12!
12! = 1 × 2 × 3 × 4 × 5 × 6 × 7 × 8 × 9 × 10 × 11 × 12

To find highest power of 3 take all multiples of 3 in 12! and neglect rest of
the number.
12! = 3 × 6 × 9 × 12 × K
= 3 × (3 × 2) × (3 × 3) × (3 × 4) × K
= 35 × K1
Hence, highest power of 3 in 12! is 5.
Number System

Question can be also asked to find the highest power of 3 that divides 12!
completely. Both the questions have same answer.

55.
 Alternate Method :
To find highest power of prime P in any factorial N, divide N by P successively
till the quotient obtained is less than P. And, add all the questions of division.
E.g. : Highest power of 3 in 25!
 25 
  =8
 3 Qutient

8
  =2
 3 Qutient

⇒ 8 + 2 = 10
Hence, highest power of 3 is 10 in 25!

Note : This method is applicable only for prime numbers.

FINDING HIGHEST POWER OF COMPOSITE NUMBERS IN ANY FACTORIAL

To find out the highest power of composite numbers in a given factorial,

first factorize the composite number and find the highest powers of prime
numbers available in factorization. Accordingly, one can get composite
number power as well.

Example 1:

What highest power of 15 divides 50! completely?

Sol. 12

Explanation:
15 = 3 × 5

Power of 3 in 50!
50 16 5
= 16,= 5, = 1
3 3 3
= 16 + 5 + 1 = 22
Previous Year Question
Power of 5 in 50!
How many factors of 24 × 35 × 104
Number System

50 10
= 10, = 2 are perfect squares which are
5 5
greater than 1?
= 10 + 2 = 12

56.
So, 50! = 322 × 512 × K
= (3 × 5)12 × 310 × K
= 1512 × K1

Therefore, highest power of 15 that will divide 5! completely is 12.

IMPORTANT OBSERVATION

It can be observed from above example that highest power of larger prime
numbers would be always less than the smaller prime numbers. As in above
example.
Highest power of 5 < Highest power of 3.

Example 2:

150!
For what maximum value of N, is an integer?
63N
Sol. 24

Explanation:
63 = 32 × 7
Highest power of 3 in 150!
150 50 16 5
= 50,= 16,= 5,
= 1
3 3 3 3
= 50 + 16 + 5 + 1 = 72

Highest power of 7 in 150!

150 21
= 21,
= 3
7 7
= 21 + 3 = 24

150! = 372 × 724 × K

= 348 × 724× 324 × K
= (32 × 7)24 × 324 × K
150! = 6324 × K1
Number System

So, maximum power of 63 that can be drawn from 150! is 24.

Therefore, Nmax = 24 Ans.

57.
 Example 3:

For how many value of N, N! is completely divisible by 57 but not by 75?

Sol. 4 values

Explanation:
For N! to be multiple of 57 it should be definitely less than the 7th of 5, i.e., 35
(One need to have smart guess to approach such problems)

And, any factorial from 30 to 34 will have same number of 5’s. So, let’s
check for 30!
30 6
= 6,
= 1
5 5

So, 30! is multiple of 57 and hence any factorial greater than 29 would be
multiple of 57.

Similarly, one can check (by smart guess) the least factorial that have 75 is 35!
35
=5
7

So, any factorial greater than 34 would be the multiple of 75.

ATQ, N! should be multiple of 57 but not 75 .
Hence, N can be 30, 31, 32 and 34.
Therefore, 4 values N can hold.

FINDING NUMBER OF TRAILING ZEROS IN A FACTORIAL

As N! is the product of all the numbers starting from N to 1 and in any

multiplication zero can be only obtained when a pair of 5 and 2 is available.
Number of pairs of 5 and 2 available in any factorial will decide the number
of trailing zeros.

∴ Factorial is a regular series of number, it can be

witnessed that in any factorial

Number of 2’s > number of 5’s

Number System

Or it can be also said

Power of 2 > Power of 5

58.
But, in order to produce zero, pair of 2 and 5 is required hence power of 5
would be the deciding factor, i.e., number of 5’s available in factorial will
give the number of trailing zeros in that factorial.

Example 4:

Determine number of trailing zeros in 67!

Sol. 15 trailing

Explanation:

Just calculate the highest power of 5 available in 67!

67 13
= 13,
= 2
5 5
= 13 + 2 = 15

∴ 515 is available in 67!. There are 15 trailing zeros in 67!

Example 5:

Find trailing zeros in 89! + 88!

Sol. 21

Explanation:
89! + 88! = 89 × 88! + 88!
= 88! (89 + 1)
= 88! × 90
88 17
Trailing zeros in 88! is
= 17,= 3
5 5
= 17 + 3 = 20

So, trailing zeros in 89! × 90 Rack your Brain

↓ ↓
20 zeros 1 zero If n! has 21 trailing zeros. Find
Number System

maximum number of trailing zeros

= 20 + 1 = 21 Ans. (2n)! can have?

59.
 SKIPPING ZEROS CONCEPT IN FACTORIALS

Let’s observe the behavior of factorial from the trailing zero’s point of view :

Factorials Number of trailing zeros

1! — 4! → 0
5! — 9! → 1
10! — 14! → 2
15! — 19! → 3
20! — 24! → 4
Skipping
25! — 29! → 6

It is clear that every multiple of 5’ will contribute to 1 zero, similarly multiple

of 52 will contribute to 2 zeros and so on.
E.g. : 24! → 4 trailing zeros = 54K
25! = 25 × 24!
= 52 × 24!
= 52 × 54K
= 56K ⇒ 6 trailing zeros

Hence, one can not get 5 trailing zeros in any factorial.

This is the skipping zero concept.

Again, 45! – 49! → 10 trailing zeros = 510K

 45 9 
∴ = 9, = 1
 5 5 
50! = 50 × 49! Previous Year Question
= 2 × 5 × 49!
2

n a six-digit number, the sixth,

= 2 × 52 × 510K = 512K1
that is, the rightmost, digit is the
50! → 12 trailing zeros sum of the first three digits, the
50! → 54! → 12 trailing zeros. fifth digit is the sum of first two
So, there is no factorial which has 11 trailing zeros. digits, the third digit is equal to
the first digit, the second digit is
y Let’s generalize this concept : twice the first digit and the fourth
digit is the sum of fifth and sixth
Number System

If N! → P Trailing zeros
digits. Then, the largest possible
then, 5 × N! → (P + Q) Trailing zeros
Q
value of the fourth digit is

60.
 Example 6:

If m and n are two consecutive natural numbers such that difference between
number of trailing zeros of n! and m! is 3. Find minimum value of (m + n).

Sol. 249

Explanation:
m! → P trailing zeros Key Note
n! → P + 3 trailing zeros
It is possible when m! is multiplied by 53K where • Numbers which are equal to the
K is not the multiple of 5. sum of factorials of their digits
are 1, 2, 145 and 40585.
So, n! = 53 K × m!
• 
Numbers for which N! has N
n! = 125K × m!
digits are 1, 22, 23 and 24.
To have minimum value of m + n, take K = 1
n! = 125 × m!
Because, m and n are consecutive numbers n = m + 1
⇒ (m + 1)! = 125 × m!  
⇒ (m + 1) m! = 125 × m!
⇒ m + 1 = 125
m = 124
n = 125

Minimum of (m + n) = 249 Ans.

FINDING RIGHT MOST NON-ZERO DIGIT IN A FACTORIAL

In any factorial some 2’s and 5’s will produce zero, separate the pair of
2’s and 5’s that will produce trailing zeros and then find the unit digit of
multiplication of rest of the prime numbers. This would be the right most
non-zero digit of the factorial.

For Example :
6! = 6 × 5 × 4 × 3 × 2 × 1
= (2 × 3) × 5 × (2 × 2) × 3 × 2
= (2 ×5) × (3 × 2
×
2 × 3 ×
2)
Number System

 
⇓ ⇓
(This will produce    (Unit digit of this would be
  Trailing zeros)    right most non-zero digit)

61.
 6! ⇒ Unit digit of (3 × 2 × 2 × 3 × 2)
⇒ 2 = Right most non-zero digit of 6!

Let’s try with some bigger number.

15! = 1 × 2 × 3 × 4 × 5 × 6 × 7 × 8 × 9 × 10 × 11 × 12 × 13 × 14 × 15
= 211× 36 × 53 × 72 × 11 × 13
= (28
× 36 
 × 
72 × 11 × 13)
 × (2

3
× 5
3
)
⇓ ⇓
Unit digit of this would be Trailing zeros Previous Year Question
right most non-zero digit
A sequence of 4 digits, when
Unit digit of (28 × 36 × 72 × 11 × 13)
considered as a number in base
= (256 × 729 × 49 × 11 × 13) 10 is four times the number it
= (6 × 9 × 9 × 1 × 3) = 8 represents in base 6. What is the
Hence, right most non-zero digit of 15! is 8. sum of the digits of the sequence?
(1) 6 (2) 8
Alternate Method :
(3) 4 (4) 9
To find right most non-zero digit of N!
N = 5a + b
⇒ Right most non-zero digit of (2a × a! × b!)

Example 7:

Find right most non-zero digit in 28!

Sol. 4

Explanation:
28 = 5 × 5 + 3
Right most non-zero digit in 28!
= Right most non-zero digit of (25 × 5! × 3!)
= (32 × 120 × 6) = (2 × 2 × 6) = 4 Ans.

y For any large value of N, to reduce the steps of calculation one can also use
the following method.
Number System

N = 25a + b
Right most non-zero digit of N! = Right most non-zero digit of (4a × a! × b!).

62.
 Example 8:

Find right most non-zero digit in 81!

Rack your Brain
Sol. 8

Explanation: If k is the smallest composite

81 = 25 × 3 + 6 number that does not divide 40!
= Right most non-zero digit of (43 × 3! × 6!) Then find the right most non-zero
digit in k!
= (4 × 6 × 2) = 8 Ans.

10. BASE SYSTEM

In mathematics there are different ways of representing the number
depending upon the number of digits used. And number of digits used
denotes the base of the system. Like in decimal system (which is very
common) digits from 0 to 9, i.e., total 10 digits are used.
Base can take any value from 2 onwards but in general practice it is used
up to base 16, i.e., hexadecimal system.

NUMBER OF DIGITS USED IN ANY BASE m RANGE FROM 0 to m – 1 :

For Example :
Base Digits used
Base 10 → 0 to 9
(Decimal system)
Base 8 → 0 to 7
(Octal system)
Base 7 → 0 to 6
(Septenary system)
Base 2 → 0 and 1
(Binary system)
Base 16 → 0 to 9, A, B, C, D, E, F
(Hexadecimal System)
Number System

Just to avoid confusion numbers from 10 to 15 are represented by alphabets

as 10 → A, 11 → B, 12 → C, 13 → D, 14 → E, 15 → F
Hence, digits used in base 16 are, 1, 2, 3, 4, 5, 6, 7, 8, 9, A, B, C, D, E, F

63.
 y One should be familiar with counting numbers that are used in a particular
system. For example, counting numbers used in base 6 would be
1, 2, 3, 4, 5, 10, 11, 12, 13, 14, 15, 20, 21,………….
Because in base 6 digits that can be used are 0, 1, 2, 3, 4 and 5.

CONVERSION FROM DECIMAL SYSTEM (BASE 10) TO BASE m :

To convert any number from base 10 to base m, successively divide the
number by m and note down the remainders.
Let’s understand by example:
Convert (358)10 to base 6
(358)10 → (   ),

(358)10 ↔ (1354)6

Example 1:

Convert (34572)10 to base 16.

Previous Year Question

While multiplying three real

numbers, Ashok took one of the
numbers as 73 instead of 37. As
a result, the product went up by
720. Then the minimum possible
Number System

Sol. 8
value of the sum of squares of the
Explanation: other two numbers is
(34572) to ↔ (870 C)16

64.
CONVERSION FROM BASE m to DECIMAL SYSTEM (BASE 10) :
(abcd)m → (   )10

= a × m3 + b × m2 + C × m1 + d × m0

(abcd)m → (am3 + bm2 +cm + d)10

Example 2:

Convert (2135)7 to decimal system.

Sol. 8

Explanation:
(2135)7 = 2 × 73 + 1 72 + 3 × 7 + 5 × 7°
= 686 + 49 + 21 + 5 = 761
(2135)7 ↔ (761)10 Ans.

Example 3:

Find value of base m in (426)8 = (338)m

Sol. 9

Explanation:
Convert both the bases to decimal system and equate
⇒ 4 × 82 + 2 × 81 + 6 × 8° = 3 × m2 + 3 × m1 + 8 × m°
⇒ 256 + 16 + 6 = 3m2 + 3m + 8
⇒ 3m2 + 3m + 8 = 278
⇒ m2 + m – 90 = 0
⇒ (m – 9) (m + 10) = 0
m = 9, –10
Hence, m = 9 Ans.

ADDITION SUBTRACTION AND MULTIPLICATION IN BASE SYSTEM :

Number System

The logic of addition, subtraction and multiplication in any base is same as

of decimal system.

65.
 Addition in base 10:

Let us understand the logic of addition.

2 5 7
+ 4 8 6
7 4 3

LOGIC
Add the digits, if it is greater than the highest digit used in that base, divide
it by base, keep the remainder and send the quotient as carry. Continue
same process till end.

Example 4:

(354)6 + (432)6

Sol. 0

Explanation:

1 1
3 5 4
+ 4 4 2
8 9 6
6×1+ 2 6×1+ 3 6×1+ 0
Number System

12 3 0
Logic used in addition can be extended for subtraction and multiplication
as well.

66.
 Example 5:

Calculate (656)8 – (357)8

Sol. 277

Explanation:
Previous Year Question

The number of integers x such

that 0.25 ≤ 2x ≤ 200, and 2x + 2
is perfectly divisible by either
3 or 4, is

Answer = 277

Example 6:

(46)7 × (54)7

Sol. 3603

Explanation:

Answer = 3603

DIVISIBILITY IN BASE SYSTEM

y A number in base m is divisible by m – 1 if sum of digits of the numbers is
Number System

divisible by m – 1.
y A number in base m is divisible my m + 1 if difference of sum of alternate
digits are either 0 or divisible my m + 1.

67.
 Example 7:

Find the remainder when (37542)8 is divided by 7.

Sol. 0
Key Note
Explanation:
(37542)8 3 + 7 + 5 + 4 + 2 • Maximum n digit number in base
=  
7  7 Rem m = (mn - 1) in base 10
• Minimum n digit number in base
 21 
  = 0 = Ans. m = (mn-1) in base 10
 7 Rem

Example 8:

Find remainder when (23795)12 divided by 13.

Sol. 2
Explanation:
(23795)12  (2 + 7 + 5) − (3 + 9)  2
=  =  =  2 Ans.
13  13  Rem  13 Rem

TRAILING ZEROS IN BASE SYSTEM

If a number in base m has K trailing zeroes, then the number will be multiple
of mK.

Example 9:

How many trailing zeroes can be obtained when 60! is converted to base 9?

Sol. 14
Explanation:
Highest power of 9 available in 60 ! will give the number of trailing zeroes
when 60 ! is converted to base 9.
To find highest power of 9 in 60 ! find highest power of 3 in it.
60 20 6
Number System

= 2 = 20 + 6 + 2 = 28
= 20, = 6,
3 3 3
60 ! → 328 = 914
There would be 14 trailing zeroes.

68.
 Practice Exercise

EASY
1. For how many prime numbers ‘P’ will ‘37P + 7’ a multiple of P:
(1) 2
(2) 4
(3) 6
(4) 1

2. F
 inal number of non-negative factors which have exactly one trailing zero
in 25 × 38 × 510
(1) 164
(2) 182
(3) 152
(4) 126

3. F
 or N = 212 × 38 × 510 × 74. Find the factors of N that are multiple of 360 but
not of 420:
(1) 1400
(2) 900
(3) 700
(4) 1200

4. F
 or how many natural numbers ‘N’ below 150, (n – 1) ! will not be divisible
by ‘n’:
(1) 45
(2) 35
(3) 40
(4) 38

3200 !
5.  P is completely divisible by P where ‘P’ is a prime number, for how
P
many value of P is this possible?
(1) 16
Practice Exercise

(2) 8
(3) 15
(4) 11

69.
 MODERATE
6. How many, natural numbers from 1 to 1000 have exactly 6 factors?
(1) 24
(2) 12
(3) 18
(4) 16

7. If N has 32 factors then final value of Nmin :

(1) 940
(2) 840
(3) 860
(4) 980

8. N = 235 × 341. How many factors of N2 are less than N but does not divide N?
(1) 1435
(2) 2946
(3) 1570
(4) 1511

(N+ 7)
9. N = 1 × 1 ! + 2 × 2 ! + 3 × 3 ! +………+ 17 × 17 !, then final 19
19 ! R
(1) 1
(2) 7
(3) 19
(4) 114

10. If (n + 1) ! has 4 more trailing zeroes then n ! then how many four digit values
‘n’ can take?
(1) 7
(2) 8
Practice Exercise

(3) 15
(4) 11

70.
 DIFFICULT
11. What is the largest integer that always divide x5 – 5x3 + 4x
(1) 240
(2) 120
(3) 480
(4) 160

12. If N = 10800 then find the sum of thrice number of odd factors, twice
number of even factors and thrice number of factors which are perfect
square:
(1) 168
(2) 192
(3) 172
(4) 180

13. Find all the integers ‘x’ for which x2 + 16x + 92 is a perfect square:
(1) –2
(2) –14
(3) 8
(4) both (a) and (b)

14. F
 ind the sum of all positive numbers ‘n’ for which 7n – 4, 4n – 1, 5n – 2 are
all primes less than 100.
(1) 9
(2) 18
(3) 20
(4) 15

15. W
 hat is the highest power of 12 that will divide the product of first 50
multiples of 12?
(1) 22
Practice Exercise

(2) 68
(3) 50
(4) 72

71.
 ANSWER KEY

1. (1) 2. (4) 3. (3) 4. (2) 5. (1)

6. (4) 7. (2) 8. (2) 9. (4) 10. (2)
11. (2) 12. (1) 13. (4) 14. (3) 15. (4)

SOLUTIONS

Sol. 1 (1)

Explanation :

37P + 7 can be converted in an – a form, i.e., 37P – 37 + 44

Here, 37P – 37 is always divisible by P
∴ For the whole term to be divisible by P.
The given P must be factor of 44.
44 = 4 × 11
or 2 × 2 × 11,
Since, P is a prime number.
∴ P can be 2 or 11.
Hence, P can take only 2 values.

Note : an – a is always divisible by n if a is a prime number.

Sol. 2 (4)

Explanation :

Number of factors having exact 1 zero =

(Number of factors having at least 1 zero) –
(Number of factors having at least 2 zeroes)

⇒ Number of factors multiple of 10

– Number of factors with multiple of 100

2 × 5 (24 × 38 × 54) 22 × 52 (23 × 38 × 58)

Practice Exercise

Number of factors = 5 × 9 × 10 4 × 9 × 9
⇒ 450   ⇒ 324
Factors having exactly one trailing zero = 450 – 324 = 126

72.
Sol. 3 (3)

Explanation :

Factors of form 360 N, where N is a natural number.

360 N = 23 × 32 × 51 [29 × 36 × 59 × 74]

Number of factors of N = (9 + 1) × (6 + 1) × (9 + 1) × (4 + 1)
= 10 × 7 × 10 × 5 = 3500

Factors of form 420 M = 22 × 3 × 5 × 7 [210 × 37 × 59 × 73]

Common factors = [29 × 36 × 59 × 73]
Number of common factors = 10 × 7 × 10 × 4 = 2800
Required number of factors = 3500 – 2800 = 700

Sol. 4 (2)

Explanation :

For the statement given in the question to be true, ‘n’ must a prime number
(2 – 1) ! is not divisible by 2
(3 – 1) ! is not divisible by 3
(7 – 1) ! is not divisible by 7
(31 – 1) ! is not divisible by 31

We see all the prime numbers satisfy this condition.

∴ Total numbers ‘N’ till 150 satisfying this condition will be equal to number
of primes till 150.
There are total 35 primes from 1 to 150 that are 2, 3, 5, 7,………, 149
∴ Total of 35 numbers satisfy the condition or N = 35

Sol. 5 (1)

Explanation :

3200 !
PP

Here, P ≤ N , 3200 , P ≤ 56
Practice Exercise

P≤
Since, P is a prime number. There are 16 prime numbers from 1 to 56.
∴ 16 is the required answer.

73.
 Sol. 6 (4)

Explanation :

For a given number N = ap bq cr

Where, a, b, c are prime numbers.
Number of factors = (p + 1) (q + 1) (r + 1)
Here, number of factors = 6
6 = 6 × 1 or 2 × 3
∴ Numbers can be of form a5 or ab2

Case I:
Numbers of form a5 are 25 or 35
a5 ≠ 55 since it will exceed 1000.

Case II :
Numbers of form ab2
a=2 b = 3, 5, 7, 11, 13, 17, 19
a=3 b = 5, 7, 11, 13, 17
a=5 b = 7, 11, 13
a=7 b = 11

Total 18 numbers have exactly 6 factors.

Sol. 7 (b)

Explanation :

Since, N has 32 factors it can be of different forms:

2 × 16
a b15
4×8
a3 b7
2×2×8
32 a b c7
2×2×2×4
Practice Exercise

a b c d3
2×2×2×2×2
abcde

74.
 Form Minimum Value

(1) a b15 = 3 × 215 98304

(2) a3 b7 = 27 × 33 3456

(3) a b c7 = 27 × 3 × 5 1920

(4) a b c d3 = 23 × 3 × 5 × 7 840

(5) a b c d e = 2 × 3 × 5 × 7 × 11 2310

∴ Nmin = 840

Sol. 8 (2)

Explanation :

N = 235 × 341
Number of factors of N = (35 = 1) (41 + 1) = 36 × 42 = 1512

N2 = 270 × 382
Number of factors of N2 = (70 + 1) (82 + 1) = 71 × 83 = 5893

2946 2946
For N2 ⇒ N
1511
For N ⇒ N

Factors of N2 that does not divide N ⇒ 2946 – 1511 ⇒ 1435

Sol. 9 (4)

Explanation :

N = 1 × 1 ! + 2 × 2 ! + 3 × 3 ! +………+ 17 × 17 !
⇒ (2 – 1) 1 ! + (3 – 2) 2 ! + (4 – 1) 3 ! +………+ (18 – 1) × 17 !
⇒ 21 – 1 ! + 3 ! – 2 ! + 4 ! – 31 +………+ 18 ! – 17 ! = 18 ! – 1

N = 18 ! – 1
19 (N + 7) = 19 N + 133 = 19 ! – 19 + 133 = 19 ! + 114
(N + 7) 19! + 114
Practice Exercise

19 = = 114
19! R 19! R

∴ Required remainder = 114

75.
 Sol. 10 (2)

Explanation :
(n + 1) ! has k + 4 zeroes, if n has k zeroes
⇒ (n + 1) ! = (n + 1) n
↓ ↓
k + 4 zeroes k zeroes

∴ (n + 1) should be a multiple of 54 but not 55

1000 ≤ n ≤ 9999
1001 ≤ n + 1 ≤ 10000
Multiples of 625 = 625, 1250, 1875, 2500,………… 10000
Total cases = 16
Multiples of 1250 = 1250, 2500,………… 10000
Total cases = 8

Total possible cases = 16 – 8 = 8 Ans.

Sol. 11 (2)

Explanation :
Here, we use hit and trial method, we try putting values of x as 3, 2, 1, 0,
–1, –2, –3.
Putting value of x = 0.
f(0) = (0)5 – 5(0)3 + 4(0) = 0
Hence, we can say x is a factor of f(x)
x is a factor of f(x)
x (x4 – 5x2 + 4)
Putting, x = 1
We get, f(1) = 0
⇒ x (x – 1) (x3 + x2 – 4x – 4)
Putting, x = 2 and so on
f(x) = (x – 2) (x – 1) x (x + 1) (x + 2)
Here, we see that f(x) is product of 5 continuous numbers.
Practice Exercise

∴ f(x) must be a multiple of 5 ! or 120

Note : The product of n continuous numbers is always divisible by n !

76.
Sol. 12 (1)

Explanation :

N = 10800 = 24 × 33 × 52 = ap bq cr
⇒ Total number of factors = (p + 1) (q + 1) (r + 1)
= (4 + 1) (3 + 1) (2 + 1)
= 5 × 4 × 3 = 60

For odd factors, we only consider factors other than 2 and power of 2
i.e., 33 × 52
⇒ Number of odd factors = (3 + 1) (2 + 1) = 4 × 3 = 12

For even factors, we consider multiple of 2, i.e., 2 × (23 × 33 × 52)

⇒ Number of even factors = (3 + 1) (3 + 1) (2 + 1) = 4 × 4 × 3 = 48

For perfect square factors, we consider even powers of prime numbers

⇒ Number of perfect square factors = [20, 22, 24] [30, 32] [50, 52]
= 3 × 2 × 2 = 12

Now, 3 × odd factors + 2 × even factors + 3 × perfect square factors

= 3 × 12 + 2 × 48 + 3 × 12 = 168.

Sol. 13 (4)

Explanation :

x2 + 16x + 92 = k2
x2 + 16x + 64 + 28 = k2
(x + 8)2 + 28 = k2
k2 – (x + 8)2 = 28

(k + x + 8) (k – x – 8) = 28
    
a b
28 1 × Not possible (x must be integer)
14 2  Possible
Practice Exercise

7 4 × Not possible (x must be integer)

2 14 Possible

77.
 Case I :
k + x + 8 = 14 and k – x – 8 = 2
Adding both, 2k = 16 or k = 8
Now, put this in any of the equation
We get, x = –2

Case II :
k + x + 8 = 2 and k – x – 8 = 14
Solving both, we get, k = 8
Putting this value of k in any of the equation we get x = –14
∴ x = –2 or –14

Sol. 14 (3)

Explanation :

Case I :
If ‘n’ odd : 7n – 4 4n – 1 5n – 2
 Odd  Odd  Odd

Now, we must put natural number values of n and check,

n = 1 n=7
7×1–4=3 7 × 7 – 4 = 45
4×1–1=3 4 × 7 – 1 = 27
5×1–2=3 5 × 7 – 2 = 33
Not possible

n = 3 n = 11
7 × 3 – 4 = 17 7 × 11– 4 = 73
4 × 3 – 1 = 11 4 × 11 – 1 = 43
5 × 3 – 2 = 13 5 × 11 – 2 = 53

n = 5 n = 13
7 × 5 – 4 = 31 7 × 13 – 4 = 87
4 × 5 – 1 = 19 4 × 13 – 1 = 51
5 × 5 – 2 = 23 5 × 13 – 2 = 63
Practice Exercise

Not possible

n ≠ 15, because then the value of numbers will exceed 100.

78.
Case II :
n is even
7n – 4 : Even
4n – 1 : Odd
5n – 2 : Even
7n – 4 = 2
6
7n = 6 or n =
7
No case possible
⇒ Sum of all possible values of x = 1 + 3 + 5 + 11 = 20

Sol. 15 (4)

Explanation :

First 50 multiples of 12 are (12 × 1), (12 × 2), (12 × 3),…………, (12 × 50)
Product of first so multiples of 12 is
⇒ 1250 × (1 × 2 × 3 × 4 ×…………× 50)
⇒ 1250 × 50 !

For checking power of 12 in 50 ! We must check powers of 2 and 3.

(1) Checking power of 2.
50 ! 50 ! 50 ! 50 ! 50 !
= 25 4
= 3 2
= 12 5
= 1 3
= 6
2    2    2    2    2
Total power of 2 = 25 + 12 + 6 + 3 + 1 = 47
50 ! = 247 × a (where, a is the other factor)

(2) Checking power of 3

50 ! 50 ! 50 !
= 16 2
= 5 3
= 1
3    3    3

Total power of 3 = 16 + 5 + 1 = 22
Here, power of 3 is the limiting factor: 12 = 22 × 3
Highest power of 12 that divides 50 !
Practice Exercise

⇒ (247 × 322 × b)   ⇒ (22 × 3)22 × 23 × b   ⇒ 1222

∴ Highest power of 12 that will divide first 50 multiples of 12
= 12(50 +22) = 1272.

79.
 MIND MAP
MIND MAP

80.