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
Irrational Numbers
questions come from this chapter every year,
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:
3
Prime number, 5 , etc.
Classification of Numbers
Keynote

22
y Actual value of   . It is just ap-
7
proximated for calculation purpose.
y Any recurring decimal that form a
fixed pattern is a rational number
and hence can be expressed in p
q
form.
Examples : 3.43333………….
0.55555………….
1.27777………….
y Only non-terminating and non-re-
curring decimals are irrational num-
bers, rest in all cases it is rational.

Real Numbers 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. 7
Solution: K =
9
Examples: K = 0.7777 ...(i)
2, 3, 7.54, –3.47, 5 , 23 , etc. Multiply both side by 10 in equation (i)
10K = 7.7777 ...(ii)
Subtracting equation (i) from equation (ii), we
get 9K = 7
7
K =
9

Numbers – Part 1 133

 Example 2: Solution: 4
Convert K = 1.233333 … in p/q form: XYZ 23
0.XYZXYZXYZ = 0 . =
XYZ =
111 37 999 27
Solution: K = = 23  999
90 30 Þ XYZ =  851
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)
y 0 is neither positive nor negative
Subtracting equation (i) from equation (ii), we integer.
get 90K = 111 y Mind here if in any question it is
111 37 asked to take non-negative inte-
Therefore, =
K =
90 30 gers one need to consider zero as
well as positive integers. Similarly,
Short Trick 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. a1a2a1a2a1a2…, 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
Step 3 : For denominator, write as Solution: (D)
many 9’s as the number of digits re- N = 0. a1a2a1a2a1a2…,
peating itself followed by 0’s as many Or, N = 0. a1a2
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
p
of
q
a a
1, 416 118 Hence, N = 1 2
Hence, 1=
.573 = 99
900 75
To make N an 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
Integers
3, 053  30 3, 023
Using trick: 3.053   Integers are numbers that are not fractions.
990 990
Example 4: Integers are of three types:
23 1. Positive integers: 1, 2, 3, 4, 5, …
If 0.XYZXYZXYZ… = , find (X + Z – Y)
27
134 Numbers – Part 1
2. Negative integers: –1, –2, –3, –4, … Solution: (D)
3. Zero (A) (a  b)2  c
 
Fractions (no need 
to check )
Even
A fraction represents the part or portion of
(Since an even number multiplied by any
a whole thing. It can be categorised in three
number always results in an even number).
categories:
Any number × Even Þ Even
1. Proper fraction: When the numerator is
(B) a2 + c2 – b2
less than the denominator. For example,
2/3, 5/7, 11/15, etc. ¯ ¯ ¯
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 (a 
+b+ c) ´ ( a - b )
combination of natural number and a frac- (C) (no need
¯ ¯

3 1 2 to check ) Odd Odd

tional part. For example, 2 , 3 , 1 , etc.
5 2 7 Any number × Even Þ Even
Integers can be further classified into two (D) a2 (b + c)
important categories
¯ ¯ ¯
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 × (Odd + Even) Þ Odd × Odd Þ Odd
called as even numbers. For example, 0, Hence, option (D) is correct.
2, 4, 6, –10, 12, etc. Integers can also be classified as
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 Properties of Even and Odd 3, 4, 5, …
Numbers Natural numbers can be classified into three
y Zero is an even number categories
y Even × any whole number = Even Prime number, composite number, and 1.
y Odd × Odd = Odd
y Even + Even = Even 1. Prime Number: Natural numbers having
y Even + Odd = Odd exactly two distinct factors are called
y Odd + Odd = Even prime. For example, 2, 3, 5, 7, 11, …
y (Even)N = Even; where N is a natural number a) All prime numbers are only divisible by
y (Odd)N = Odd; where N is a natural number one or by itself.
Example 6: b) Every 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 even integer. Which of the fol-
but vice versa is not always true.
lowing is necessarily odd?
13 = 6 × 2 + 1 → Prime
(A) (a + b)2 × c (B)­  a2 + c2 – b2 29 = 6 × 5 – 1 → Prime
(C) (a + b + c) (a – b) (D) a2 (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.
For example, 237,896 is divisible by 4 be-
Keynote cause 96 is divisible by 4.
125 = 53. Check if the last three digits of a
y 1 is neither prime nor composite. number are divisible by 125.
y 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
y 3, 5, 7 is the only triplet of prime
not, find the remainder.
number which are at a difference
Solution: 0
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 is 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 23 = 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 = 0 and Y = 0;
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 = 0 and Y = 2; 502 is not divisible by 8.
8), (11, 15) etc., are Co-prime pairs.
Put X = 0 and Y = 3; 503 is not divisible by 8.
It is not necessary for both the numbers
Put X = 0 and Y = 4; 504 is divisible by 8.
to be prime in Co-prime pairs.
Next numbers divisible by 8 would be at dif-
Divisibility Rules ference of 8.
The rule for 2n or 5n type numbers: So, the possible values of XY are = {04, 12,
20, 28, 36, 44, 52, 60, 68, 76, 84, 92}
The last n digits of the number should be
divisible by 2n or 5n 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.

136 Numbers – Part 1

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
divisible by 72.
Digital sum
Example 9:
Digital sum is the sum of digits of the num-
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
→1+3=4
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 0 or 5 (since b
Rule for 11 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 0 or 5). But,
if we take b = 5 number becomes odd, and it
at odd places and the sum of digits at even
would not be divisible by 8.
places is 0 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.
Put, a = 2 → 320 is divisible by 8.
Example: Check 1253478
Next number would be 320 + 40 = 360.
+ – + – + – +
So, there are two values of a = {2, 6}
1 2 5 3 4 7 8
Hence, a + b can be either 2 + 0 = 2 or 6 + 0 = 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 7, 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,001 = 7 × 11 × 13
The divisibility rules of composite numbers Remainder [103/1,001] = –1
are: Also, Remainder [103/7] = –1,
1. Select Co-prime factors of the compos- Remainder [106/7] = 1
ite number. Remainder [109/7] = –1; and, so on.
2. Product of these Co-prime factors The same result we get in the case of 11 and 13 also.
should equal the composite number.

