5 Numbers - Part 1

Introduction Rational Numbers

It would not be an exaggeration to say that Numbers which can be represented in p/q
one cannot imagine having a stronghold in form (where p and q are integers and q 0).
quantitative aptitude without knowing num- Examples:
bers. Numbers is one of the most important
2 .5, 3/7, 11, -53, -207, 5.333, etc.
chapters for CAT. Almost three or four direct
questions come from this chapter every year, Irrational Numbers
but its applications are widely used to solve Numbers that cannot be represented in p/q
questions from other sections like Modern form. All decimals that are non-terminating
Maths, Geometry, and Algebra. One needs a and non-recurring come under the irrational
very careful and rigorous practice to under- category.
stand its fundamentals. Examples:
'efs, etc.

•
number,
Classification of Numbers

Keynote

.1
I
mq=:a
7
• Actual value of 1r ¥· It is just ap-

mm:i=m
I
proximated for calculation purpose.
• Any recurring decimal that form a
m!:jl fixed pattern is a rational number
,_, =, ~,- ::.: . ,
I
and hence can be expressed in E..
form. q
Examples: 3.43333 ............ .
0.55555 ............ .

-·-,
I
-, •
1.27777........... ..
Only non-terminating and non-re-

Real Numbers
., - -, I curring decimals are irrational num-
bers, rest in all cases it is rational.

Expressing Recurring Decimals to p/q Form

Numbers can be represented on the number Example 1:
line. There is a unique point on the number Convert K = 0.7777, .. in p/q form.
line for each real number.
Solution: K = !..
Examples: 9
K = 0.7777
2, 3, 7.54, -3.47, ./s, ./ii, etc. ... (i)
Multiply both side by 10 in equation (i)
10K = 7.7777 ... (ii)
- £ -3.47 -1 2.33 + J:; Subtracting equation (i) from equation (ii), we
get 9K = 7
K =!_
9
AH~!JiWS.i
Example 2: Solution: 4
- XYZ 23
Convert K = 1.233333 ... in p/q form: O.XYZXYZXYZ = O. XYZ = - =-
999 27
111
Solution: K = = => XYZ = 23 x 999 = 851
90 30
K = 1.2333 ... 27
Hence, X + z - Y = 8 + 1 - 5 =4

•
In the first step, we will take the non-recurring
digits on the left side of the decimal.
10K = 12.3333 ... (i) Keynote
Now, 100K = 123.3333 ... (ii)
• O is neither positive nor negative
Subtracting equation (i) from equation (ii), we integer.
get SOK= 111 • Mind here if in any question it is
asked to take non-negative inte-
gers one need to consider zero as
well as positive integers. Similarly,
for non-positive integers one need
to both zero and negative integers.
Step 1: Represent the number in the
form of bar.
Example 5:
Example: 1.573333 ... = 1.573
If N = 0. a ,ap,0 20,02... , then which of the fol-
Step 2: For numerator, write the whole
lowing number should be multiplied with N
number as it is and subtract the num-
so that it becomes an integer.
bers that are not getting repeated.
(A) 999 (B) 1,998
So, numerator of
(C) 9,990 (D) 297
1.573 =1573-157 =1,416
Solution: (D)
Step 3: For denominator, write as
many S's as the number of digits re- N = O. a,a 2 0 1a2 a,a 2 ... ,
peating itself followed by O's as many Or, N = o. 0 10 2
times as the number of digits not re-
peating itself immediately after the Since the number is non-terminating but
decimal point. repeating.
Therefore, it can be expressed in the form
So, denominator of 1. s13"' soo
t\One 9
Two
of E.
q
zeroes
Hence N = a, 02
Hence, 1.573 = 1,416 = 118 ' 99
900 75
To make Nan integer, we need to multiply N
Example 3: by 99 leading to the formation of a multiple
Convert 3 .0535353 ... in p/q form . of 99.
3 023
Solution: ' Therefore, option (D) is the correct choice.
990

!!~
lnte-=:ers
3 0 30
Using trick: 3 .053 = • = Integers are numbers that are not fractions.
Example 4: Integers are of three types:
1. Positive integers: 1, 2, 3, 4, 5, ...
If O.!t'YZXYZXYZ... = E, find (X + z- Y)
27
2. Negative integers: -1, -2 , -3, -4,. Solution: (D)
3. Zero (A)~ x c
Fraction• (noneed J.
to chec k ) Even
A fraction represents the part or portion of
a whole thing. It can be categorised in three (Since an even number multiplied by any
categories: number always results in an even number).
Any number >< Even Even
1. Proper fraction: When the numerator is
less than the denominator. For example, (B) a2 + c2 b2
2/3, 5/7, 11/15, etc. J, J, J,
2. Improper fraction: When the numerator Odd Even Odd
is greater than the denominator. For ex- Odd + Even - Odd
ample, 5/3, 9/7, 7/4, etc.
Odd - Odd Even
3. Mixed fraction: As the name suggests, it's a
(o + b + c) >< (o - b)
combination of natural number and a frac-
(C) o~d odd
tional part For example, 2 ~, 3 ..! , 1~ . etc.
5 2 7 Any nu m be r >< Even Ev en
lnteters can be further clas•ifl•d Into two (D) a' (b c)
Important cate,orie•
J, J, J,
1. Even numbers: Integers that are divis-
Odd Odd Even
ible by two or integers that are of the
form 2n (where n is a whole number) are Odd x (Odd+ Odd x Odd Odd
called as even numbers. For example, o, Hence, option (D) is correct.
2 , 4, 6, -10, 12, etc.
lnteten can ala:o be clas•lfl•d u
2. Odd numbers: Integers that are not divisi- 1. Whole numbers: Whole numbers are non-
ble by two or integers that are of the form negative integers. For example, 0, 1, 2, 3, 4, 5, ..
(2n + 1) or (2n - 1) (where n is a whole
2. Natural numbers: Positive integers are
number) are called as odd numbers. For
natural numbers. These are also known
example, 1, 3, 5, 7, -3, -5, -13, etc .
as counting numbers. For example, 1, 2,
Some Important Propertle• of Even and Odd 3, 4 , 5, ...
Numbers
Natural numbera can be classified Into thrff
• Zero is an even number catepries
Even >< any w hole number = Even
Prime number, c omposite number, and 1.
• Odd x Odd = Odd
• Even + Even = Even 1. Prime Number: Natural numbers having
• Even + Odd = Odd exactly two distinct factors are called
• Odd + Odd = Even prime. For example, 2, 3, 5, 7, 11 , .
• (Evenr = Even; where N is a natural number a) All prime numbers are only divisible by
• (Odd)N = Odd; where N is a natural number one or by itself.

Example 6: b) Ev ery prime number greater than 3

can be written in the form of (6k + 1)
Given a and b are positive odd integers and
or (6k - 1) (where k is a natural number)
c is a positive ev en integer. Which of the fol-
but vice versa is not always true.
lowing is ne cessarily odd?
13 = 6 >< 2 + 1 Prime
(A) (a + b)' c (B) a 2 + c2 - b 2
29 = 6 >< 5 - 1
x
Prime
(C) (a + b + c) (a - b) (D) a' (b + c) But, 6 >< 4 + 1 = 25 Not prime

Numbers - Part 1 135

c) If P is a prime number greater than 3, 4 = 22 ; check only the last two digits of the
then P2 - 1 is always divisible by 24. number.

Keynote • For example, 237,896 is divisible by 4 be-