Numbers – Part 1 137

 To check the divisibility of any large number a) N (q1 b) q1 (q2 c ) q2 (q3
by 7, 11, or 13 or to find the remainder, make  
r1 r2 r3
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 = aq1 + r1   q1 = bq2+ r2  q2 = cq3 + r3
then take their difference. If this difference Let q3 = 0 Þ q2 = r3
is divisible by 7 or 11 or by 13, then the original q1 = bq2 + r2
number would be divisible by 7 or 11 or by 13.
As q2 = r3 so, q1 = br3 + r2
For example: Check the divisibility of Also we know that
10,573,240,035 by 7. N = aq1 + r1 and q1 = br3 + r2
   
So, N = a(br3 + r2) + r1
Þ 10 | 573 | 240 | 035 (Make pairs from
or, N = abr3 + ar2 + 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.
Example 10:
Find the remainder when 151,152,153……….
199,200 is divisible by 13.
Solution: 12
From 151 to 200, there are 50 three-digit Create two columns of divisor and re-
numbers. mainder. Start from last row of sec-
ond column, go diagonally up and
multiply (br3) then add horizontally
Þ (br3 + r2) again go diagonally upward
multiply {a (br3 + r2)} then add hori-
zontally {a(br3 + r2) + r1}.
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
times.   25 on successive division by 5, 8, and 9 leaves
 25  remainder of 2, 3, and 4, respectively?
Rem    12
 13  Solution: 3

Successive Division
In successive divisions, the quotient ob-
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-
dend for the third division and so on. General form of the number is LCM (5, 8, 9) K
+ 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
obtained are r1, r2, and r3, respectively. The desired three-digit numbers = 177, 537,
and 897 for K = 0, 1, and 2, respectively.

138 Numbers – Part 1

Hence, three such numbers are possible. In general, the prime factorisation of a num-
Example 12: ber N is represented as :
A number is successively divided by 5, 7, and N = pa × qb × rc (where p, q, and r are the
11 and leaves the remainder 1, 3, and 5, re- prime numbers and a, b, and c are whole
spectively. Find the respective remainders numbers).
when the order of division is reversed. Finding Number of Factors
Solution: 2 36 = 6 × 6 = 22 × 32
        ¯    ¯
 20   30 
 1  1
          
2  3 
 2  2
2  3 
   
        ¯   ¯
The required number is LCM (5, 7, 11)K + 191
where K is a whole number = 385K + 191.       3 ways 3 ways
The least value of the number is obtained Total = 3 × 3 = 9 factors.
for K = 0, i.e., 191. If N = pa × qb × rc
When the order of divisor is changed, Numbers of factors of N
= (a + 1) × (b + 1) × (c + 1)

Hence, the respective remainder when the Keynote

number is successively divided by 11, 7, and
5 are 4, 3, and 2. y Number of factors of any perfect
square is always odd.
Factor Theory y 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 Factors
completely. Even Factors:
Factors are the divisors of the given number. 1,800 = 18 × 100 = 2 × 32 × 102 = 2 × 32 × 22 × 52
Example: Factors of 12 → 1, 2, 3, 4, 6, 12 = 23 × 32 × 52
Factors of 56 → 1, 2, 4, 7, 8, 14, 28, 56. ¯ ¯ ¯
Prime Factorisation 2 
1 æ3 ö0 5 
0
According to the fundamental theorem of  2 ç 1÷  1
arithmetic, every natural number (except 1) 2  ç3 ÷ 5 
 3 ç 2÷  2
can be represented as the product of one or 2  ç3 ÷ 5 
 
 è 
ø  

more prime numbers. 3 ways 3 ways 3 ways
This process of breaking down any number
to the product of prime numbers is known Even factors = 3 × 3 × 3 = 27.
as prime factorisation. Note: One should not take 2° while calculat-
Examples : 12 = 2 × 2 × 3 = 2 × 3
2 ing even factors because 2° = 1; any combi-
60 = 6 × 10 = 22 × 3 × 5 nation with other prime numbers will give an
odd factor only.

Numbers – Part 1 139

 Odd Factors: Finding Sum of the Factors
1,800 = 2 × 3 × 5
3 2 2
Consider a number N = 23 × 32 × 54
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 ) × (3 0 + 3 1 + 3 2 ) ×
number.
Hence, while calculating the number of odd ( 5 0 + 51 + 52 + 53 + 54)
factors, one should neglect 2 from the prime Now, the given expression is in G.P. and we
factorisation. know that:
1,800 = 23 × 32 × 52 a(r n  1)
Sum of G.P. = ,r1
¯ ¯ ¯ (r  1)
 30   50  Where a → first term
 1  1
 
20  3 
 2
5 
 2
r → common ratio
3  5  and n → number of terms
   
The number of odd factors = 1 × 3 × 3 = 9 2°(24 - 1) 3°(33 - 1) 5°(55 - 1)
Therefore, ´ ´
(2 - 1) (3 - 1) (5 - 1)
Number of Perfect Squares and Perfect = 15 × 13 × 781 = 152,295
Cube Factors
Note: If any number say N can be expressed
For perfect square factors, only consider the as N = ap × bq × cr ×...,
multiple of 2 as power of a prime number.
where a, b, and c are prime factors and p, q,
For example : and r are whole numbers.
N= 25 × 37 × 73
Sum of all factors (or divisors) of N

¯ ¯ ¯
 30  (a p 1  1)(bq  1  1)(c r  1  1)
=  ......
 20   2 (a  1)(b  1)(c  1)
 2 3   70 
 2   4   2 
7  Finding the Product of the Factors
 4
2  3   
   36  Let’s take a small number and understand the
 
concept behind finding the product of factors
¯ ¯ ¯ of a natural number N.
3 ways 4 ways 2 ways
20 = 1, 2, 4, 5, 10, 20
Number of perfect square factors of N
= 3 × 4 × 2 = 24 Product of factors =
For a perfect cube, only consider the multi-
ple of 3 as power of a prime numbers. = (1 × 20) (2 × 10) (4 × 5)
For example : = 20 × 20 × 20 = 203
N = 25 × 37 × 73
Observe here, 20 has 6 factors, which can be
¯ ¯ ¯
paired in 3 ways.
3 
0
 20   3  70  So, it can be generalised that
 3   3   3
2   6 7  æ no. of factors ö
  3    çç
2
÷÷
  Product of factors of N = N è ø

¯ ¯ ¯ In case of perfect square numbers, let N = pa

2 ways 3 ways 2 ways x qb x rc where each of a, b, c is even.
Number of perfect cube factors of N There are (a + 1)(b + 1)(c + 1) say d factors.
= 2 × 3 × 2 = 12

140 Numbers – Part 1

There are (a + 1)(b + 1)(c + 1) say d factors. In how many ways a number can be written
We can form (d - 1)/2 pairs and we would be left as the product of its two Co-prime factors?
with one lone factor, i.e., N . The product of all Let’s see for 48
these factors is N(d-1)/2 x square root (N) = N(d/2). 48 = 16 × 3 = 24 × 31
Whether or not N is a perfect square, the Writing 48 as the product of its two Co-
product of all its factors is N(d/2) where d is prime factors.
the number of factors of N.
48 = ( 1, 24 ´ 3) Þ ( 1 , 48)üï
In how many ways a number can be written ý 2 ways
= (3, 24 ) Þ (3, 16) þï
as the product of its two factors?
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
40 = ( 1 ´ 40) ü Co-prime factors = 2(p – 1)
ï
= (2 ´ 20)ï where, p is a number of prime factors.
ý 4 ways
= (4 ´ 10) ï Example : 120 = 12 × 10 = 23 × 31 × 51
= (5 ´ 8) ïþ So, p = 3 {\ 3 prime numbers are used in
prime factorisation}
So, it is obvious that if a number has n num-
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 = 22 = 4
And, can manually verify also,
Total no. of ways of writing any number as product
120 = (1, 23 × 3 × 5), (3, 23 × 5), (5, 23 × 3),
Total number of factors
of its two factors = (2 3, 3 × 5).
2
Finding the Number When Its Number of
This is applicable when total number of fac-
Factors Is Given
tors is even for any number (i.e., non-perfect
square numbers). Let us understand it by an example:
If a number N has 10 factors.
When number of factors are odd i.e., for
perfect square numbers? N = P1a × P2b × P3c × ···
So, (a + 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 × 4) be determined.

So, the whole ways of writing 16 the product 10 → (1 × 10) → (a + 1) (b + 1) = 1 × 10

of two factors are 3.  a = 0, b = 9
Therefore, one can generalise : → (2 × 5) → (a + 1) (b + 1) = 2 × 5
 a = 1, b = 4
Number of ways of writing any number as the product
Hence, N = P10 × P29 (where P1 and P2 can be
 Total number of factors  1  any two distinct prime numbers)
of two distinct faactors   

 2  Or,
N = P11 × P24
Total number of ways of writing any number as the
(where P1 and P2 can be any two distinct
 Total number of factors  1 
product of two factors  
  prime numbers)
 2 
Numbers – Part 1 141
 Example 13: b) Number of perfect cube factors of N
If N has 70 factors. Find the minimum value
3
N = 25 × 34 × 56 × 72
of N. ¯ ¯ ¯ ¯
Solution: 72 5 
0
æ 20 ö æ 30 ö  3
Try to break down 70 as the product of two ç 3÷
ç2 ÷
ç 3÷
ç3 ÷
5 
 6
(7 ) 

0

numbers, three numbers, etc. è 

 ø è 
 ø 5 
 
 1 Way
70 → 1 × 70 Þ N3 = p69  Þ N = p23 2 Ways 2 Ways 
3 Ways
→ 2 × 35 Þ N3 = pq34
Total perfect cube perfect = 2 × 2 × 3 ×
(Not possible because exponents of prime 1 = 12
numbers should be multiple of 3.)
c) Factors which are multiple of 100
70 → 5 × 14 Þ N3 = p4q13 (Not possible)
N = 25 × 34 × 56 × 72
→ 7 × 10 Þ N =pq3 6 9
Þ N= pq 2 3
\ 100 = 22 × 52
→ 2 × 5 × 7 Þ N3 = pq4r6 (Not possible)
N = 22 × 52 (23 × 34 × 54 × 72)
So, N can be either p23 or p2q3 type.
So, number of factors which are multiple
For minimum value of N. of 100
Take N = p2q3 = (3 + 1) (4 + 1) (4 + 1) (2 + 1) = 4 × 5 × 5
Put, p = 3 and q = 2 (Two least prime numbers) × 3 = 300
Hence, Nmin = 32 × 23 = 9 × 8 = 72. Example 15:
Example 14: Find the number of solutions of a × b = 1980,
where a and b are natural numbers.
If N = 25 × 34 × 56 × 72. Find :
Solution: 36
a) Number of perfect square factors of N.
N = 1,980 = 198 × 10 = 22 × 32 × 5 × 11
b) Number of a perfect cube of factors
of N. Total number of factors of N
c) Number of factors of N which are multi- = (2 + 1) (2 + 1) (1 + 1) (1 + 1) = 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 36
N = 25 × 34 × 56 × 72 = = = 18
2 2
¯ ¯ ¯ ¯ \ Variables a and b are mentioned in the
æ5 ö 0
æ 20 ö æ 30 ö ç 2÷ question, so one needs to find the ordered
ç 2÷ ç 2÷ ç5 ÷ æ 70 ö solution, i.e., (a, b) and (b, a) would be
ç2 ÷ ç3 ÷ ç 4÷ ç 2÷
counted as 2 different solutions.
ç7 ÷
ç 4÷
ç2 ÷
ç 4÷
ç3 ÷ ç5 ÷ è 
 ø
è ø è  ø ç 56 ÷ Therefore, a × b = 1980 will have = 2 × 18 = 36.
   è 
 ø  2 Ways
3 Ways 3 Ways
4 Ways Example 16:
Total perfect square factors = 3 × 3 × 4 × 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.

142 Numbers – Part 1

Solution: 980
N = 5,880 = 23 × 31 × 51 × 72 Keynote
Number of factors of 5,880 = 4 × 2 × 2 × 3
= 48. y 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.
y LCM of given set of numbers is al-
Notice here, first factor × 48th factor = 1 ×
ways greater than or equal to the
5,880 = 5,880
largest number in the set.
Similarly, second factor × 47th factor = 5,880
y HCF is the factor of LCM.
and so on. Hence, it can be concluded that
the product of factors equidistant from both
Finding HCF and LCM by factorisation
ends is equal to the number itself. Therefore,
method
 Sixth factor × 43rd factor = 5,880
Factorise all the given numbers. To find HCF,
 6 × 43rd factor = 5,880 look for common prime numbers and take
5, 880 their highest common power. And to find
 43rd factor = = 980
6 LCM take all prime numbers used in prime
HCF and LCM factorisation and write their highest powers
available.
Factors are numbers that divide the giv-
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,
Prime factorise all the numbers.
and 18.
Multiples of 18 are 18, 36, 54, 72…………. 216 → 23 × 33

Highest Common Factor (HCF) 252 → 22 × 32 × 7

It is the largest number that divides the giv- 306 → 2 × 32 × 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
highest common power of 2 is 1, and the
Factors of 15 are → 1, 3, 5, 15.
highest common power of 3 is 2.
Factors of 24 are → 1, 2, 3, 6, 8, 12, 24.
HCF = 21 × 32 = 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 = 23 × 33 × 7 × 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 of 18 are → 18, 36, 54, 72, 90…………. HCF of the first 40 natural numbers is N, which
Multiples of 24 are → 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.