cause 96 is divisible by 4.
125 = 5 3 • Check if the last three digits of a
number are divisible by 125.
• 1 is neither prime nor composite.
2 is the only even prime number and Example 7:
it is also the smallest prime number.
Check if 1112131415 ...1920 is divisible by 16? If
3, 5, 7 is the only triplet of prime
not, find the remainder.
number which are at a difference
Solution: O
of 2. No other triplet of prime num-
bers satisfies this condition . For the divisibility rule of 16, divide only the
last four digits of the number.
2. Composite number: Natural numbers Rem [1920/16] = 0
having at least three distinct factors are Hence, 1112131415 ...1920 is completely divisible
called composite . For example, 4 , 6 , 8 , 9 , by 16.
10, .
Example 8:
How to check whether a number i• prime or 1457865XY is divisible by 8. What can be the
not?
maximum value of (X + Y)?
One needs to check the divisibility of a given
(A) 11 (B) 12
number by all prime numbers less than the
square root of the given number. (C) 14 (D) 16
For example: Let us check 259. Solution: (C)
-,/259 < 17 1457865XY is divisible by 8 , so 5XY should be di-
So, we will only check the divisibility of 259 visible by 8 (since 2 3 = 8. So, we ought to inves-
by prime numbers less than 17. tigate the last three digits of the given number).
259 is divisible by 7. Hence, it is not Start putting the values as X = O and Y = O;
prime. 500 is not divisible by 8.
3. Co-prime numbers: Pair of numbers Put X = 0 and Y = 1; 501 is not divisible by 8 .
whose HCF is 1. For example, (2 , 3), (7,
Put X = O and Y = 2; 502 is not divisible by 8 .
8), (11 , 15) etc., are Co-prime pairs.
Put X = o and Y = 3; 503 is not divisible by 8.
It is not necessary for both the numbers
to be prime in Co-prime pairs. Put X = O and Y = 4; 504 is divisible by 8.
Next numbers divisible by 8 would be at dif-
Divisibility Rules ference of 8.
The rule for 2" or 5" type numbers: So, the possible values of XY are = {04, 12,
The last n digits of the number should be 20, 28, 36, 44, 52, 60, 6B , 76, 84, 92}
divisible by 2" or 5" The required maximum value of (X + Y) is
For example: (6 + 8) = 14.
The rule for 4: Rule for 3
The sum of the digits of the number should
be divisible by 3.
Example: 23,481 is divisible by 3 because 2 + For example:
3 + 4 + 8 + 1 = 18 is divisible by 3. Divisibility rule of 6 (2, 3); if a number is divisi-
Rule for 9 ble by both 2 and 3, then it must be divisible by 6.
The sum of digits of the number should be Divisibility rule of 21 (3, 7); if a number is divisi-
divisible by 9. ble by both 3 and 7, then it must be divisible by 21.
Example: 365,184 is divisible by 9, because 3 Divisibility rule of 72 (8, 9); if a number
+ 6 + 5 + 1 + 8 + 4 = 27 is divisible by 9. is divisible by both 8 and 9, then it must be
Digital sum divisible by 72.
Digital sum is the sum of digits of the num- Example 9:
ber till a single digit is obtained. If a and b are two respective single digits of
the five-digit number 843ab where a is not
Example: Digital sum of 247 is 2 + 4 + 7 = 13
equal to b such that this number is divisible
by 40, then (a + b) can be?
Remainder obtained by dividing any number (A) 1 (B) 2
by 9 equals the digital sum of that number.
(C) 3 (D) 5
The digital sum of all the multiplies of 9 is 9.
Solution: (B)
Hence, for the divisibility by 9, one should
For divisibility by 40, the number should be
use the concept of digital sum to approach divisible by both 5 and 8.
the problem easily.
For divisibility by 5, b can be O or 5 (since b
Rule for11 is the last digit and for a number to be divis-
If the difference between the sum of digits ible by 5, the last digit is either O or 5). But,
at odd places and the sum of digits at even if we take b = 5 number becomes odd, and it
would not be divisible by 8.
places is O or any multiple of 11 then the
Hence, b = 0.
number is divisible by 11 (Assign alternate + Now, the last three digits of 843ab, i.e., 3a0,
and - sign from the right-hand side, add all should be divisible by 8. As for a number to
+ values and all - values and then take their be divisible by 8, we ought to take the last
difference). three digits of the number and divide it by 8.
Example: Check 1253478 Put, a= 2 320 is divisible by 8.
Next number would be 320 + 40 = 360.
+ +
So, there are two values of a = {2, 6}
4 7 8
Hence, a+ b can be either 2 + O = 2 or 6 + O = 6.
= (8 + 4 + 5 + 1) - (7 + 3 + 2) =18 - 12 = 6 Option (B) is correct.
which is not divisible by 11. Common Divisibility Rules of 7t 11, and 13
Hence, the given number is not divisible by 7, 11, and 13 are the factors of 1,001 , and they
11. are Co-prime to each other.
Divisibility Rules for Composite Numbers 1,QQ1 = 7 X 11 X 13
The divisibility rules of composite numbers Remainder [10 3/1 ,001] = -1
are: Also, Remainder [103 /7] = -1,
1. Select Co-prime factors of the compos- Remainder [10' /7] = 1
ite number. Remainder [10 9/7] = -1 ; and , so on.
2, Product of these Co-prime factors The same result we get in the case of11 and 13 also.
should equal the composite number.
--
To check the divisibility of any large number
by 7, 11, or 13 or to find the remainder, make
pairs of 3 digits from the right-hand side and
assign alternate + and - sign to the respec-
tive pairs. Add all+ pairs and all - pairs and N = aq, + '1 q1 = bq2+ '2
c) q, (q,

u
,,

then take their difference. If this difference Let q 3 = 0 % =r3

is divisible by 7 or 11 or by 13, then the original q1 = bq2 + ' 2
number would be divisible by 7 or 11 or by 13. = =
As q 2 r 3 so, q 1 br3 + r 2
For example: Check the divisibility of Also we know that
10,573,240,035 by 7. N = aq, + r, and q 1 = br3 + r 2
+ + So, N = a(br3 + r2) + r,
=> 10 I 573 I 240 035 (Make pairs from
or, N = abr3 + ar 2 + r1
the right side starting with " +")

•
This is the least such number
=> (573 + 35) - (10 + 240)
=> 608 - 250 = 358 Short Trick
358 is not divisible by 7 so the given number
is not divisible by 7. Divl50r Rem.a Ind tr

Example 10:
Find the remainder when 151,152,153 ....... .. .
199,200 is divisible by 13.
Solution: 12
Create two columns of divisor and re-
From 151 to 200, there are 50 three-digit mainder. Start from last row of sec-
numbers. ond column , go diagonally up and
multiply (br) then add horizontally
=> ••• 1,:,I··' 1,:. 1,;. 1,.-, 1,:. I·•·Y,1,:. I
"-..'....J'
(br + r) again go diagonally upward
3
multiply {a (br, + r,)} then add hori-
zontally {a(br3 + r 2) + r,}.
Take pair of two consecutive numbers from
the right side and add them up. Example 11:
+ 1 + 1 + 1 + 1 ....... .... up to 25 How many three-digit numbers exist which
on successive division by 5, 8, and 9 leaves
times. 25
remainder of 2, 3, and 4, respectively?
Rem [ * ]= 12 Solution: 3
Divi s or Remainder
Successive Division
In successive divisions, the quotient ob- • =>
.,! + => 8 "4 3 ,. 35
tained in the first division acts as a dividend
for the second division. The quotient ob- ..!, •
tained in the second division acts as a divi- General form of the number is LCM (5, 8, 9) K
dend for the third division and so on. + 177 = 360K + 177 , where K is a whole number
Let's consider a number N is successively Put, K = 0, 1, 2, 3, ....... ....... .
divided by a, b, and c and the remainders The desired three-digit numbers = 177, 537,
obtained are r 1, r 2 , and r 3 , respectively. and 897 for K = O, 1, and 2, respectively.

Numbers - Part 1
 Hence, three such numbers are possible.
Example 12:
A number is successively divided by 5, 7, and
11 and leaves the remainder 1, 3, and 5, re-
In general, the prime factorisation of a num-
ber N is represented as:
N = p 0 x qb x re
(where p , q, and r are the
pr ime numbers and a, b, and c are whole
numbers).
--
spectively. Find the respective remainders
when the order of division is reversed. Flndlnll Number of Factor•
Solution: 2 36 =6 )( 6 = 22 )( 32
Dlv/11or Aemal11 der

,~ ·
-!. •
. -,2,. =>
=> 38 11 5 + 1 ., 191
7 • 5 + 3 • 38

E II E,

The required number is LCM (5, 7, 11)K + 191

3 ways 3 ways
where K is a whole number= 385K + 191.
The least value of the number is obtained Total = 3 x 3 = 9 factors.
for K = 0, i.e., 191. Jf N = po )( qb )( ,C

When the order of divisor is changed, Numbers of factors of N

1µTT11 s;T1o = (a + 1) x (b + 1) x (c + 1)

•
1~2
-,- --,- --,-
Hence, the respective remainder when the Keynote
number is successively divided by 11, 7, and
5 are 4 , 3, and 2. • Number of factors of any perfect
square is always odd.
Factor Theory • Number of factors of square of any
Factors prime number is 3.
Factors are the natural numbers less or
equal to the given number that divides it Number of Even and Odd Factor•
completely. Even Factora:
Factors are the divisors of the given number. 1,800 = 18 )( 100 = 2 )( 3 2 )( 102 = 2 )( 3 2 )( 22 )( 52
Example: Factors of 12 1, 2, 3, 4, 6, 12 = 23 3' 5'
Factors of 56 1, 2, 4, 7, 8, 14, 28, 56.
Prime Factorisation
According to the fundamental theorem of
arithmetic, every natural number (except 1)
can be represented as the product of one or
more prime numbers.
This process of breaking down any number
to the product of prime numbers is known Even factors = 3 x 3 x 3 = 27.
as prime factorisation. Note: One should not take 2° while calculat-
Exampln : 12 = 2 x 2 x 3 = 2 2 x 3 ing even factors because 2° = 1; any combi-
60 = 6 x 10 = 22 x 3 x 5 nation with other prime numbers will give an
odd factor only.
Odd Factors: Flndin• Sum of the Factors
1,8QQ = 2 3 X 32 X 52 Consider a number N = 23 x 3 2 x s~
2 is an even prime number, and any expo- Sum of factors of N can be written as:
nent of 2 (except 2°) will also be an even
(2 0 + 2 1 + 2 2 + 2 3) X (J O + 3 1 + J 2) X
number.
Hence, while calculating the number of odd ( 5 0 + 51 + 52 + 53 + 5' )
factors, one should neglect 2 from the prime Now, the given expression is in G.P. and we
factorisation. know that:
1,800 = 2' 3' 5' Sum of G.P. = a(r" - 1), r > 1
(r-1)
Where a first term
r common ratio
and n number of terms

The number of odd factors = 1 x 3 x 3 = 9 Therefore, 20(2' -1) x 3 0(33 - 1) x 50(5s -1)
(2-1) (3 - 1) (5-1)
Number of Perfect Squares and Perfect = 15 X 13 X 781 = 152,295
Cube Factors
Note: If any number say N can be expressed
For perfect square factors , only consider the as N = aP x b q x er x ... ,
multiple of 2 as power of a prime number.
where a, b, and care prime factors and p, q,
For example : and rare whole numbers.
N = 25 3' 7'
Sum of all factors (or divisors) of N

(o''' - 1){b'' ' - 1)(c" ' - 1)

[fl
(o - 1)(b - 1)(c - 1) x ..

FlndinC the Product of the Factors

Let's take a small number and understand the
concept behind finding the product of factors
.l .l of a natural number N.
3ways 4 ways 2 ways
20 = 1, 2, 4, 5, 10, 20
Number of perfect square factors of N
< •. . . :_ '
1
= 3 X 4 X 2 = 24 Product of factors =
For a perfect cube, only consider the multi-
ple of 3 as power of a prime numbers. = (1 X 20) (2 X 10) (4 X 5)
For example: = 20 X 20 X 20 = 20 3
N = 2s 31 73
Observe here, 20 has 6 factors , which can be
.l .l .l
paired in 3 ways .

[~:) [::] [::)

So, it can be generalised that

Product of factors of N =N [
oo.of f•«o" '
2
,

.l .l .l In case of perfect square numbers, let N = p 0

2 ways 3 ways 2 ways x qb x ,c where each of a, b, c is even.
Number of perfect cube factors of N There are (o + 1)(b + 1)(c + 1) say d factors.
= 2 x 3 x 2 = 12
There are (a+ 1)(b + 1)(c + 1) say d factors. In how many ways a number can be written
as the product of its two Co-prime factors?
We can form (d - 1)/2 pairs and we would be left
with one lone factor, i.e., N . The product of all Let's see for 48
these factors is f!l,.d-fl/2 x square root (N) = f!l dm_ 48 = 16 X 3 = 2 4 X 3 1
Whether or not N is a perfect square, the Writing 48 as the product of its two Co-
product of all its factors is fll. d/2) where d is prime factors.
the number of factors of N.
48 = (\ 2' x 3) => (1 , 48)}
In how many ways a number can be written 2 ways
= (3. 2• ) => (3, 16)
as the product of its two factors?

I
By permutation and combination concept, it
Let's see for 40
can be shown that the number of ways of
40 1, 2, 4, 5, 8, 10, 20, 40 = Total 8 factors writing any number as the product it's two
Co-prime factors = 2<P - 1>
40=(1 x 40)
=(2 x 20) where, p is a number of prime factors.
= (4 x 10) 4ways
Example: 120 = 12 x 10 = 2 3 x 3 1 x 5 1
= (5 x 8) So, p = 3 {·: 3 prime numbers are used in
So, it is obvious that if a number has n num- prime factorisation}
ber of factors (and n is even), they can be Total ways of writing 120 as it's co-prime
paired in n/2 ways to get the product of it's factors
two factors. = 23-1 = 21 = 4
Total no. of ways of writing any number as product And , can manually verify also,
120 = (1 , 2' X 3 X 5), (3, 2' X 5), (5, 2' X 3),
of its two factors Total number of factors
(2 ' , 3 X 5).
2
This is applicable when total number of fac- Flndln& the Number When Its Number of
tors is even for any number (i.e., non-perfect Factors Is Given
square numbers). Let us understand it by an example:

When number of factors are odd I.e., for If a number N has 10 factors.
perfect square numbers? N = P1° X P/ X P/ X •

16 • 1, 2. 4, 8, 16 Total factors,. 5 So, (o + 1) (b + 1) (c + 1) ............. = 10

Now, see in how many ways 10 can be writ-
ten as the product of two numbers, three
16 = There are 2 ways of writing 16 as the numbers, and so on.
product of two distinct factors.
Accordingly, the value of a, b, c, ......... ... can
But, there is one more way= (4 x 4) be determined.
So, the whole ways of writing 16 the product 10 (1 x 10) (o + 1) (b + 1) = 1 x 10
of two factors are 3.
Therefore, one can generalise : (2 x 5) (o + 1) (b + 1) = 2 x 5
Number of ways of writing any number as the product a= 1, b = 4
Hence, N = P1° x P/ (where P, and P can be
of two distinct factors = ( Total numbe~ of factors - 1 J any two distinct prime numbers)
2

Or,
Total number of ways of writing any number as the N = P,1 x P/
(where P, and P2 can be any two distinct
product of two factors = Total number of factors + 1
prime numbers)
Numbers - Part 1
Example 13: b) Number of perfect cube factors of N
If N 3 has 70 factors. Find the minimum value N = 25 3' 5' 7'
of N. .J, .J,
Solution: 72
Try to break down 70 as the product of two
numbers, three numbers, etc.
70--.+1x7Q N3=p69 N=p n
Ja Ja [::)
2 Ways 2 Ways .__,,_..__,
3Ways
J:L
1Way

2 X 35 Nl = pq34
Total perfect cube perfect = 2 x 2 x 3 x
(Not possible because exponents of prime
1 = 12
numbers should be multiple of 3.)
c) Factors which are multiple of 100
70 5 x 14 N3 = p 4 q 13 (Not possible)
N = 25 x 34 x 56 x 72
7 X 10 Nl = p6q9 N = p lq J
100 = 22 X 52
2 x 5 x 7 N 3 = pq 4 r6 (Not possible)
N = 22 X 5 2 (2 3 X 34 )( 5" X "72)
So, N can be either p 23
or p 2q 3 type.
So, number of factors which are multiple
For minimum value of N. of 100
Take N = p 2q 3
=~•Q~•Q~•Q~•Q=4•5•5
Put,p = 3 and q = 2 (Two least prime numbers) x 3 = 300
Hence, N min = 3 2 X 2 3 = 9 X 8 = 72. Example 15:
Example 14: Find the number of solutions of ax b = 1980,
If N = 2 5 x 3 4 x 56 x 7 2 • Find : where a and bare natural numbers.

a) Number of perfect square factors of N. Solution: 36

b) Number of a perfect cube of factors N = 1,980 = 198 x 10 = 2 2 x 3 2 x 5 x 11

of N. Total number of factors of N
c) Number of factors of N which are multi- =~•Q~•Q0+Q0+Q=3•3•2•2
ple of 100. = 36
Solution: a) 72, b) 12, c) 300 Number of ways of writing N as product of
its two factors
a) Number of perfect squares factors of N
Total no. of factors =
N= 2 ' 3• S' 7' 18
2 2
.J, .J, .J, .J,
Variables a and b are mentioned in the
s'

ill ill
question, so one needs to find the ordered
s'
Ja
solution, i.e., (a, b) and (b , a) would be
s• counted as 2 different solutions.

s' 2 Ways Therefore, ax b = 1980 will have= 2 x 18 = 36.

3 Ways 3 Ways
Example 16:
Total perfect square factors =3 x 3 x 4 x 2 =72 If all the factors of 5,880 are written in as-
cending order, from left to right, find the
factor which occupies the 43rd from the left
end.
Solution: 980
N = 5,880 = 2 3

= 48.
X 31 X 51 X

Number of factors of 5,880 = 4 x 2 x 2 x 3

72 Keynote

HCF of given set of numbers is al-

•
Let's write some of factors. ways less than or equal to the
5 ,880 --> 1, 2, 3 , 4 , 5, 6, 7, ... 5 ,880 smallest number in the set.
Notice here, first factor x 48th factor = 1 x • LCM of given set of numbers is al-
5 ,880 = 5,880 ways greater than or equal to the
Similarly, second factor x 47th factor= 5,880 largest number in the set.
HCF is the factor of LCM.
and so on. Hence, it can be concluded that
the product of factors equidistant from both
ends is equal to the number itself. Therefore, FlndinS: HCF and LCM by factorisation
method
Sixth factor x 43rd factor = 5,880
Factorise all the given numbers. To find HCF,
6 x 43rd factor= 5,880
look for common prime numbers and take
5 80
43rd factor = •~ = 980 their highest common power. And to find
LCM take alt prime numbers used in prime
HCF and LCM factorisation and write their highest powers
Factors are numbers that divide the giv- available.
en number completely, and multiples are Example 17:
the numbers that are divisible by the given Find HCF and LCM of 216, 252 and 306.
number.
Solution: 18 and 25,704
For example, factors of 18 are 1, 2, 3 , 6, 9,
and 18. Prime factorise all the numbers.
Multiples of 18 are 18, 36, 54, 72 ............ . 216 23 X 33
Highest Common Factor (HCF) 252 22 X 32 X 7
It is the largest number that divides the giv- 306 2 X 3 2 X 17
en set of numbers completely. For HCF, it can be observed that prime num-
Example: Find HCF of 15, 24, and 36. bers 2 and 3 are common in all, and the
Factors of 15 are 1, 3, 5, 15. highest common power of 2 is 1, and the
highest common power of 3 is 2.
Factors of 24 are 1, 2, 3, 6, 8, 12, 24.
HCF = 2 1 X 3 2 = 18
Factors of 36 are 1, 2, 3, 4, 6, 9, 12, 18, 36.
For LCM, write all the prime numbers used
So, the highest common factor of 15, 24, and in the prime of factorisation with their high-
36 is 3. est power.
Least Common Multiple (LCM) LCM = 2 3 X 3 3 X 7 X 17 = 25,704.
The least number is completely divisible by Example 18:
the given set of numbers.
If the HCF of the first 40 natural numbers is
Example: Find LCM of 9, 18, and 24. N, then find the LCM of the first 46 natural
Multiples of 9 are 9, 18, 27, 36, 45, 54, 63, numbers.
72,81... ..........
Solution:
Multiples of18 are 36, 54, 72, 90 ............ .
HCF of the first 40 natural numbers is N, which
Multiples of 24 24, 48, 72, 96 ..
means N includes all the prime numbers up
So, the LCM of 9, 18, and 24 are 72. to 40 with their highest power.

U!ffii•i#tWWI n
{1, 2, 3, 4, 5, ............. 40) = N Example 20:
Now, the numbers 41 to 46 are added to the Find HCF of 276, 372, 588, and 708.
list. So, one needs to include all new prime
Solution: (12)
numbers added and look for any change in
the highest power of already used prime Take the minimum difference between any
numbers in N. two numbers.
41 -+ Prime -+ Add Minimum difference = 372 - 276 = 96
42 -+ 2 x 3 x7 It will not update the N Now, start checking the factors of 96 that
will divide the given numbers completely.
43 -+ Prime -+ Add
Use the concepts of divisibility to figure out
44 -+ 22 X 11 No update in N again the value quickly.
45 -+ 32 X 5 Again, no update required Check the factors in decreasing order as one
46 2 x 23 No update needs to find HCF here.

Hence, LCM of (1, 2 , 3, 4, 5, ............ 46) 96 25 X 3; Factors 96, 48, 32, 24, 16, 12
= N x 41 x 43 X X X X ,/

Example 19: So, 12 is the highest factor of 96, which di-

vides all the numbers completely.
LCM of (5" x 48, 250, 32 x k) is 2 1 x 5 5 x 3 2
find maximum of (n + k). Hence, 12 is required for HCF.

Solution: 56,255 AppUcatlon Rulu of HCF and LCM

The largest number that will divide a, b,
5" X 48 2~ X 3 X 5"
and c, is HCF (a, b , c).
25Q 2 X 53 • The largest number that will divide a, b,
25 x K and c leaving the remainder of x, y, and z,
respectively, is HCF (o - x, b - y, c - z).
LCM includes all the prime numbers
• The largest number that divides a, b, and
with their highest power, so the maximum
c, leaving the same remainder in each
exponent of 5 that is possible is 5. case, is HCF (o - b, b - c, c - a).
Hence, the maximum value of n can be 5 • The smallest number which is exactly divis-
here. ible by o, b, and c is LCM (a, b, c).
To maximise K, it can be taken as K = 2 x 32 x 5 5 • The smallest number, when divided by a,
= 56,250 b, and c, leaves the same remainder r in
each case is [LCM (a, b, c) + r].
So, number 32K = 2 6 x 3 2 x 55 {which is
• The smallest number, when divided by a,
equal to LCM) b, and c, leaves the remainder p, q, and r,
Therefore, maximum of (n + k) = 5 + 56,250 respectively, is [LCM (a, b, c) - m], where
= 56,255 a-p=b-q=c-r=m.
Example 21:
Findin• HCF by minimum difference
The least multiple of 8, which leaves a re-
method
mainder of 4, when divided by 9, 15, 18 and
Find the minimum difference between the 30 is
pair of numbers, and one of the factors of
Solution: 184
this difference would be the HCF of given
The least number which is divisible by 9, 15,
numbers.
18, and 30 is LCM of (9, 15, 18, 30) = 90 .

.\A.:SiUJMI
The general form of all such numbers= 90K. Capacity of each can = 8 L
As in the question, it says that number Number of cans required = + !.3.. +
8 8 8
leaves a remainder of 4 on dividing by 9, 15,
= 5 + 9 + 11 = 25
18, and 30. So, required number= 90K + 4.
Now, to figure out the least multiple of 8, Some General Rules of HCF and LCM
put values of K = 1, 2, 3, ... and check. • If two numbers are given m and n, then m
Put K = 1, 90 x 1 + 4 = 94 Not divisible by 8. x n = HCF x LCM .
Put K = 2, 90 x 2 + 4 = 184 Divisible by 8. • If HCF of m and n is h; assume m = ha and
Hence, 184 is the desired number. n = hb; where HCF (a , b) = 1.
Example 22: • HCF of fractions = HCF of numerators/
LCM of denominators.
On dividing a certain number by 8, 10, and 12,
the remainders obtained are 2, 4, and 6, re- • LCM of fractions = LCM of numerators/
HCF of denominators.
spectively. Find the largest three-digit num-
ber satisfying this condition. • HCF of (xP -1, x<1 - 1) = x HCF(p,q) -1.

Solution: 954 Example 24:

The product of the two numbers is 6,480,
Notice here, the difference between the di -
and their HCF is 9. How many are such pairs
visors and their remainders is constant. of numbers possible?
8 - 2 = 10 - 4 = 12 - 6 = 6
Solution: 2
General form of the number= LCM (8, 10, 12)
K-6 Let's take the numbers 9a and 9b where o
and b are Co-prime, i.e., HCF (a, b) = 1
= 120K- 6
Largest three-digit number can be obtained 9ax 9b=6,480 00=80 ab= 2• x 51
at K = 8 The number of ways of writing a number as
120 X 8 - 6 = 960 - 6 = 954 the product of its two Co-prime factors =
2P-1 (where p is the number of prime num-
Example 23:
bers used in prime factorisation).
For some industrial experiments, 40 L of
Here, p = 2
mud water, 72 L of saline water, and 88 L
of distilled water were ordered. The lab at- Co-prime pairs possible = 2 2 - 1 = 21 = 2
tendant wants to pack them in cans so that a x b = (1 , 80) and (5, 16)
each can contains the same litres of water,
Hence, 2 pairs are possible.
and he can't mix any two in a can. What is
the least number of can required? Example 25:
Solution: 25 The sum of the two numbers is 121, and their
HCF is 11. How many are such pairs of num-
To keep the minimum number of cans, one bers possible?
needs to maximise each can's capacity. So,
first out the maximum capacity of cans that Solution: 5
can store all 40 L, 72 L, and 88 L of water Let's take the numbers as ha and hb where
completely. It is basically the HCF of (40, 72, a and b are Co-prime numbers.
88) = 8.
ha + hb =121 h(a + b) =121
11 (a + b) = 121 o+b=11

JU-IJtW¥Bi
(a, b) s (1 , 10), (2, 9), (3, 8), (4, 7), (5, 6) To find highest power of 3 take all multiples
of 3 in 12! and neglect rest of the number.
So, total five pairs of numbers are possible.
12! = 3 x 6 x 9 x 12 >< K
Note: One can also use Euler number to
=3•~•~ x ~x~ x ~ x ~ x K
find number of co-prime pairs. Number of
ways of writing N as sum of two co-prime = 3 5 >< K,
numbers Hence, highest power of 3 in 12! is 5.
The question can also be asked to find the
= ¾<Euler number of N)
highest power of 3 that divides 12! completely.
Example 26: Both the questions have the same answer.
LCM of 2 natural numbers a and b where a > b Alternate method
is 429. What is the maximum possible sum To find the highest power of prime P in any
of the digits of b ? factorial N , divide N by P successively till the
Solution: 12 quotient obtained is less than P. And then
add all the quotients.
429 = 3 x 11 x 13
So, o and b can have only these th ree prime Example: Find the highest power of 3 in 25!
numbers with their highest power as 1. So,
~ ) =8
different possibilities are: [
J Quo t ien t

[8)
(a , b) (3 X 11 X 13, 1) = (429, 1)
- =2
(3 X 11 X 13, 3) = (429, 3)
J Quo t ient
(3 X 11 X 13, 11) = (429, 11) Hence, highest power of 3 in 25! = 8 + 2 = 10.
(3 X 11 X 13, 13) = (429, 13) Note: This method is applicable only for
and, so on ... prime numbers.
But to maximise sum of digits of b Flndln• the Hl-'1•ot Power of Compoolte
(a, b) (3 x 11 x 13, 3 x 13) = (429, 39) Numbers In any Factorial
Or, To find out the highest power of composite
(11 X 13, 3 X 13) = (143, 39) numbers in a given factorial, first, factorise
the composite number and find the highest
Hence, maximum value of sum of digits of
powers of prime numbers available in factor-
b = 3 + 9 = 12. isation. Accordingly, one can get composite
number power as well.
Factorials
Example 27:
Factorials are defined as :
What highest power of15 divides 50! completely?
N! = N x (N - 1) x (N - 2) x ... x 3 x 2 x 1
For example, 6! = 6 x 5 x 4 x 3 x 2 x 1 Solution: 12
15 = J X 5
Note: O! = 1
Power of 3 in 50!
Flndln• Hl-'1•ot Power of a Prime In any
Factorial ~ = 16 ~ = 5 ~ = 1
3 ' 3 ' 3
Let's understand it by an example.
= 16 + 5 + 1 = 22
Example: Find highest power of 3 in 12!
Power of 5 in 50!
12!=1 >< 2 >< 3 >< 4><5><6><7 >< 8 >< 9 >< 10 >< 11 x 12
~ = 10 :!£ = 2
5 ' 5
= 10 + 2 = 12
So, 50! = 3 22 x 512 x K Any factorial from 30 to 34 will have the
= (3 x 5)12 x 310 x K same number of Ss.
= 1512 )( Kl So, let's check for 30!
Therefore, the highest power of 15 that will ~=6 ~ =1
divide 5! completely is 12. 5 ' 5
So, 30! is a multiple of 57 and hence any fac-
Important obHrvatlon
torial greater than 29 would be a multiple
It can be observed from the above example of 5 7•
that the highest power of larger prime num-
Similarly, one can check (by smart guess)
bers would always be less than the smaller
that the least factorial that has 75 is 35!
prime numbers. As in the above example.
The highest power of 5 < the Highest power ~ =5
7
of 3. So, any factorial greater than 34 would be
Example 28: the multiple of 7 5•
150 Accorting to the question, N! should be a
For what maximum value of N , ! is an
63" multiple of 5 7 but not 7 5 •
integer?
Hence, N can be 30, 31, 32, and 34.
Solution: 24
Therefore, 4 values of N can hold.
63 = 3 2 )( 7
Highest power of 3 in 150! Flndln• the Number of TralUn• Zeros In a
150 Factorial
3
= 50• 3
=16• !§_
3
= 5• 3
=1 As N! is the product of all the numbers start-
= 50 + 16 + 5 + 1 = 72 ing from N to 1, and in any multiplication,
zero can be only obtained when a pair of 5
Highest power of 7 in 150! and 2 is available.
150 = 2\ ~ =3
7 7 The number of pairs of 5 and 2 available in
=21+3=24
any factorial will decide the number of trail-
ing zeros.
150! = 3n x 7 2" x K
Factorial is a regular series of numbers.
= 3"9 x 7'2-"x 3 2" x K
It can be witnessed that in any factorial
= (3 2 x 7)2" x 3 2" x K
Number of 2s > Number of Ss
150! = 63 2" )( Kl
Or it can also be said
So, maximum power of 63 that can be drawn
Power of 2 > Power of 5
from 150! is 24.
But, to produce zero, a pair of 2 and 5 is
Therefore, Nmu = 24 required ; hence, the power of 5 would be
Example 29: the deciding factor, i.e., the number of S's
For how many values of N, N! is completely available in factorial will give the number of
divisible by 57 but not by 75 ? trailing zeros in that factorial.
Solution: 4 Example 30:
For N! to be a multiple of 5 7, N should be Determine the number of trailing zeros in 67!
closer to 35.
Solution: 15
(One needs to have a smart guess to ap-
Just calculate the highest power of 5 avail-
proach such problems).
able in 67!
 ~ = 13 ~ = 2 = 52 X S"K
5 ' 5
= 5 6K 6 trailing zeros
= 13 + 2 = 15
Hence, one cannot get 5 trailing zeros in any
5 is available in 67!.
15
factorial.
There are 15 trailing zeros in 67!
This is the skipping zero concepts.
Example 31: Again, 45! - 49! --+ 10 trailing zeros = 5 1°K
Find trailing zeros in 89! + 88!.
Solution: 21 { ·: ~5 = 9 '5
~ = 1}

89! + 88! = 89 X 88! + 88! 50! = 50 X 49!

= 88! (89 + 1) = 2 X 52 X 49]
= 88! X 9Q = 2 X 52 X 5 1°K = 5 12 K,
Trailing zeros in 88! is 50! 12 trailing zeros

= 17, !?_ = 3 50! 54! 12 trailing zeros.

5 5 So, there is no factorial which has 11 trailing
= 17 + 3 = 20 zeros.
So, trailing zeros in 89! 90 • Let's generalize this concept:
i i If N! P Trailing zeros
20 zeros 1 zero
then, 5o x N ! (P + Q) Trailing zeros
= 20 + 1 = 21
Example 32:
Skipping Zeros Concept in Factorials If m and n are two consecutive natural num-
Let's observe the behaviour of factorial from bers, the difference between the number of
trailing zeros of n! and m! is 3. Find the min-
the trailing zero's point of view:

I
imum value of (m + n).
Solution: (249)
m! P trailing zeros
n! P + 3 trailing zeros
1!-4! 0
It is possible when m! is multiplied by 53K,
5!-9! where K is not the multiple of 5.
So, n! = 53K x m!
10!-14! 2
n! = 125K x m!
15!-19! 3 To have minimum value of m + n, take K =1
20!-24! 4 n! = 125 x m!
} Skipping
Because, m and n are consecutive numbers
25!-29! 6
n =m +1
It is clear that every multiple of 5' will con- (m + 1}! = 125 x m!
tribute to 1 zero. Similarly, a multiple of 52 (m + 1) m! = 125 x m!
will contribute to 2 zeros. m +1 = 125
Example: 24! 4 trailing zeros = s ·4K
m=124
25! = 25 X 24! n = 125
=5 2 x24! Minimum of (m + n) = 249
 --·- ···•······--.. , ...... -._,.. • .., 1n a
Factorial Right most non-zero digit of (2" x a! x b!)
In any factorial, some 2s and 5s will produce Example 33:
zero, separate the pair of 2s and 5s that
Find the rightmost non-zero digit in 28!.
will produce trailing zeros and then find the
Solution: 4
unit digit of multiplication of the rest of the
prime numbers. This would be the rightmost 28 = 5 X 5+3
non-zero digit of the factorial. Right most non-zero digit in 28!
For example :
= Right most non-zero digit of (2 5 x 5! x 3!)
6! = 6 X 5 X 4 X 3 X 2 X 1 = (32 X 120 X 6) = (2 X 2 X 6) = 4
= (2 X 3) X 5 X (2 X 2) X 3 X 2 • For any large value of N , to reduce the
= (3 x 2 x 2 x 3 x 2) steps of the calculation, one can also use
the following method.
u u N = 25a + b
(This will produce (Unit digit of this
Trailing zeros) Rightmost non-zero digit of N! = Right
would be right most
most non-zero digit of (4° x a! x b!).
non-zero digit)
Example 34:
6! Unit digit of (3 x 2 x 2 x 3 x 2)
Find the right most non-zero digit in 81!.
2 = Right most non-zero digit of 6!
Solution: a
Let's try with some bigger number.
81 = 25 X 3 + 6
15! = 1 X 2 X 3 X 4 X 5 X 6 X 7 X 8 X 9 X 10 X

11 X 12 X 13 X 14 X 15 = Right most non-zero digit of (43 x 3! x 6!)

= 2 11 X 36 X 53 X 72 X 11 X 13 = (4 X 6 X 2) = 8

= (2 8 x 3 6 x 7 2 x 11 x 13)
u
Unit digit of this Trailing zeros
would be right most
non-zero digit
 Practice Exercise - 1

Level of Difficulty - 1 (A) 2

(8)3
1. The highest power of 7 that completely
(C) 4
divides 2200! is
(0)1
2. A six-digit number of the form ' PQRPQR'
7. The product of four consecutive prime
will always be divisible by:
numbers is 4391633. Find the average of
(A) 77 the first and the fourth prime number.
(B) 91
(C) 143 8. Highest power of 5 in 111 x 112 x 113 x
(0) All of the above .................. 998 X 999 is:

3. A, 8, and Care defined as follows: (A) 246

(B) 236
A= (1.000002) + [(1.000002)' + (4.000008)] (C) 220
(D) Cannot be determined
B = (2.000004) + [(2.000004)' + (8.000016)]
9. How many natural numbers are there be-
C = (3.000003) + [(3.000003)' + (9.000009)]
tween 1 and 3149, which when divided by
Which of the following is true about the 3, 5, 7, and 9 gives remainders as 2, 4, 6,
value of the above three expressions? and 8, respectively?
(A) A is the smallest (A) 9
(B) 10
(B) A is twice of C
(C) C is the smallest (C)11
(D) B is the smallest
(0)12

32 10. N! is completely divisible by 11 55 • What

4. Find the product of all the factors of 5 •
is the sum of the digits of the smallest
(A) 51os6
such as number N?
(B) 5 s2s
(A) 10
(C) 526• (B) 11
(D) 5 320 (C) 12
(0)13
5. x, y, and z are positive integers such that
X +y + Z = 2021.
Level of Difficulty - 3
Lets= (-1)' + (-1 )' + (-1)' . Find the num-
ber of possible values of s:
11. If the LCM of two positive integers (N1,
N ) where N 1 < N 2 is 30 times the HCF,
(A) 2 2
which of the following is not a possible
(B) 4
(C) 1 value of !'!i?
N,
(0) 3
(A) 7 . 7
Level of Difficulty - 2
(8)3.3
6. What is the number of ordered pairs of (C) 1.2
positive integers a and b that satisfy the (0) 7.5
condition ab = a + b + 16?

m ff.d·MJW#i
12. How many values can natural number N 14. N is a 10-digit number and multiple of 24.
take if N! is a multiple of 2 26 but not 326? lf its digits are distinct, find the second
(A) 24 largest value of N .
(B) 23
(C) 22 15. Among the first 100 natural numbers,
(D) 18 how many numbers can be expressed
as a difference between two perfect
13. Find the number of pairs (x, y) which sat- squares in at least one way?
isfy HCF (x, y) + LCM (x, y) = 85. (A) 25
(A) 4 (B) 40
(B) 5 (C) 50
(C) 6 (0)75
(D) 8
 Solutions

1. 364 Or
The highest power of 7 completely di- Two numbers will be even , and one num-
vides 2200! ber will be odd.
Therefore, the possible values of s if all
2200 2200 2200
= --+--+-- the three numbers will be odd.
7 72 7l
Then 's' = (-1)"'" + (-1)""' + (-1)"'"
2200 2200 2200 Then = -1 - 1 -1 = -3
= - - +--+--
7 49 343 's' =-3
= 314 + 44 + 6
Again , if two numbers are odd and one
= 364
number is even then:
2. (D)
's ' = (-1)""' + (-1)"'" + (-1r• 0
PQRPQR = PQR x 1000 + PQR = -1 - 1 + 1
= PQR x (1000 + 1) 's' =-1
= PQR (1001)
Hence only two values are possible for 's'.
= (PQR x 7 x 11 x 13)
Option (A) is the correct answer.
So, PQRPQR is divisible by all of (77 = 11 x 7), 6 . (A)
(91 = 13 x 7) and (143 = 11 x 13).
Since it is given in the question that 'a'
Hence, option (D) is the correct answer.
and ' b' are positive integers.
3. (D) ab= a+ b + 16
Assume K = 1.00002 ab - a - b = 16
K 1 1 => a(b - 1) - b + 1 = 16 + 1
K2 + 4K K + 4 5.000002 => a(b - 1) -1(b - 1) = 17
Assume 2.00004 = L => (a - 1) (b - 1) = 17
L 1 1 Here the product of two numbers is prime
(17), which is possible only when one of
L2 + 4L L +4 6.000004
the numbers is 1, and the other is 17.
Similarly, C = 6 .00~00 3 So, two cases will be possible when a = 18
and b = 2 and a = 2 and b = 18
B is the smallest.
(a, b) = (2, 18) and (18, 2)
Hence, option (D) is the correct answer. Hence only two ordered pairs of positive
4.(B) integers are possible that satisfy the giv-
The factors of 532 are 5°, 51, 52, 53 .. .. . ........... 532 en condition.
Product of all the factors Hence, option (A) is the correct answer.
= (5") x (5') x (5') ............ . ... x(5" ) 7.47
= ........ 32)
Since prime numbers are consecutive,
= 5(32;]3 ) = 5l6x]J = 5s28 then for simplicity, we may take them
equally.
Hence, option (B) is the correct answer.
Then, a"' = 4391633
5.(A)
For approximation, we may take
Since the given equation is x + y + z = 2021. 4391633 • 4000000
There are two possibilities to get x + y + z Then, a2 == 2000
= odd. Now, we know 40 2 = 1600 and 50 2 = 2500
First one, if we take all the three num- Then , a== 45
bers (x, y, z), all are odd in nature.

w7 JMM.IJLWJMI
 Now, check prime numbers near 45. So, for K = 9, the number = 315 x 9 -
We have 37, 41, 43, 47, 53, 59 1 = 2,835 - 1 = 2 ,834 would be the last
with the help of unit digits, we can easily number.
conclude that prime numbers are: 41, 43, 47, 53.
Hence, option (A) is the correct answer.
41 53
Now, the required average = + = 47 10. (C}
2
Hence, 47 is the correct answer. The number needs to be less than 11 x 55
8.(C) = 605. The highest power of 11 in 605! = 60.
111 x 112 x 113 x ...••...... 998 x 999 The power of 11 is the smallest such num-
ber needs to be exactly 55. lfwe subtract
(1x 2 )( 3 X 4 .... 110 ) X (111 X 112 X 11J x 998 X 999) 11x 5 = 55 from 605, we will get 550.
- (1 x 2 x 3 x 4 ......... 110) The highest power of 11 in 550! = 54. So,
need to increase 550 by another 11 , that
(1 x 2 x 3 x 4 .... 110) x (111 x 112 x 113 >< 998 >< 999) _ 999! is 561.
(1x 2 x 3 ><4 ......... 110) - 110!
In 561! the highest power of 11 will be ex-
So, the highest power of 5 in 111 x 112 x actly 55 as per our requirement.
113 .......... 99B x 999 is the same as the Hence, the minimum value of N is 561.
Sum of the digits of the smallest value of
999 1
highest power of 5 in . N = 5 + 6 + 1 = 12.
110!
The highest power of 5 in 999! Hence, option (A) is the correct answer.

= [9:9] [9:,9] [9:,9 ] [9:.9 ]

+ + +
11. (A}
Since LCM = 30 x HCF (Given)
Let HCF = m
= 199 + 39 + 7 + 1 = 246
N, = ma and N2 = mb
Where (x] , represent greatest integer of x.
Also, we know that :
Similarly, the highest power of 5 in 110!

l ~?l
N 1 >< N 2 = HCF x LCM
10 mo x mb = m x 30 x m
=[ ~ + [ = 22 + 4 = 26
ab= 30
Also, o < b (Given in the question)
Hence, the highest power of 5 in 9991
110! Therefore, o x b = 30
= 5 2•6 = 5 220 (1. 30), (2 , 15), (3, 10). (5, 6)
5"
Hence, option (C) is the correct answer.
9. (A) All the 4 pairs are co•prime in nature.

Here, the difference between divisors

and the remainders is fixed , and it is 1, For (a. b) = (1 , 30) :, "!i = mb = = 30
so the number would be of the form LCM N, ma 1
[(3, 5. 7, and 9) K] - 1 = 315K - 1, where K
is a natural number. For (a , b) = (2 , 15) => "!i = ~ = 7.5
N, 2
Now for K = 1, the number would be 314
For K = 2, the number would be 629 and For (a, b) = (3 , 10) => "!i = ~ = 3.3
so on till K = 10, for which the number N, 3
would be 3149.
Now we need to take numbers between 1 For (a , b) = (5, 6) :, =~ = 1.2
and 3149, so we can't take 3149. N, 5

iMfli.:U&JMI
 :. 7. 7, option (A) is not a possible value => 17 (1 + pq) = 85
1 +pq=5
of!!l.. pq = 4
N, Possible values of p and q : (1 , 4)
Hence, option (A) is the correct answer. The total number of possib le values of
12.(A) (x,y) = 6.
Hence, option (C) is the correct answer.
we first need to find , by trial and error
method, the minimum value of N! which 14. 9,87,65,41,320
divides 2 26 • As we know
If N = 10 10! is divisible by 2 1 A number divisible by 24 would be divis-
N = 20 20! is divisible by 2 11 ible by both 3 and 8.
N = 25 25! is divisible by 2 22 DlvlalblUty rule of 3: The sum of digits
N = 30 30! is divisible by 2 21 must be divisible by 3
Now 30! = 221 x 314 x
DlvlslbiUty rule of 8: Last three digits
So 30! is the minimum number that di-
must be divisible by 8
vides 2 26 but not 3 21 • The largest number with all distinct dig-
So, 30! 31! 32! ......... up to 53!. its would be 9,87,65,43,210, where the
There will be 24 possible numbers that sum of its digits would be equal to 45
divide 2 26 but not 3 26• (always divisible by 3), so we must take
As 53! = 2 49 x 3 23 x .....
care of the last three digits.
whereas 54! = 2 50 x 3 26 x ...... , which is di- 9 ,87,65 ,43,210
visible by both 2 26 and 3 21· so not required. The last three digits can be arranged as
Hence, option (A) is the correct answer. 012, 021 , 102, 120, 201 , and 210. Only 120
13.(C) is divisible by 8 . So, the largest number
Let x = Kp, y = Kq where o and b are would be 9,87,65,43,120.
Co-prime. For the second-largest number, we would
HCF (x. y) = K play with 0, 1, and 3 (we should choose
LCM = (x, y) = Kpq the lowest possible three digits to keep
According to question: the Number N largest possible). The pos-
K + Kpq = 85 sibilities are 013, 031, 103, 130, 301 , 310.
=> K(1 + pq) = 85 None are divisible by 8.
Possible option are 1 x 85 or 5 x 17 Let's play with 0, 2, and 3 now. The pos-
Case 1: When HCF = 1 sibilities are 023, 032, 203, 230, 302,
and 320. Only 320 is divisible by 8. So,
=> 1 (1 + pq) = 85
=> pq= 84 the second-largest number would be
9,87,65,41,320.
There can be many combinations such
that pq = 84. But we need to select 15. (D)
where p and q are co-prime. As we have to take the difference be-
So. when HCF = 1. (p, q) can be (1, 84); (4, 21); tween two perfect squares, we can have
(12, 7), and (28, 3). three possibilities.
ca.. 2: When HCF = 5 1. Both the perfect squares are of odd
=> 5(1 + pq) = 85 numbers.
1+pq=17 2. Both the perfect squares are of even
=> pq = 16 numbers.
3. One perfect square is of an odd num-
Co-prime p and q can take values: (1, 16)
ber, and the other is of an even number.
Case 3: When HCF = 17
CaH 1: (odd number,) 2 - (odd number )2
a)Zj 2
 (odd number1 + odd number,) (odd In every set of four consecutive num-
number1 - odd number 2) bers, starting from 1, there will be three
even number x even number numbers which can be expressed as the
= multiple of 4, i.e., 4k ...(i) difference between two perfect squares,
Cue 2: (even numberl - (even number 2)2 or there will be only one number which
(even number, + even number2 ) (even cannot be expressed as the difference
number, - even number 2) between two perfect square numbers.
= even number x even number Therefore, in the set of the first 100 nat-
= multiple of 4. i.e., 4l ...(ii) ural numbers, numbers which cannot
Caae 3: (odd number) 2 - (even number)2 be expressed as the difference between
= (odd number - even number) (odd two perfect squares = ¾x 100 =25.
number+ even number)
= Odd number x odd number Therefore, a number which can be ex-
= odd number ... (iii) pressed as the difference of two perfect
From equations (i), (ii), and (iii), we can =
squares 100 - 25 75.=
conclude that in the set of the first 100 Hence, option (D) is correct.
natural numbers, all the even numbers
which are not the multiple of 4 cannot
be expressed as a difference between
two perfect square numbers.
Or in other words:
 Practice Exercise - 2
Level of Difficulty - 1 7. lf15 < x < 2650, then for how many values
of x, is the square of a prime number?
1. For how many prime numbers ' P' will '37'
+ 7'be a multiple of P? (A) 10
(A) 2 (B) 9
(B) 4 (C) 7
(C) 6 (D) 6
(D) 1
a. If N= 0.a1a2a3a2a3a2a3 .................... Find
2. For N = 212 x 3 9 x 510 x r . Find the factors which of the following must be multi-
of N that are multiple of 360 but not of plied with N such that multiplication give
420. an integral value.
(A) 1,400 (A) 900
(B) 900 (B) 1,287
(C) 700 (C) 1,800
(D) 1,200 (D) 2,970
32 9. How many natural numbers from 1 to 50
3. 00! is completely divisible by P, where
p' are there which have at least 2 and max-
P is a prime number. For how many val- imum 3 factors?
ues of P is this possible? (A) 4
(A) 16 (B) 12
(B) 8 (C) 15
(C) 15 (D) 19
(D) 11
10. What can be the maximum value of HCF
4. N = 2 35 x 3·0 • How many factors of N2 are (x, y) where x + y = 990? x and y are dis-
less than N but does not divide N? tinct integers?
(A) 2,936 (A) 495
(B) 1,435 (B) 330
(C) 1,570 (C) 165
(D) 1,511 (D) 110
5. Find the highest power of 96 in 72!.
(A) 34 Level of Difficulty - 2
(B) 17
11. What is the sum of the even factors of
(C) 13
144 and the odd factors of 2,400?
(D) None of these
12. Ravi was asked to add the numbers from
6. If N = 3x 3 + 6x2 + 5x + 36, then for how
1 to n and report the Sum to his teacher.
many values of x, N is completely divisi-
He gave the answer as 1020. The teach-
ble by x?
er noted that Ravi missed adding a few
(A) 6
numbers between 1 and n, excluding 1
(B) 8
and n. If n = 45, what was the maximum
(C) 9 number of numbers Ravi could have
(D) 12
missed?

SNM4.IJLWJf!I
 {A) 3 19. The sum of two natural numbers and
{B) 4 their LCM is 89. How many such pairs of
(C) 8 numbers are there?
(0) 5 (A) 6
(B) 5
13. The sum of the squares of the two inte-
(C) 4
gers, X and Y, is less than the square of
(0)3
the sum of these two integers by 200.
How many pairs of integers, X and Y, sat- 20. Find the number of factors of 2 6 x 5 9 x 12 3
isfy this condition? that are perfect squares.
(A) 6
{B) 8 Level of Difficulty - 3
{C) 10
(0)12 21. A natural number N has k distinct prime
factors. If the total number of factors of
14. If x = 30 12, how many factors of x will have
N is 72, then what is the product of all
at least one 'O' at the end?
the possible values of k?
15. For how many natural numbers N be- 22. A positive integer is equal to the square
low 150, (n - 1)! will not be divisible
of its number of factors. How many such
by n? integers are there?
(A) 45 (A) 3
(B) 35
(B) 4
(C) 40
(C) 2
(0) 38
(0) 5
16. N = 1 x 1! + 2 x 2! + 3 x 3! + ... + 17 x 17!,
23. N is a natural number which has four
then find the remainder of 19 (N + )1
7 factors. If 10 s N s 65, then how many
19! R values are possible for N?
(A) 1 (A) 12
{B) 7 (8) 15
(C) 19 (C) 13
(0) 19
{0)114
24. How many values of A exist such that all
z are 26
17. Given that A, B, C, D .. X, Y, and
among A, B, and (B - A) are prime and
consecutive natural numbers such that
both A and B are less than 100?
(A + B + C + D + .•. + X + y + Z) 2 = A J + 8 3 + (A) 9
3 3
C + 0 + ...)(3 +Y3 + Z3. Find the number of (B) 8
zeros at the end of product (A x 8 x c x D (C)7
••• X y X Z). (0) 5

18. There is a number X2 that has 21 fac- 25. The product of all the factors of a posi-
tors. Find the number of factors x can tive integer P is equal to P2 • The Sum of
have. all the factors of P excluding P is 20. P
(A) 12 or B lies between
(B) 11 or B (A) o and 20
{C) 10 or6 (B) 20 and 40
(0) 12 or 6 (C) 40 and 60
(0) 60 and BO