Numbers – Part 1 143

 {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
Take the minimum difference between any
the highest power of already used prime
two numbers.
numbers in N.
Minimum difference = 372 – 276 = 96
41 → Prime → Add
Now, start checking the factors of 96 that
42 → 2 × 3 × 7 → It will not update the N
will divide the given numbers completely.
43 → Prime → Add Use the concepts of divisibility to figure out
44 → 22 × 11 → No update in N again the value quickly.
45 → 32 × 5 → Again, no update required Check the factors in decreasing order as one
needs to find HCF here.
46 → 2 × 23 → No update
96 → 25 × 3; Factors → 96, 48, 32, 24, 16, 12
Hence, LCM of (1, 2, 3, 4, 5,…………. 46)
× × × × × √
= N × 41 × 43
So, 12 is the highest factor of 96, which di-
Example 19:
vides all the numbers completely.
LCM of (5n × 48, 250, 32 × k) is 26 × 55 × 32
Hence, 12 is required for HCF.
find maximum of (n + k).
Application Rules of HCF and LCM
Solution: 56,255
y The largest number that will divide a, b,
5n × 48 → 24 × 3 × 5n and c, is HCF (a, b, c).
250 → 2 × 53 y The largest number that will divide a, b,
32K→ 25 × K and c leaving the remainder of x, y, and z,
\ LCM includes all the prime numbers respectively, is HCF (a – x, b – y, c – z).
y 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 (a – b, b – c, c – a).
Hence, the maximum value of n can be 5 y The smallest number which is exactly divis-
here. ible by a, b, and c is LCM (a, b, c).
To maximise K, it can be taken as K = 2 × 32 × 55 y The smallest number, when divided by a,
b, and c, leaves the same remainder r in
= 56,250
each case is [LCM (a, b, c) + r].
So, number 32K = 26 × 32 × 55 (which is y 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:
Finding 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
numbers. The least number which is divisible by 9, 15,
18, and 30 is LCM of (9, 15, 18, 30) = 90.

144 Numbers – Part 1

The general form of all such numbers = 90 K. Capacity of each can = 8 L
40 72 88
As in the question, it says that number Number of cans required = + +
8 8 8
leaves a remainder of 4 on dividing by 9, 15,
= 5 + 9 + 11 = 25
18, and 30. So, required number = 90 K + 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. y If two numbers are given m and n, then m
Put K = 1, 90 × 1 + 4 = 94 → Not divisible by 8. × n = HCF × LCM.
Put K = 2, 90 × 2 + 4 = 184 → Divisible by 8. y 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: y HCF of fractions = HCF of numerators/
LCM of denominators.
On dividing a certain number by 8, 10, and 12,
y LCM of fractions = LCM of numerators/
the remainders obtained are 2, 4, and 6, re-
HCF of denominators.
spectively. Find the largest three-digit num-
y HCF of (xp – 1, xq – 1) = xHCF(p, q) – 1.
ber satisfying this condition.
Example 24:
Solution: 954
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)
Let’s take the numbers 9a and 9b where a
K–6
and b are Co-prime, i.e., HCF (a, b) = 1
= 120K – 6
Þ 9a × 9b = 6,480 Þ ab = 80 Þ ab = 24 × 51
Largest three-digit number can be obtained
at K = 8 The number of ways of writing a number as
the product of its two Co-prime factors =
Þ 120 × 8 – 6 = 960 – 6 = 954
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 = 22–1 = 21 = 2
tendant wants to pack them in cans so that a × 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:
The sum of the two numbers is 121, and their
Solution: 25
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,
Solution: 5
first out the maximum capacity of cans that
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 Þ a + b = 11

Numbers – Part 1 145

 (a, b) º (1, 10), (2, 9), (3, 8), (4, 7), (5, 6) To find highest power of 3 take all multiples
So, total five pairs of numbers are possible. of 3 in 12! and neglect rest of the number.
12! = 3 × 6 × 9 × 12 × K
Note : One can also use Euler number to
find number of co-prime pairs. Number of = 3 × (3 × 2) × (3 × 3) × (3 × 4) × K
ways of writing N as sum of two co-prime = 35 × K1
numbers Hence, highest power of 3 in 12! is 5.
1 The question can also be asked to find the
= (Euler number of N )
2 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 × 11 × 13
So, a and b can have only these three prime Example: Find the highest power of 3 in 25!
numbers with their highest power as 1. So,  25 
  8
different possibilities are:  3 Quotient
(a, b) → (3 × 11 × 13, 1) = (429, 1) 8
  2
→ (3 × 11 × 13, 3) = (429, 3)  3 Quotient
→ (3 × 11 × 13, 11) = (429, 11)
Hence, highest power of 3 in 25! = 8 + 2 = 10.
→ (3 × 11 × 13, 13) = (429, 13)
Note: This method is applicable only for
and, so on…………. prime numbers.
But to maximise sum of digits of b
Finding the Highest Power of Composite
(a, b) → (3 × 11 × 13, 3 × 13) = (429, 39) Numbers in any Factorial
Or, To find out the highest power of composite
→ (11 × 13, 3 × 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 of 15 divides 50! completely?
N! = N × (N – 1) × (N – 2) × ··· × 3 × 2 × 1
For example, 6! = 6 × 5 × 4 × 3 × 2 × 1 Solution: 12
15 = 3 × 5
Note : 0! = 1
Power of 3 in 50!
Finding Highest Power of a Prime in any
Factorial 50 16 5
= 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 × 12 50 10
= 10 =, 2
5 5
= 10 + 2 = 12

146 Numbers – Part 1

So, 50! = 322 × 512 × K Any factorial from 30 to 34 will have the
= (3 × 5)12 × 310 × K same number of 5s.
= 1512 × K1 So, let’s check for 30!
Therefore, the highest power of 15 that will 30 6
= 6= , 1
divide 5! completely is 12. 5 5
So, 30! is a multiple of 57 and hence any fac-
Important observation
torial greater than 29 would be a multiple
It can be observed from the above example of 57.
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.
35
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 75.
150 ! Accorting to the question, N! should be a
For what maximum value of N, is an
63N multiple of 57 but not 75.
integer?
Hence, N can be 30, 31, 32, and 34.
Solution: 24
Therefore, 4 values of N can hold.
63 = 32 × 7
Highest power of 3 in 150! Finding the Number of Trailing Zeros in a
150 50 16 5 Factorial
= 50 = , 16,= 5= , 1
3 3 3 3 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 21
= 21 =, 3 The number of pairs of 5 and 2 available in
7 7
= 21 + 3 = 24 any factorial will decide the number of trail-
ing zeros.
150! = 372 × 724 × K
\ Factorial is a regular series of numbers.
= 348 × 724× 324 × K
It can be witnessed that in any factorial
= (32 × 7)24 × 324 × K
Number of 2s > Number of 5s
150! = 6324 × K1
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, Nmax = 24
required; hence, the power of 5 would be
Example 29: the deciding factor, i.e., the number of 5’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 , N should be
7
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!

Numbers – Part 1 147

 67 13 = 5 2 × 5 4K
 13, 2
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 = 510K
Find trailing zeros in 89! + 88!.  45 9 
  9,  1
Solution: 21  5 5 
89! + 88! = 89 × 88! + 88! 50! = 50 × 49!

= 88! (89 + 1) = 2 × 52 × 49!

= 88! × 90 = 2 × 52 × 510K = 512K1

Trailing zeros in 88! is 50! → 12 trailing zeros

88 17 50! → 54! → 12 trailing zeros.
 17, 3
5 5 So, there is no factorial which has 11 trailing
 17  3  20 zeros.
So, trailing zeros in 89! × 90 y Let’s generalize this concept :
¯ ¯ If N ! ® P Trailing zeros
20 zeros 1 zero Q
then, 5 ´ N ! ® (P + Q) Trailing zeros
= 20 + 1 = 21
Example 32:
Skipping Zeros Concept in Factorials If m and n are two consecutive natural num-
bers, the difference between the number of
Let’s observe the behaviour of factorial from
trailing zeros of n! and m! is 3. Find the min-
the trailing zero’s point of view :
imum value of (m + n).
Factorials Number Solution: (249)
of trailing m! → P trailing zeros
zeros
n! → P + 3 trailing zeros
1!—4! → 0 It is possible when m! is multiplied by 53K,
5!—9! → 1 where K is not the multiple of 5.
So, n! = 53K × m!
10!—14! → 2
n! = 125K × m!
15!—19! → 3 To have minimum value of m + n, take K = 1
20!—24! → 4 n! = 125 × 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 × m!
tribute to 1 zero. Similarly, a multiple of 52  (m + 1) m! = 125 × m!
will contribute to 2 zeros.  m + 1 = 125
Example: 24! → 4 trailing zeros = 54K m = 124
25! = 25 × 24! n = 125
= 52 × 24! Minimum of (m + n) = 249

148 Numbers – Part 1

 Keynote Unit digit of (28 × 36 × 72 × 11 × 13)
= (256 × 729 × 49 × 11 × 13)
y Numbers which are equal to the = (6 × 9 × 9 × 1 × 3) = 8
sum of factorials of their digits are
Hence, right most non-zero digit of 15! is 8.
1, 2, 145, and 40,585.
y Numbers for which N! has N digits Alternate method:
are 1, 22, 23, and 24. To find the rightmost non-zero digit of N!
N = 5a + b
Finding the Rightmost Non-Zero Digit in a
Factorial Þ Right most non-zero digit of (2a × a! × 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
28 = 5 × 5 + 3
prime numbers. This would be the rightmost
non-zero digit of the factorial. Right most non-zero digit in 28!
For example : = Right most non-zero digit of (25 × 5! × 3!)
6! =6×5×4×3×2×1 = (32 × 120 × 6) = (2 × 2 × 6) = 4
= (2 × 3) × 5 × (2 × 2) × 3 × 2 y For any large value of N, to reduce the
steps of the calculation, one can also use
= (
2  5)  (
3 
 22 
  3 
2)
the following method.
  N = 25a + b
(This will produce (Unit digit of this Rightmost non-zero digit of N! = Right
Trailing zeros) would be right most
most non-zero digit of (4a × a! × b!).
non-zero digit)
Example 34:
6!  Unit digit of (3 × 2 × 2 × 3 × 2)
Find the right most non-zero digit in 81!.
 2 = Right most non-zero digit of 6!
Solution: 8
Let’s try with some bigger number.
81 = 25 × 3 + 6
15! = 1 × 2 × 3 × 4 × 5 × 6 × 7 × 8 × 9 × 10 ×
= Right most non-zero digit of (43 × 3! × 6!)
11 × 12 × 13 × 14 × 15
= (4 × 6 × 2) = 8
= 211 × 36 × 53 × 72 × 11 × 13
28
= (  36 72
  11  13
)  (3
2 5

3
)
 
Unit digit of this Trailing zeros
would be right most
non-zero digit

Numbers – Part 1 149

 w Practice Exercise – 1

Level of Difficulty – 1 (A) 2

(B) 3
1. The highest power of 7 that completely
(C) 4
divides 2200! is _______ .
(D) 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 × 112 × 113 ×
(D) All of the above ....................998 × 999 is:
3. A, B, and C are defined as follows: (A) 246
(B) 236
A = (1.000002) ÷ [(1.000002)2 + (4.000008)] (C) 220
B = (2.000004) ÷ [(2.000004)2 + (8.000016)] (D) Cannot be determined

C = (3.000003) ÷ [(3.000003)2 + (9.000009)] 9. How many natural numbers are there be-
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) A is twice of C (B) 10
(C) C is the smallest (C) 11
(D) B is the smallest (D) 12

4. Find the product of all the factors of 532. 10. N! is completely divisible by 1155. What
is the sum of the digits of the smallest
(A) 51056
such as number N?
(B) 5528
(A) 10
(C) 5264
(B) 11
(D) 5320 (C) 12
5. x, y, and z are positive integers such that (D) 13
x + y + z = 2021.
Level of Difficulty – 3
Let s = (–1)x + (–1)y + (–1)z. Find the num-
ber of possible values of s: 11. If the LCM of two positive integers (N1,
(A) 2 N2) where N1 < N2 is 30 times the HCF,
(B) 4 which of the following is not a possible
(C) 1 N
value of 2 ?
(D) 3 N1
(A) 7 . 7
Level of Difficulty – 2
(B) 3 . 3
6. What is the number of ordered pairs of (C) 1.2
positive integers a and b that satisfy the
(D) 7.5
condition ab = a + b + 16?

150 Numbers – Part 1

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 226 but not 326? If 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 (D) 75
(D) 8

Numbers – Part 1 151

 Solutions

1. 364 Or
Two numbers will be even, and one num-
The highest power of 7 completely di-
ber will be odd.
vides 2200!
Therefore, the possible values of s if all
2200 2200 2200 the three numbers will be odd.
= + +
7 72 73 Then ‘s’ = (–1)odd + (–1)odd + (–1)odd
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)odd + (–1)odd + (–1)even
PQRPQR = PQR × 1000 + PQR = –1 – 1 + 1
= PQR × (1000 + 1) 's' = - 1
= PQR (1001) Hence only two values are possible for ‘s’.
= (PQR × 7 × 11 × 13) Option (A) is the correct answer.
So, PQRPQR is divisible by all of (77 = 11 × 7), 6. (A)
(91 = 13 × 7) and (143 = 11 × 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
 A 2    a(b – 1) –1(b – 1) = 17
K  4K K  4 5.000002
Assume 2.00004 = L  (a – 1) (b – 1) = 17
Here the product of two numbers is prime
L 1 1
B 2   (17), which is possible only when one of
L  4L L  4 6.000004 the numbers is 1, and the other is 17.
1 So, two cases will be possible when a = 18
Similarly, C =
6.000003 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 50, 51, 52, 53 …………….. 532 en condition.
∴ Product of all the factors Hence, option (A) is the correct answer.
= (50) × (51) × (52) ……………………….. ×(532) 7. 47
= 5(0+1+2+3+……….32)
Since prime numbers are consecutive,
 3233 

 2 
 then for simplicity, we may take them
=5 = 516×33 = 5528
equally.
Hence, option (B) is the correct answer.
Then, a4 = 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 402 = 1600 and 502 = 2500
First one, if we take all the three num- Then, a ≈ 45
bers (x, y, z), all are odd in nature.

152 Numbers – Part 1

 Now, check prime numbers near 45. So, for K = 9, the number = 315 × 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 × 55
8. (C) = 605. The highest power of 11 in 605! = 60.
The power of 11 is the smallest such num-
111 × 112 × 113 × ...........998 × 999 ber needs to be exactly 55. If we subtract
 1  2  3  4....110  (111  112  113  998  999) 11x 5 = 55 from 605, we will get 550.
= The highest power of 11 in 550! = 54. So,
( 1  2  3  4.........110)
need to increase 550 by another 11, that
 1  2  3  4....110  (111  112  113  998  999) 999 ! is 561.
=
( 1  2  3  4.........110) 110 ! In 561! the highest power of 11 will be ex-
So, the highest power of 5 in 111 × 112 × actly 55 as per our requirement.
Hence, the minimum value of N is 561.
113 ..........998 × 999 is the same as the Sum of the digits of the smallest value of
999 ! N = 5 + 6 + 1 = 12.
highest power of 5 in .
110 !
Hence, option (A) is the correct answer.
The highest power of 5 in 999!
11. (A)
 999   999   999   999 
=     2    3    4  Since LCM = 30 × HCF (Given)
 5   5   5   5 
Let HCF = m
= 199 + 39 + 7 + 1 = 246 \ N1 = ma and N2 = mb
Where [x], represent greatest integer of x. Also, we know that:
Similarly, the highest power of 5 in 110! N1 × N2 = HCF × LCM
 110   110  ma × mb = m × 30 × m
=    2   22  4  26 ab = 30
 5  5 
Also, a < b (Given in the question)
999 !
Hence, the highest power of 5 in Therefore, a × b = 30
110 !
5246
= = 5220
5 26 \
Hence, option (C) is the correct answer.
9. (A)
Here, the difference between divisors N2 mb 30
For (a, b) = (1, 30)  = = = 30
and the remainders is fixed, and it is 1, N1 ma 1
so the number would be of the form LCM
[(3, 5, 7, and 9) K] – 1 = 315K – 1, where K N2 15
For (a, b) = (2, 15)  = = 7.5
is a natural number. N1 2
Now for K = 1, the number would be 314 N2 10
For K = 2, the number would be 629 and For (a, b) = (3, 10)  = = 3. 3
N1 3
so on till K = 10, for which the number
would be 3149. N2 6
For (a, b) = (5, 6)  = = 1. 2
Now we need to take numbers between 1 N1 5
and 3149, so we can’t take 3149.

Numbers – Part 1 153

 \ 7 . 7, option (A) is not a possible value  17 (1 + pq) = 85
 1 + pq = 5
N2
of .  pq = 4
N1 Possible values of p and q : (1, 4)
Hence, option (A) is the correct answer. The total number of possible 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 226. As we know
If N = 10 10! is divisible by 28 A number divisible by 24 would be divis-
N = 20 20! is divisible by 218 ible by both 3 and 8.
N = 25 25! is divisible by 222 Divisibility rule of 3: The sum of digits
N = 30 30! is divisible by 226 must be divisible by 3
Now 30! = 226 × 314 × ……. Divisibility rule of 8: Last three digits
So 30! is the minimum number that di- must be divisible by 8
vides 226 but not 326. 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 226 but not 326. (always divisible by 3), so we must take
As 53! = 249 × 323 × …… care of the last three digits.
whereas 54! = 250 × 326 × ……, which is di- 9,87,65,43,210
visible by both 226 and 326, 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
would be 9,87,65,43,120.
Let x = Kp, y = Kq where a and b are
For the second-largest number, we would
Co-prime.
play with 0, 1, and 3 (we should choose
HCF (x, y) = K
the lowest possible three digits to keep
LCM = (x, y) = Kpq
the Number N largest possible). The pos-
According to question:
sibilities are 013, 031, 103, 130, 301, 310.
K + Kpq = 85
None are divisible by 8.
 K(1 + pq) = 85
Let’s play with 0, 2, and 3 now. The pos-
Possible option are 1 × 85 or 5 × 17 sibilities are 023, 032, 203, 230, 302,
Case 1: When HCF = 1 and 320. Only 320 is divisible by 8. So,
 1 (1 + pq) = 85 the second-largest number would be
 pq = 84 9,87,65,41,320.
There can be many combinations such
15. (D)
that pq = 84. But we need to select
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.
1. Both the perfect squares are of odd
Case 2: When HCF = 5 numbers.
 5(1 + pq) = 85 2. Both the perfect squares are of even
 1 + pq = 17 numbers.
 pq = 16 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 Case 1: (odd number1)2 – (odd number2)2

154 Numbers – Part 1

 (odd number1 + odd number2) (odd In every set of four consecutive num-
number1 – odd number2) bers, starting from 1, there will be three
even number × even number numbers which can be expressed as the
= multiple of 4, i.e., 4k ...(i) difference between two perfect squares,
Case 2: (even number1)2 – (even number2)2 or there will be only one number which
(even number1 + even number2) (even cannot be expressed as the difference
number1 – even number2) between two perfect square numbers.
= even number × even number Therefore, in the set of the first 100 nat-
= multiple of 4. i.e., 4l ...(ii) ural numbers, numbers which cannot
be expressed as the difference between
Case 3: (odd number)2 – (even number)2
= (odd number – even number) (odd 1
two perfect squares =  100  25.
number + even number) 4
= Odd number × 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:

Numbers – Part 1 155

 Practice Exercise ­­– 2
Level of Difficulty – 1 7. If 15 < x < 2650, then for how many values
x
of x, is the square of a prime number?
1. For how many prime numbers ‘P’ will ‘37P 5
+ 7’be a multiple of P? (A) 10
(A) 2 (B) 9
(B) 4 (C) 7
(C) 6 (D) 6
(D) 1
8. If N= 0.a1a2a3a2a3a2a3 ....................Find
2. For N = 2 × 3 × 5 × 7 . Find the factors
12 8 10 4
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
3200 ! 9. How many natural numbers from 1 to 50
3. is completely divisible by P, where
PP 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 = 235 × 341. 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

6. If N = 3x3 + 6x2 + 5x + 36, then for how 12. Ravi was asked to add the numbers from
many values of x, N is completely divisi- 1 to n and report the Sum to his teacher.
ble by x? He gave the answer as 1020. The teach-
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?

156 Numbers – Part 1

 (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?
(D) 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
(D) 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 26 × 59 × 123
isfy this condition? that are perfect squares.
(A) 6
(B) 8 Level of Difficulty – 3
(C) 10
(D) 12 21. A natural number N has k distinct prime
factors. If the total number of factors of
14. If x = 3012, how many factors of x will have
N is 72, then what is the product of all
at least one ‘0’ 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
(D) 38 (D) 5
16. N = 1 × 1 ! + 2 × 2 ! + 3 × 3 ! +¼+ 17 × 17 !, 23. N is a natural number which has four
(N + 7 ) factors. If 10 ≤ N ≤ 65, then how many
then find the remainder of 19
19 ! R values are possible for N?
(A) 1 (A) 12
(B) 7 (B) 15
(C) 13
(C) 19
(D) 19
(D) 114
24. How many values of A exist such that all
17. Given that A, B, C, D… X, Y, and Z are 26
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 = A3 + B3 + (A) 9
C3 + D3+ …X3 +Y3 + Z3. Find the number of (B) 8
zeros at the end of product (A × B × C × D (C) 7
× … × Y × Z). (D) 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 8 lies between _______.
(B) 11 or 8 (A) 0 and 20
(C) 10 or 6 (B) 20 and 40
(D) 12 or 6 (C) 40 and 60
(D) 60 and 80

Numbers – Part 1 157

 26. What is the smallest natural number 29. Find all the integers x for which x2 + 16x
which when divided by 7 leaves a re- + 92 is a perfect square.
mainder of 5, when divided by 9 leaves (A) –2
a remainder of 6, and when divided by 5 (B) –14
leaves a remainder of 1? (C) 8
(D) Both (A) and (B)
27. What is the largest integer that always
divide x5 – 5x3 + 4x; x is an integer? 30. What is the highest power of 12 that will
(A) 240 divide the product of the first 50 multi-
(B) 120 ples of 12?
(C) 480 (A) 22
(D) 160 (B) 68
(C) 50
28. If N = 10,800 then find the sum of thrice
(D) 72
number of odd factors, twice number of
even factors and thrice number of fac-
tors which are perfect square.
(A) 168
(B) 192
(C) 172
(D) 180

158 Numbers – Part 1

 Solutions

1. (A) For N2 2946

Þ  2946
 N  
37P + 7 can be converted in an – a form,
1511
i.e., 37P – 37 + 44 For N Þ  N
Here, 37P – 37 is always divisible by P Factors of N that do not divide N = 2,946
2

\ For the whole term to be divisible by P. – 1,511 = 1,435.

The given P must be a factor of 44. Hence, option (B) is the correct answer.
44 = 4 × 11 5. (D)
or 2 × 2 × 11,
72 = 8 × 9 = 23 × 32
Since P is a prime number.
Highest power of 2 in 72! = 36 + 18 + 9 +
\ P can be 2 or 11.
4 + 2 + 1 = 70.
Hence, P can take only two values.
Highest power of 3 in 72! = 24 + 8 + 2 = 34
Note : an – a is always divisible by n if a
So, 72! = 270 × 334 × 5x × 7y × …
is a prime number.
961 = 25 × 31
Hence, option (A) is the correct answer.
96K = 25K × 3K
2. (C) If we put K = 34, 334 will be fully utilised,
Factors of form 360 N, where N is a nat- but we do not have 2170. So, K can’t be 34.
ural number. If we put K = 14, 270 will be fully utilised,
360 N = 23 × 32 × 51 [29 × 36 × 59 × 74] and 314 will be utilised
Number of factors of N = (9 + 1) × (6 + 1) × 96! = (270 × 314) × 320 × 5x × 7y × …
(9 + 1) × (4 + 1) 96! = 9614 × 320 × 5x × 7y × …
= 10 × 7 × 10 × 5 = Hence, the highest power of 96 in 72! = 14.
3,500 Hence, option (D) is the correct answer.
Factors of form 420 M = 2  2 × 3 × 5 × 7 [210
6. (C)
× 37 × 59 × 73]
We have
Common factors = [2 × 36 × 59 × 73]
9

Number of common factors = 10 × 7 × 10 × 4 N = 3x3 + 6x2 + 5x + 36 =>

= 2,800 N 3 x 3  6 x 2  5 x  36

Required number of factors = 3,500 – x x
2,800 = 700. 36
= 3x 2 + 6x + 5 +
Hence, option (C) is the correct answer. x
3. (A) Now, for N to be completely divisible by
3200 !
x, x must be the factor of 36.
PP We can express ‘36’ as:
Here P ≤ N , P ≤ 3, 200 , P ≤ 56, P ≈ 56 36 = 22 × 32
Since P is a prime number. There are 16 Now, total factors = (2 + 1) × (2 + 1) = 9
prime numbers from 1 to 56. Hence, option (C) is the correct answer.
\ 16 is the required answer. 7. (B)
Hence, option (A) is the correct answer. 15 < x < 2,650
4. (B) x
 3 < < 530
N = 235 × 341 5
Number of factors of N = (35 + 1) (41 + 1) x
Since is the square of a prime number,
= 36 × 42 = 1512 5
N2 = 270 × 382 x
the values which can take are 4, 9, 25,
Number of factors of N2 = (70 + 1) (82 + 1) 5
= 71 × 83 = 5,893 49, 121, 169, 289, 361, and 529.

Numbers – Part 1 159

 x To calculate the sum of even factors of
Thus for 9 values of x, will be the 144 first we will calculate the sum of odd
5
square of a prime number. factors and then we will subtract it from
Hence, option (B) is the correct answer. the total sum of the factors.
8. (D)  25  1   33  1 
Sum of factors of 1 44    
Here, N = 0. a1 a2a3  1  2 

There, we can express ‘N’ as: = 31 ´ 13 = 403

For odd factors, we will remove the pow-
 a a a  a1 
N 1 2 3  ers which will make a factor even, thus
 990
  will consider a sum of 20 ´ 32, and thus
Now, from the given option, only option æ 21 - 1 ö æ 33 - 1 ö
(e) is a multiple of 990. Sum of odd factors will be ç ÷ç ÷ = 13
è 1 øè 2 ø
Hence, multiplying 2,970 with given ‘N’
Thus, the sum of even factors will be
will get an integral value.
403 - 13 = 390.
Hence, option (D) is correct.
For 2,400, we will consider 20 ´ 3 ´ 52,
9. (D) thus the sum of odd factors will be
As we know from the definition of prime
 21  1   32  1   53  1 
numbers, that prime numbers always     = 124
have exactly two factors.  1  2  4 
Also, numbers in the form of N = p2 Thus, required sum = 390 + 124 = 514.
(where p is prime) 12. (B)
i.e., All the squares of prime numbers will Ravi missed numbers between 1 and n.
have exactly three factors. Thus, 1 and n were necessarily included.
Therefore, from 1 to 50, there are 15 Sum = 1 + 2 + 3 + … + 45 = 1,035
prime numbers: Ravi’s sum = 1,020
2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, Thus, 15 more is required. Since ‘1’ wasn’t
and 47. missed, there could be maximum of four
Also, from 1 to 50 there are 4 squares of
numbers 2, 3, 4, 6.
prime numbers.
Hence, option (B) is the correct answer.
22, 32, 52, 72
Therefore, required answer = 15 + 4 = 19 13. (C)
Hence, option (D) is the correct answer. It has been given that (x + y)2 = x2 + y2 + 200.
10. (B) x2 + y2 + 2xy = x2 + y2 + 200
x + y = 990 2xy = 200
If x and can be equal then x = 495, y = 495 xy = 100
with HCF = 495 would have been the The product of two numbers is 100.
best possible solution. But x and y are 100 can be written as 22 ´ 52.
given to be distinct positive integers. Therefore, 100 will have 3 ´ 3 = 9 natural
Therefore, let us divide 990 into three number factors.
parts for next best possible solution with But the pairs will be 5 as there will be
maximum HCF four other sets of numbers other than 10
 x = 330, y = 660 is the best solution ´ 10, which will satisfy the condition.
with HCF = 330. We have to entertain the possibility that
Hence, option (B) is the correct answer. both x and y can be negative.
Therefore, 5 ´ 2 = 10 pairs of integers will
11. 514
satisfy the given condition.
144 = 24 ´ 32
Hence, option (C) is the right answer.
2,400 = 25 ´ 31´ 52

160 Numbers – Part 1

14. 1,872 So, (1 + 2 + 3 + 4 + … + 24 + 25 + 26)2 = 13
Here, x = 212´ 312´ 512 + 23 + 33 + 43+ … +243 + 253 + 263
In order to have a 0 at the end, the power Now (A × B × C × D × … ×Y × Z) = 1 × 2 × 3
of 2 and 5 should be at least 1 while the × 4 ---------- × 25 × 26 = 26!
power of 3 can be anything. So, we need to find the number of zeros
So, the number of possibilities is 12 ´ 12 at the end of 26! which will be equal to
´ 13 = 1,872. the highest power of 5 in 26! = [26/5] +
[26/25] = 5 + 1 = 6.
15. (B)
18. (B)
For the statement given in the question
X2 have 21 factors.
to be true, n must be a prime number
We know that any number can be expressed
(2 – 1) ! is not divisible by 2
as the product of prime factors = pqqbrc.
(3 – 1) ! is not divisible by 3
Number of factors of that number = (a + b)
(7 – 1) ! is not divisible by 7
(b + 1) (c + 1).
(31 – 1) ! is not divisible by 31
Now, 21 = 1 × 21 or 3 × 7 (there is no other case)
We see all the prime numbers satisfy
If X2 = p20 or p2q6 then X = p10 or p1q3
this condition.
Therefore, number of factors of X will be
\ Total numbers ‘N’ till 150 satisfying
(10 + 1) or (2) × (4) = 11 or 8.
this condition will equal the number of
Hence, option (B) is the correct answer.
primes till 150.
There are a total of 35 primes from 1 to 19. (B)
150 that are 2, 3, 5, 7, … , 149. Let two numbers be H × A and H × B, where
\ A total of 35 numbers satisfy the H is the HCF of two numbers and A, B
condition or N = 35. Relatively Co-prime.
Hence, option (B) is the correct answer. According to the question:
16. (D) H × A + H × B + LCM (H × A and H × B) = 89
H × A + H × B + H × A × B = 89
N = 1 × 1 ! + 2 × 2 ! + 3 × 3 ! + … + 17 × 17 !
H (A + B + AB) = 89
= (2 – 1) 1 ! + (3 – 1) 2 ! + (4 – 1) 3 ! + …
89 is a prime number the only possi-
+ (18 – 1) × 17 !
bility is
= 2! – 1 ! + 3 ! – 2 ! + 4 ! – 3! + … + 18 ! –
H = 1 and A + B + AB = 89
17 ! = 18 ! – 1
A + B + AB = 89
N = 18 ! – 1
A + B (1 + A) = 89
19 (N + 7) = 19 ! + 114
1 + A + B (1 + A) = 1 + 89 = 90
(N  7 ) 19 !  114 (1 + A) (1 + B) = 90
19  = 114
19 ! R 19 ! R
Þ (A + 1) (B + 1) = 90
\ Required remainder = 114
Hence, option (D) is the correct answer.
17. 6
(A + B + C + D+ … + X + Y + Z)2 = A3 + B3
+ C3 + D3+ … + X3 + Y3 + Z3
This is true only when A = 1, so according
B = 2, C = 3, and so on till Z = 26
which means
(1 + 2 + 3 + 4 + … + 24 + 25 + 26)2 = {(25 × 26)/2}2 Except
1 3 + 2 3 + 3 3 + 4 3 + … +24 3 + 25 3 + 26 3 (0, 89), all other five pairs are Co-prime.
= {(25 × 26)/2}2 Hence, 5 such pairs are possible.
Hence, option (B) is the correct answer.

Numbers – Part 1 161

 20. 70 (a + 1)2 (b + 1)2 = pa ´ qb
26 × 59 × 123 = 26 × 59 × (2 × 2 × 3)3 = 26 × This is possible only if p and q are both
59 × 26 × 33 = 212 × 33 × 59 3. Since they are different, this is not a
Now, for a number to be a perfect square, valid case. So, there would be no such
the power of its prime factor should be case with two or more prime factors.
even. So, there are only two such integers, 1 and 9.
For powers of 2, only 0, 2, 4, 6, 8, 10, and Hence, option (C) is the correct answer.
12 will give a perfect square. 23. (D)
For powers of 3, only 0, 2 will give a per- Since N has 4 factors, N must be of the
fect square. form P13 or P2 ´ P3 where P1, P2, P3 are
For powers of 5, only 0, 2, 4, 6, and 8 will prime numbers.
give a perfect square. If N takes the form P13 then P1 can only be 3.
For perfect square factors, we need to If N takes the form P2 ´ P3 then the pos-
select any one number out of 20, 22, 24, sibilities are:
26, 28, 210, and 212, any one number from Nine possible values where 2 is the
30, 32, and any one number from 50, 52, 54, smaller factor:
56, and 58. 2 ´ 5, 2 ´ 7, 2 ´ 11, 2 ´ 13, 2 ´ 17, 2 ´ 19, 2
This can be done in 7 × 2 × 5 = 70 ways ´ 23, 2 ´ 29, 2 ´ 31.
Hence, the total number of square fac- Six possible values where 3 is the small-
tors = 70. er factor:
21. 120 3 ´ 5, 3 ´ 7, 3 ´ 1, 3 ´ 13, 3 ´ 17, 3 ´ 19
Three possible values where 5 is the
Let N = ap ´ bq ´ cr ´ …, where a, b, c,… are
smaller factor.
prime numbers and p, q, r, … are natural
5 ´ 7, 5 ´ 11, 5 ´ 13.
numbers.
\ (p + 1) ´ (q + 1) ´ (r + 1) ´ … = 72 = 2 ´ So, N can take 1 + 9 + 6 + 3 = 19 values in all.
2´3´3 Hence, option (D) is the correct answer.
The number of prime factors of N can be 24. (A)
1, 2, 3, 4, or 5. All prime numbers except 2 are odd. Let
For example, if the number of prime fac- us assume that both A and B are odd.
tors of N is 1, then N will be of the form a71.  B - A must be even. Since only even
Similarly, the number of prime factors of prime number is 2, B - A must be 2.
N can be 2, 3, 4, or 5. For, such cases, the possible values of B
Hence, the product = 1 ´ 2 ´ 3 ´ 4 ´ 5 = 120. and A are
22. (C) (5, 3), (7, 5), (13, 11), (19, 17), (29, 31),
One such number is 1, which has no fac- (43, 41), (61, 59) (73, 71).
tor other than itself. Other than this, A can also take a value
If the number has only one prime factor, of 2. In that case, B can take values (5,
i.e., it is of the form pa where p is a prime 7, 13, 19, 31, 41, 63, 73). In all these cases,
number, and a s a natural number, then B − A will also be prime.
according to the question: So, the values that A can assume are 2,
(a + 1)2 = pa. 3, 5, 11, 17, 29, 41, 59, and 71.
This is possible only if a = 2 and p = 3. So Thus, a total of 9 values.
the number is 9. Hence, option (A) is the correct answer.
If the number has two prime factors, it 25. (B)
would be of the type pa ´ qb, where p and
The product of all the factors of a posi-
q are two distinct prime numbers. Then
tive integer P is P{f(P)/2}, where f(P) is the
according to the question:
number of factors of P.

162 Numbers – Part 1

 Given that, product of all the factors of P This, when divided by 5, leaves a remain-
is P2. der of 1.
φ (P ) 33 + 63K1 = 5k2 + 1
\ =2
2 63k1 + 32 = 5k2
 f(P) = 4, i.e., P has four factors. k1 = 1 and k2 = 19
P is either the cube of a prime number or So, the smallest number is 33 + 63 = 96.
the product of two distinct primes. 27. (B)
Suppose P is the cube of the prime num-
Here, we use the hit-and-trial method and
ber p.
try putting values of x as 3, 2, 1, 0, –1, –2, –3.
Sum of all the factors of P, excluding P
Putting value of x = 0.
= 1 + p + p2 = 20.
f(0) = (0)5 – 5(0)3 + 4(0) = 0
Since p + p2 is always even, 1 + p + p2 is
Hence, we can say x is a factor of f(x)
always odd.
x is a factor of f(x)
It cannot be 20.
x (x4 – 5x2 + 4)
So, P is the product of two primes.
Putting, x = 1
Let these be p1 and p2.
We get, f(1) = 0
Let p1 < p2.
Þ x (x – 1) (x3 + x2 – 4x – 4)
The factors of Pare 1, p1, p2, p1p2.
Putting, x = 2 and so on
1 + p1 + p1 = 20  p1 + p1 = 19
f(x) = (x – 2) (x – 1) × (x + 1) (x + 2)
p1 + p2 is odd.
Here, we see that f(x) is the product of 5
\ One of p1 and p2 is an odd prime and
continuous numbers.
the other must be 2
\ f(x) must be a multiple of 5 ! or 120
( 2 is the only even prime)
Note: The product of n continuous num-
p1 < p2.
bers is always divisible by n !
\ p1 = 2 and p1 = 17.
Hence, option (B) is the correct answer.
P = p1p2 = 34.
Hence, option (B) is the correct answer. 28. (A)
N = 10,800 = 24 × 33 × 52 = apbqcr
26. 96
Þ Total number of factors = (p + 1) (q + 1) (r + 1)
This is a problem of the type LCM model
= (4 + 1) (3 + 1) (2 + 1)
3.
= 5 × 4 × 3 = 60
7 9 5 — divisors
For odd factors, we only consider factors
5 6 1 — remainders
other than 2 and power of 2, i.e., 33 × 52
Let us first take
Þ Number of odd factors = (3 + 1) (2 + 1)
7 9 — divisors
= 4 × 3 = 12
5 6 — the remainder
For even factors, we consider multiple of
The number is of the form 9k + 6
2, i.e., 2 × (23 × 33 × 52)
7 ) 9k + 6 ( Þ Number of even factors = (3 + 1) (3 + 1) (2
5 + 1) = 4 × 4 × 3 = 48
9k  6  5 For perfect square factors, we consider
So, leaves no remainder.
7 even powers of prime numbers
9k + 1 Þ Number of perfect square fac-
Leaves no remainder. tors = [2 0 , 22, 24] [30, 32] [50, 52]
7
k = 3 (by trial and error) = 3 × 2 × 2 = 12
So, the smallest number is 9k + 6 = 9 × Now, 3 × odd factors + 2 × even factors +
3 + 6 = 33 3 × perfect square factors
General form is 63k + 33. = 3 × 12 + 2 × 48 + 3 × 12 = 168
Hence, option (A) is the correct answer.

Numbers – Part 1 163

 29. (D) 30. (D)
x2
+ 16x + 92 = k2
The first 50 multiples of 12 are (12 × 1), (12
x2 + 16x + 64 + 28 = k2 × 2), (12 × 3),…………, (12 × 50)
(x + 8)2 + 28 = k2 Product of first, so multiples of 12 is
k2 – (x + 8)2 = 28  1250 × (1 × 2 × 3 × 4 × … × 50)
(k + x + 8) (k – x – 8) = 28  1250 × 50 !
For checking the power of 12 in 50 ! We
a b must check powers of 2 and 3.
28 1 × Not possible (x must (1) Checking power of 2.
be integer)
14 2  Possible 50 ! 50 ! 50 ! 50 ! 50 !
= 25 4 = 3 2 = 12 5 = 1 3 = 6
7 4 × Not possible (x must 2 2 2 2 2
be integer) Total power of 2 = 25 + 12 + 6 + 3 + 1 = 47
2 14  Possible 50 ! = 247 × a (where a is the other factor)
Case 1: (2) Checking power of 3
k + x + 8 =14 and k – x – 8 = 2 50 ! 50 ! 50 !
= 16    2 = 5 = 1
Adding both, 2k = 16 or k = 8 3 3 33
Now, put this in any of the equation
Total power of 3 = 16 + 5 + 1 = 22
We get x = –2
Here, power of 3 is the limiting factor:
Case 2: 12 = 22 × 3.
k + x + 8 = 2 and k – x – 8 = 14 Highest power of 12 that divides 50 !
Solving both, we get k = 8  (247 × 322 × b)  (22 × 3)22 × 23 × b  1222
Putting this value of k in any of the equa-
\ Highest power of 12 that will divide
tions, we get x = –14
first 50 multiples of 12
\ x = –2 or –14
Hence, option (D) is the correct answer. = 12(50 +22) = 1272.
Hence, option (D) is the correct answer.

164 Numbers – Part 1