Chapter- 1

NUMBERS -I
symbols which may take any value we choose to assign
NUMBERS is one of the most important topics required
for competitive entrance exams. In this chapter, we have them as compared to definite values usually used in
put together a number of models of problems - mainly arithmetic operations.
based on various problems that ,have been appearing in
different exams. Rule of Signs
BASIC ARITHMETIC OPERATIONS The product of two terms with like signs is positive; the
product of two terms with unlike signs is negative.
Addition is the most basic operation. We have an intuitive Example: -1 x -1= +1;
understanding of the operation. It is the process of finding +1 x -1 =-1,
out the single number or fraction equal to two or more +1 x +1 =+1:
quantities taken tógether, The two (or more) numbers that -1 x +1 =-1;
are added are called addends and the result. of the
addition is called the sum. For two numbers A and B, this HIERARCHY OF ARITHMETIC OPERATIONS
is denoted as A+ B.
To simplify arithmetic expressions which involve various
Subtraction is the process of finding out the quantity left operations like brackets, multiplications, additions, etc. a
when a smaller quantity (number or fraction) is reduced particular sequence of the operations has to be followed.
from a larger one. This is called the difference of the two For example,2 +3 x 4 has to be calculated by multiplying
numbers. The word difference is taken to mean apositive 3 with 4 and the result 12 added to 2 to give the final result
quantity, i.e., the difference of 10 and 8 is 2. The of 14 (you should not add 2 tu 3 first to take the result 5
difference of 8 and 10 is also 2. This is also referred to as
the remainder.
and multiply this 5 by 4 to give the final result as 20). This
is because in arithmetic operations, multiplication should
be done first before addition is taken up.
Multiplication is repeated addition. The number that is
added repeatedly is the multiplicand. The number of times The hierarchy of arithmetic operations are given by a rule
it is added is the multiplier. The sum obtained is the called BODMAS rule. The operations have to be carried
product. out in the order in which they appear in the word
BODMAS, where different letters stand for the following
For example, in the multiplication 3 x 4 = 12, 3 is the operations:
multiplicand, 4 is the multiplier and 12 is the product.
B Brackets
Division is repeated subtraction. From a given number, Of
we subtract another repeatedly until the remainder is less D Division
than the number that we are subtracting. The number from M Multiplication
which we are subtracting the second one is the dividend. A Addition
The number that is subtracted repeatedly (the sécond Subtraction
one) is the divisor. The number of times it is subtracted is There are four types of brackets:
the quotient. The number that remains after we are done
subtracting is the remainder. Division can also be thought (i) Vinculum : This is represented by a bar on the
of as the inverse of multiplication. A/B is that number with top of the numbers. For example, in 2 +3-4 -3: the
which B has to be multiplied to get A.
For example, in the division 32/5, 32 is the dividend, 5 is figures under the vinculum have to be calculated as 4
the divisor, 6 is the quotient and 2 is the remainder. +3 first and the "minus" sign before 4 is applicable to
7. Thus the given expression is equal to 2 + 3 -7,
Involution (or raising to the power. n) is repeated which is equal to -2.
multiplication. Thus, an is the prodüct of n a's. Here, a is (ü) Simple Brackets: These are represented by ( )
the base, n is the index and an is the nh power of a. (i) Curly Brackets: These are represented by {}
For example, a xa = a', which is the second power of a (iv) Square Brackets: These are represented by ()
and aXa xa = a, which is the third power of a.
The brackets in an expression have to be opened in the
Evolution is the inverse of involution. The nh root of a order of vinculum, simple brackets, curly brackets and
number is that number whose n" power is the given square brackets, i.e.. [{ ) } to be opened from inside
number. The root of any number or expression is that outwards
quantity which when multiplied by itself the requisite
number of times produces the given expression. After brackets is O in the BODMAS rule
standing for "of"
For example, the square root of a, Va when multiplied by which means multiplication. For example. 1/2 of 4 will be
equal to 1/2 x 4 which is equal to 2.
itself two times, gives a; similarly, the cube root of a, a
when multiplied by itself three times, gives a. After O, the next operation is D standing for
is followed by M standing for division. This
All the above operations are performed in Algebra also multiplication. After
Multiplication, A standing for addition will be performed.
Algebra treats quantities just as Arithmetic does, but witth Then, S standing for subtraction is performed.
greater generality, for algebraic quantities are denoted by
Triumphant Instituteof Management Education Pvt. Ltd. (TJ.M.E.) IO
9513. 2ud |loor.
Tel : 040-40088400 Fax : 040-27847334 email : infoa imcteducation com Siddamselly Complex. Sceunderabad 5O0 00)
website :
wyw.tne4cducation,.con SMI002208/1
 is
Iwo operations that have not rational and irrational numbers
Another way of looking at are
BODMAS rule are taking powers been mentioned in the recurring decimals
and Terminating decimals and
involution and evolution extracting roots, VIz, both rational numbers.
operations are also involved inrespectively. WNhen these
expressions, there is never Any non-terminating,
non-recurring decimal is an
any doubt about the order in irrational number.
which the steps of the
simplification should
is a variant of the
be taken. The sign for root
extraction
vinculum and for powers, brackets
used to resolve ambiguities are Integers
in the order. Integers are classified
All integers are rational numbers.
Positive
Examples into negative integers, zero and positive integers.
Numbers and
integers can be classified as Prime
1.01. Composite Numbers. In problems on Numbers, we very
Simplify: often use the word "number" to mean an "integer.
"1
o30-(o -8-6)ots4 Prime Numbers

A number other than 1 which does not have any factor

Sol.
o 0-h9.5-)otsa apart from one and itself is called a prime number.

Examples for prime numbers are 2,3, 5, 7, 11, 13, 17, 19,
23, etc.
There is no general formula that can give prime numbers.
Every prime number greater than 3 can be written in
the form of.(6k +1)_or (6k-1) where k is an integer.
|4offs0 -21:27}+3| For the proof of this, refer to 4h point under "Some
important points to note" given later on in this chapter.

|*ol36|+3|-e+4:3]-11 Composite Numbers

Any number other than 1, which is not a prime number is
CLASSIFICATION OF REAL NUMBERS called a composite number. In other words, a
composite
number is a number which has factors other than
Real Numbers are classified into rational and one and
itself.
irrational
numbers.
Examples for composite numbers are 4, 6, 8, 9, 10, 14,
Rational Numbers 15, etc.
A number which can be expressed in the form p/q where NOTE:
p and q are integers and q z0 is called a rational number.
The number 1 is neither
For example, 4 is a rational number since 4 can be witten The only prime number thatprime nor composite.
as 4/1 where 4 and 1 are integers and the denominator There are 15 prime numbersis even is 2.1
0. Similarly, the numbers 3/4, -2/5, etc. are also rational 10 prime numbers between and 50 and
numbers. between
are a total of 25 prime
50 and 100. So, there
numbers between 1and 100.
Recurring decimals are also rational numbers. Even and odd numbers
A recurring decimal is a number in which one or more
digits at the end of a number after the deçimal point Numbers divisible by 2 are called even
repeats endlessly (For example, 0.333.. 0.111111. numbers that are not divisible by
numbers whereas
0.166666. etc. are all, recurring decimals). 2 are called odd
numbers
Any recurring decimal can be expressed as a fraction of
the form p/q and hence it is a rational number. We will study Examples for even numbers are 2, 4, 6, 8, 10, etc.
in another section in this chapter the way to convert Examples for odd numbers are 1, 3, 5, 7,9, etc.
recurringdecimals into fractions.
Between any twO numbers, there can be infinite number
NOTE: Every even number ends in0, 2, 4, 6 or 8.
The sum of any number of even numbers is
of other rational numbers
always even.
Irrational Numbers The sum of odd number of
odd
can be
3 odd
numbers, the sum of 5 numbers (.e., the sumn of
odd whereas the sum of odd numbers, etc.) is always
Numbers which are not rational but which even number of odd
points on the number line are called (i.e. the sum of 2 numbers
represented by for Irrational numbers are odd numbers, the sum
numbers. Examples
irrational numbers, etc.) S always even. of 4 odd

J2. V3. V5. V9.e etc.

are also
irrational nurmbers
The product of any
The product of anynumber of odd numbers is always odd.
Numbers like , there are infinite number of number of
two numnbers,
Between any
irrational numbers.
least one even
number is even.numbers where there is at
Management Education Pvt. Ltd. (TM.E.) ) 95B.2
Institute of Fuo,Siddamsctty
Triumphant 040-278473 34 euail: nloauntduc:catiwn com Conplex,
Tel:
040-40088400 Fax :
ime4education Secunderabad- 500 003.
website : wwW COm
SMII002208/2
Perfect Numbers Sol: 0.81 = 0.818181
Let x = 0.8181 ---(1)
A number is said to be a perfect number if the sum of ALL As the period is containing 2 digits, we multiply
its factors excluding itself (but including 1) is equal to the by 10 i.e., 100
number itself. Therefore 100 x= 81.8181 (2)
(2) - (1) gives, 99 x = 81
For example, 6 is a perfect number because the factors of X= 81/99 = 9/11
6, i.e., 1, 2and 3 add up to the number 6 itself.
Other examples of perfect numbers are 28, 496, 8128,etc. 1.04. Express the recurring decimal 0.024 in the
form ofafraction.
Recurring Decimals
Sol: 0.024= 0.024024024
Adecimal in which a digit or a set of digits is repeated Let x = 0.024024 -- (1)
continuously is called a recurring decimal. Recurring As the period contains 3 digits, we multiply with
decimals are written in a shortened form, the digits which 10 i.e., 1000, therefore
are repeated being marked by dots placed over the first 1000x = 24.024024 ----- (2)
and the last of them, thus (2) - (1) gives, 999x = 24
= 2.666.. >X=24/999 = 8/333
3
= 2.6or 2.6 We can now write down the rule for converting apure
=0.142857142857 142357... 0. 142857 recurring decimal into a fraction as follows:

Apure recurring decimal is equivalent to a

In case of 1/7, where the set of digits 142857 is recurring, vulgar fraction which has the number formed
the dot is placed on top of the first and the last digits of the bythe recurring digits (called the period of the
set or alternatively, a bar is placed over the entire set of decimal) for its numerator, and for its
the digits that recur. denominator the number which has for its digits
as many nines as there are digits in the period.
A recurring decimal like 0.3 is called a pure recurring
decimal because all the digits after the decimal point are 37
recurring. Thus 0.37 can be written as equal to 0225can be
99

written as equal to 225 25

Arecuring decimal like 0.16 (which is equal to 0.16666.) 999 111
is caled a mixed recurring because some of the digits after 63
the decimal are not recurring(in this case, only the digit 6 is 0.63
99 11
recurring and the digit 1 is not recurring).
A recurring decimal is also called a "circulator". The digit, A mixed recuring decimal becomes the sum of a whole
or set of digits, which is repeated is called the "period" of number and a pure recurring decimal, when it is multiplied
the decimal. In the decimal equivalent to 8/3, the period is by suitable power of 10which will bring the decimal point
6 and in 1/7 it is 142857. to the left of the first recurring figure. We can then find the
equivalent vulgar fraction by the process as explained in
As aiready discussed, all recurring decimals are rational case ofa pure recurring decimal.
numbers as they can be expressed in the form p/q, where
p and q are integers. The general rule for converting 1.05. Express 0.27 as a fraction.
recurring decimals into fractions will be considered later.
Let us first considerafewexamples so that we will be able
to understand the rule easily. Sol: Let x = 0.27,then 10x = 2.7 = 2 + 0.7
=2+ 7/9 (since 0.7 =7/9)
1.02. Express 0.6 in the form of a fraction. >10x = 25/9
->X=25/90 = 5/18
Sol: 0.6- 0.666
Let x = 0 66 (1) 1.06. Express 0.279 in the.form ofa fraction.
As the penod is of one digit, we multiply the given
number by 10' ie., 10
Sol: Let x = 0.279
Therefore,
10x =6.666 ---- (2) 10x = 2.79 =2 + 79/99 = 277/99
(2) -(1) gives, X = 277/990
-> 9x 6
X= 6/9 =2I3 Now we can write the rule to express a mixed recurring
1.03. Express 0.81 in the form of a fraction. decimal into a (vulgar) fraction as below:

Triumphant instiute of Management Education Pvt. Ltd. (TJM.E.) IIO 951B 24loo. Siddausetty Complex. Secunderabad 500 003
Tel: (40-40088400 Fax:040-27847334 email : mfo a me4cducation conn website : wWw.tmc4cducation.com SMI002208/3
 difference
will be equal to the
the original remainder divisions.
remainders of the two
of the the
In the numerator write the entire given number
take the division 15/6 (where
formed by the (recurring and non-recurring if we divisions
For example, twO
it as aSUM ofrespectively 2
parts) and subtract from it the part of the remainder is 3), and write are
the remainders
decimal that is not recurring. In the 8/6 and 7/6 (where remainder equal to the SUM of
denominator. write as many. nines as the and 1), the original
and 1.
period (i.e., as many nines as the number of the two remainders 2
digits recurring) and then place next to it as
15 7
many zeroes as there are digits without
6 6
recurring in the given decimal. 6
Remainder 3 =2+1
and write it as the
I.e. 0.156
156 - 1 155 31 If we take the division 15/6 29/6 and 14/6
990 990 198 DIFFERENCE of two divisions
remainders are 5 and 2). the
73 7 66
(where the respective DIFFERENCE of
original remainder 3 is egual to the
11
0.73
90 15 the two remainders 5 and 2.
15 29 14
Properties of Division 6 6 6
Remainder 3 = 5-2
A number of problems are based on the operation of
division and the relation between the quantities involved 5 If the remainder in a division is negative, then add the
in division. Before we proceed, the following basic points divisor repeatedly to the negative remainder till we
should be kept in mind.
get apositive remainder.
1. Anumber when divided by d leaving a remainder of r For example, let us take the division 15/6 (where the
is of the form d + r where q is some integer from 0, remainder is 3) and split into difference of two
1, 2.,
divisions 25/6 and 10/6. The remnainders of the tWo
For example,.a number when divided by 4 leaving a divisions are 1and 4 respectively. The difference of
remainder of 3 can be written in the form (4g + 3); the_e two remainders is 1 - 4 which is equal to
a number when divided by 7 leaving a. remainder of 4 -3and this should be equal to the original remainder.
can be written in the formn (7q + 4) Since this remainder is negative, add the divisor 6 to
2. When a number N is divided by divisor d the this negative remainder -3 to get the correct
remainder 3.
remainder is r, then the number N-r is .exactly 15 25 10
divisible by d or in other words, when N-ris divided
by d the remainder is 0. 6 6 6
.Remainders are 3, 1, -4.
For example,when the number 37 is divided by 7,.the Remainder 1 -4 =-3 which is same as -3 +6 =3
remainder is 2: if this remainder 2 is subtracted from
the number 37, the resulting number 35 is exactly 6. In a division, if the dividend (the number which is
divisible by 7. being divided) is multiplied by a certain factor and
then divided by the same divisor, then
3 When a number N is divided by a divisor d, if the the new
remainder is r, then
remainder will be obtained by multiplying the original
remainder by the same factor with which the dividend
(a) the largest multiple of d which is less than or has been multiplied.
equal to N is obtained by subtracting r from N, For example, when 11 is
i.e., N-r will be the largest multiple of dwhich is
is 3. When the dividend 11divided
is
by 8, the remainder
less than or egual to N 22 and when this number multiplied by 2. we aet
is divided by 8 the
For example, when 27 is divided by 5, the remainder is 6 whichn is same as the original
remainder is 2, so, 27 -2, i.e., 25 is the largest remainder 3 multiplied by 2
multiple of 5 less than 27.
If the
(b) the smallest multiple of d which is greater than or
7
remainder is greater than the
division is not complete. lo getthe divisor, it mneans
equal to N is obtained by adding (d-r) to N, Le. keep subtracting the divIsOr correct remainder
dwhich
N+(d) will be the smallest multuple of from the
greater than N.
you obtain the positive
the diviSur
remainder whichremainder till
less than
divided by 8 the
For example, when 49 Is smallest multiple of
rernander is 1, hence the
is 49 t (8- 1) = 56
Factors, Multiples and Co-primes
8 which is greater than 48 Factors
divisions
into asum of two
4 When a divisIon is split original diVISor), the If one nåmber
as the
(with the same divisor be frst number divIdes a second number
equal to the sum of the is said exactly.
original remainder will Smilarly
individual d1visions. For example, 5 Is a to be a factor of thne second then the
rermainders of the two difference of two divIsIons are also called factor of 15, 3 iS a factor of 18.number.
when a division is splt
unto sub-multiples
or divisors. Factors
Ltd (T.LM.E. HO 951B. 2 lo0
Management Education Pvt.
Triumphant Institute of 040-27847334 cmail : nfoaw trducation com website: Siddamsetly Complex.
Tel :04IHO088400
Fa: WWWhteducaton COmSecunderabad - 500 003
SMI002208/4
 595. The units digit
For example, let us take the number remaining part
Multiples is 5 and when it is doubled, we get 10. Theunits digit doubled)
by a second number, 10 (which is the
If one number is divisible exactly multiple of the second of the number is 59. If Since this result 49 is
be a is subtracted from 59 we get 49.
then the first number is said to a multiple original number 595 is also divisible by
is the
number. For example, 15 is a multiple of 5; 24 divisible by 7,
of 4. 7
digit gives
Similarly, if we take 967, doubling the unitsresult
(o-Primes a of 82.
relative primes or 14 which when subtracted from 96 gives
Two numbers are said to be Since 82 is not divisible by 7, the number 967 is not
they do not have any commor factor other
CO-primes if divisible by 7.
numbers 15 and 16 do not have
than 1, For example, the
any common factors and hence numbersthey are relative primes. have to be
may individually If we take alarger number, the same rule may
Please note that none of the two
relative primes. Unity is a repeatedly applied till the result comes to a number which
they can be is diVisible by
be prime and still we can make out by observation whether it
relative prime to all numbers. 7. For example, take 456745, We will write down the
figures in various steps as shown below.
Divisibility Rules
find the factors Col (2) Col (3) Col(3)
In anumber of situations, we will need to Col(1)
Remaining Col(2)
given number
of a given number. Some of the factors of a easily either
Number Twice the
fourd very units digit part of the
can, in a number of situations, be
look at number
byobservation or by applying simple rules. We will
some rules for divisibility of numbers. 10 45674 45664
456745
Divisibility by 2 45664 4566 4558
455 439
A number divisible by 2 will have an even number as its 4558 16
43 25
last digit (For example 128, 246, 2346, etc) 439 18

Divisibility by 3 Since 25 in the last step is not divisible by 7, the original

number 456745 is nct divisible by 7.
A number is divisible by 3 if the sum of its digits is a
multiple of 3. Divisibility by 8
For example, take the number 9123, the sum of the digits Anumber is divisible by 8, if the number formed by the
is 9 + 1 +2 +3 = 15 which is a multiple of 3. Hence, the last 3 digits of the number is divisible by 8.
given number 9123 is divisible by 3. Similarly 342, 789
etc,. are àll divisible by 3. If we take the number 74549, For example, the number 3816 is divisible by 8 because
the sum of the digits is 29 which is not a multiple of 3. the last three digits form the number 816, which is divisible
Hence the number 74549 is not divisible by 3. by 8. Similarly, the numbers 14328, 18864 etc. are
divisible by 8. If we take the number 48764, it is not
Divisibility by 4 divisible by 8 because the last three digits' number
A number is divisible by 4 if the number formed with its 764 is not divisible by 8.
last two digits is divisible by 4.
general, if the number formed by the last ndigits of a
For example, if we take the number 178564, the last two number is divisible by 2n, the number is divisible by 2n.
digits form 64. Since this number 64 is divisible by 4, the
number 178564 is divisible by 4. Divisibility by 9
If we take the number 476854, the last two digits form A number is divisible by 9 if the sum of its digits is a
54 which is not divisible by 4 and hence the number multiple of 9.
476854 is not divisible by 4.
For example, ifve take the number 6318, the sum of the
Divisibility by 5 digits of this number is 6 + 3 + 1+ 8which is 18. Since
A number is divisible by 5 if its last digit is 5 or zero this sum 18 is a multiple of 9, the number 6318 is divisible
(eg. 15, 40, etc.) by9. Similarly, the numbers 729, 981, etc. are divisible by
9.If we take the number 4763, the sum of the digits of this
Divisibility by 6 number is 20 which is not divisible by 9. Hence the
A number is divisible by 6 if it is divisible both by number 4763 is not divisible by 9.
2 and 3 (18, 42, 96, etc.)
Divisibility by 10
Divisibility by 7
A number divisible by 10 should end in zero.
If the difference between the number of tens in the number
and twice the units digit is divisible by 7, then the given Divisibility by 11
number is divisible by 7. Otherwise, it is not divisible by 7.
Take the units digit of the number, double it and subtract Anuriber is divisible by 11if the sum ofthe alternate digits
this figure from the remaining part of the number. If the the same or they differ by multiples of 11 - that is, the
result so obtained is divisible by 7, then the original difference between the sum of digits in odd places in tne
number is divisible by 7. If that result is not divisible by 7, number and the sum of the digits in the even places ln the
then the number is not divisible by 7. number should be equal to zero or a multiple of 11.
Triumphant tnstitute of Management Education Pvt. Ltd. (T.l.M.E.) IIO. 953. 2d loor. Siddan1sety Complex. Secunderabad - 500 0
SMI002208/5
Tel : 0440088400 Fax : (040-278-47334 email : intoa umetcducation com website : www.time4cducation.com
 original
step is divisible by 19, the
last
Since 57 in the divisible by 19.
ror example, if we take the number 132, the sum of ne
digits in odd places is 1+ 2 =3 and the sum of the digits number 456760 is 37895. Let us
In even places is 3, Since these two sums are equal, tne example, the number
Let us take
another tll we reach a
given number is divisible by 11. process step by step
follow the above
If we take the number 785345. the sum of the digits in
odd manageable number.
10 so
places is 16 and the sum of the digits in even places is
Double the units digit 5 and add the
also 16. Since these tNO sums are equal, the 37895 We get
given obtained to 3789,
number is divisible by 11. and add the 18 so
3799 Double the units digit 9 Double the units
If we take the number 89394811, the sum of the digits in 397
obtained to 379. We get obtained to 39. We
odd places is 8 + 3 + 4 + 1, which is equal to 16. so
The sum of the digits in even places is 9 +9+8 + 1, which digit 7 and add the 14
is equal to 27. The difference between these two figures get 53. 37895 is not divisible by 19.
is 11 (27-16), which is a multiple of 11. Hence the given Since 53 is not divisible by 19,
number 89394811 is divisible by 11. FACTORSAND CO-PRIMESOFANUMBER
The number 74537 is not divisible by 11 because the sum
of the digits in odd places is 19 and the sum of the digits Number of Factors of a Number
even places is 7 and the difference of these two figures
aP. b. c
is 12 and this is not a multiple of 11. If N is acomposite number such that N =
where a, b, c are prime factors of N and p, g, r are
Divisibility by numbers like 12, 14, 15 can be checked out factors of N is given
by takingfactors of the number which are relatively prime positive integers, then the number of
and checking the divisibility of the given number by each by the expression
of the factors. For example, a number is divisible by 12 if it (p+ 1)(q + 1) (r + 1) ...
is divisible both by 3 and 4.
For example 140 = 22 x 5' x 71.
Hence 140 has (2 + 1)(1 + 1)X(1 + 1), i.e., 12 factors.
The next number that is of interest to us from divisibility
point of view is 19. Please note that the figure arrived at by using the above
formula includes 1 and the given number N also as
Divisibility by 19 factors. So if you want to find the number of factors the
given number has excluding 1 and the number itself, we
If the sum of the number of tens in the number and twice
find out (p+1) (g + 1) (r + 1) and then subtract 2 from that
the units digit is divisible by 19, then the given number is figure.
divisible by 19. Otherwise it is not.
In the above example, the number 140 has 10 factors
Take the units digit of the number, double it and add this excluding 1and itself.
figure to the remaining part of the number. If the result so
obtained is divisible by 19, then the original number is Number of ways. of expressing a given number as a
divisible by 19. If that result is not divisible by 19, then the product of two factorst
number is not divisible by 19.
The given number N (which can be written as equal to aP.
For example let us take the number 665. The units digit is b9, c where a, b, care primne factors of N and p, g.
5 and when it is doubled, we gee 10. The remaining part r.. are positive integers) can be expressed as the
of the number is 66. If 10(which is the units digit doubled) product of two factors in different ways.
added to 66 we get 76. Since this result 76 is divisible
by 19, the original number 665 is also divisible by 19. The number of ways in which this can be done is
the expression 1/2 {(p + 1)(g+ 1)(r + 1)...) given by
Similarly; if we take 969, doubling the units digit gives
18 which when added to 96 gives a result of 114, Since So, 140 can be expressed as a product of two
114 is divisible by 19, the number 969 is divisible by 19. 12/2 or 6 ways (because (p + 1) (q + 1) (r+ 1) in factors
the
in
If we take 873, double the units digit (2 x3 = 6) added to of 140 is equal to 12} case
the remaining part of the number (87), we get 93 which is If p, q, r, etc. are all even, then the product (p + 1) (q
not divisible by 19. Hence the original number 873 is not (r + 1)...... becomes odd and the above rule will
+ 1)
divisible by 19. not be
valid since we cannot take 1/2 of an odd number to
get
If we take a larger number, the same rule may have to be the number of ways. If p, q,r, ... are all even, it
means that
repeatedly applied till the result comes to anumber which the number N is aperfect square. This
we can make out by observation whether it is divisitble by the specific cases of perfect squares situation arises in
19. For example, take 456760. We will write down the because a
square can also be written as (square root xX perfect
figures invarious steps as shown below. So, two different cases arise in square root).
case perfect squares
depending on whether we would like toof consider writing
the number as {square root x
Col(1) Col (2) Col (3) Col(3) the ways. square root) also as one of
Number Twice the Remaining + Col(2)
units digit part of the Thus, to find out the number of way[ in
number square can be expressed as aproduct of 2
which a perfect
have the following 2 rules factors, we
45676 45676
456760 (1) as a product of two
(q+ 1)(r +1) ... -1)DIFFERENT
4579
45676 12 4567
457 475 factors:/½ {(p + 1)
ways
(2) as a product of two (excluding N xN).
18
4579 47 57
10
475
in 1/2 {(p + 1)\q + factors
1)(r + 1) .... + 1}(including NxN)
Managernent Education Pvt. Ltd. (T..M.E) IIO. 95B. 2Hd Floor, ways.
Triumphant Institute of
Tel : 040-40088400 Fax : 04(-27847334 emnail
: mtoutme4vducatuon,CUm
website :
Siddan1setty Complex, Secunderabad - 500 003.
www.timcAeducation.com SMI002208/6
 Hence, sum of all the factors
1.07. Find the number of factors of 1225.
product of 124
Sol: If a number can be expressed as a 2
prime factors like
16. 24, 48.
aP xb9 x cx
The list of factors of 48 is 1, 2, 3, 4, 6, 8, 12.
where a, b, c, .are the prime numbers, then 124 and tallies with
the number of factors of the number is (p + 1) If these factors are added, the sum is
(q+ 1) (r+ 1). the above result.
First express 1.225 as a product of its prime Product of all the factors of a number
factors. (Note that to express a given number as
need to
a product of its prime factors, we first numbéer by The following examples explain the method of
finding the
prine factors of the given
identify the product of all the factors of a number.
applying the rules of divisibility.)
1225 =5 x7 x5 x7= 5² x72 1.11. What is the product of all the factors of 180?
Hence. the number of factors 1225 has is
(2 + 1) (2 + 1) = 9 Sol: 180 = 4(45) = 223251.
There are (2+1)(2+1)(1+1), viz. 18 factors.
1.08. How many divisors excluding 1 and itself does If the given number is not a perfect square, at
the number 4320 have?
least one of the indices is odd and the number of
Note that the two terms factors and divisors are factors is even. We can form pairs such that the
Sol:
used interchangeably. First express 4320 in product of the two numbers in each pair is the
terms of its prime factors. given number (180 in this example).
4320 = 18 x 24 x 10
=3 x 3x 2x3x 2 x 2x 2 x 2x 5 .:. The required product is 1809.
= 33 x 25 x 51
Hence 4320 has (3 + 1) (5 +.1) (1 + 1) = 48 In general, if N = p²g r (where at least one of a
factors. Excluding.1 and itself, the number has (48 b, c is odd), the product of all the factors of N is
d
- 2) = 46 factors.
N2. where dis the number of factors of N and is
1.09. In howN many ways can 3420 be written as a
product of two factors?
given by (a+1)(b+1) (c+1).
1.12. Let us see what happens when N is a perfèct
Sol: By prime factorisation 3420 square. Find the product of all the factors of 36.
=2 x5x 2 x 19x 32 = 22 x32 x5 x 191
If a number is expressed as product of prime Sol: 36 = 2232 (there are 9 factors)
factors, like aP xbxcx.....where a, b,c,..... are 1(36) = 2(18) = 3(12) = 4(9) = 6(6)
prime numbers, then the number of ways in which .. The product of all the factors is 36 (6).
the number can be expressed as a product of two
factors = 1/2 [(p + 1) (q + 1) (r+ 1)........] In general, let N=p² g r where each of a. b, c
Hence, 3420 can be written as product of two is even.
factors in 2[(2 + 1) (2 + 1) (1 + 1) (1 + 1)] There are (a + 1)(b + 1) (c + 1) say d factors. We
= 18 ways d-1 pairs and we would be left with
can form
2
1.10. In how many ways can the number 52900 be
written as a product of two different factors? one lone factor, i.e., /N. The product of all these
Sol: First expressing 52900 as a product of its prime d-1
factors, we get 52900 = 232 x 22 x 52. Since all the factors is N2 (/N)= N2
powers are even, the given number is a perfect ,:. Whether or not N is a perfect square, the
square. (Remember we can look at witing the d
number as a product of tWo factors either
product of all its factors is N2, where d is the
including orexcluding the "square root Xsquare number of factors of N,
root". Since we have to find the number of ways
of writing the number as a product of two 1.13. What is the product of all the factors of 1728?
"different" factors, we cannot consider square Sol: The product of the factors of a positive integer N
root x square root) is Nk/2, where k is the number of factors of N.
So, required number of ways is Now 1728 = 123 = 253 andk= (6 + 1)(3 + 1) = 28
1/2 {(2 + 1)(2 + 1)(2 + 1) -1}= 1/2(27- 1) = 13 .. The product of all the factors of 1728
= 172814
Sum of allthe factors of a number
If anumber N = aP. b. c' where a, b, c. are Numberofways ofwritinga number as produet of twoco
prime numbers and p, q.r.....are positive integers, then, primes
the sum of all the factors of N (including 1 and the number
itself) is Using the same notation and convention used earlier.
If N =aP. b. c.., the number of ways of writing Nas a
product of 2 co-primes is]2n1, where 'n' is the number of
distinct prime factors of the given number N.
The above can be verified by an example. Taking the example of 48, which is 24x 31, the value of n
Consider the number 48. When resolved into prime is 2because only two distinct prime factors (i.e. 2 and 3
factors, 48 = 2 x 31. Here a =2, b=3, p =4, q = 1. only) are involved.
Triumphant Institute of Management Education Pvt. Ltd. (T.I.M.E.) IIO: 9SB, 2d 1Floor, Sidd:amsety Complex. Seeunderabad 500 003
Tel: 040-40088-4(M) Fax : 040-27847334 email : intoatimededucation.com website: www.meteducation com SNU002208/7
Hence, the number of wavs = 2-1 = 21 : 2 of HCF
Written as product of 2 co-primes, in two i.e. 48 can be LCM is a multiple
They are (1, 48) and (3, 16). different ways. reduce each
finding LCM and HCF of fractions, first common
For i.e.. cancel out any
Number of co-primes to N,that are less than N fraction to its simplest form numerator and then
denominator and
factors betweenthe
If N is anumber that can be written as n:b. C the following:
then, thè number of co-primes apply appropriate formula from
of N. which are less than HCF of numerators
N, represented by (N) is,
HCF of fractions LCM of denominators

LCM of numerators
For example if, 48 is considered, LCM of fractions HCF of denominators
N=aP. b9, c i.e. 48 =24.31
Hence, a =2, b=3, p =4, q = 1.
LCM and HCF can each be found by either of two
(48) = 48 = 48 % 1 2 = 16. methods:
2 3 (1) Factorization (2) Long Division
Note: If numbers less than 48 are listed, and
to 48 are spotted, the count of co-primes We willlook, at both the methods.
co-primes will be 16.
LCM by Factorization
Sum of co-primes to N that are less than N
The sum of the co-primes of N, that are less Resolve the numbers into prime factors. Then multiply the
than N is product of all the prime factors of the first number by those
.6(N), If we consider the above example, prime factors of the second number, which are not
al:eady we common to the prime factors of the first number.
have (48) = 16.
Hence, sum of co-primes of 48 that are less than 48 This product is then multiplied by those prime factors of
48 the third number, which are not common to the prime
(N) = x 16 = 384 factors of the first two numbers.
2
Note: After listing the co-primes of 48 that are less than
48, they can be added and the sum can be verified. In this manner: all the given numbers have to be dealt
with
and the last product will be the required LCM.
1.14. Find the largest three digit multiple of 32.
In other words, tak the product of ALL the
Sol. of. all the numbers except where a factor is
prime factors
Largest three digit number = 999. When 999 is
divided by 32, the remainder is 7 more than one number, it is taken only ONCE occurring in
in the
:.999 -7=992 is the largest three digit multiple product. This product is the LCM of all the numnbers.
of 32.
LCM by Long Division
1.15. Find the smallest four digit multiple of 32. Select any one prime factor common to at least two of the
Sol. Smallest four digit multiple of 32 given numbers. Write the given numbers in a line
and
= Largest three digit multiple of 32+32 divide them by the above prime number. Write down the
= 992 + 32 = 1024. quotient for every numb,.r under the number itself. If any of
the -numbers is not divis1ble by the prime factor
LEAST COMMON MULTIPLE (LCM) AND selected,
write the number as it is in the line of quotients.
HIGHEST COMMON FACTOR (HCF)
Repeat this process for the line of quotients until you get
Least Common Multiple (LCM) of two or more numbers is a line of quotients, which are prime to
the least number which is divisible by each of these each other
numbers (i.e. leaves no remainder; or remainder is zero). (i.e.. no two "quotients" should have a common factor)
The sarne can be algebraically defined as "LCM of two or The product of all the divisors and the
numbers in the last
more expressions is the expression of the lowest line wil| be the required LCM.
dimension which is divisible by each of them i.e. leaves
no remainder, or remainder is zero" HCF by Factorization
Resolve the given number into prime factors.
Highest Common Factor (HCF) is the largest factor of two The product of the prime factors common to all
or more given nunbers. The same can be defined the
numbers will be the required HCF
algebraically as "HCF of twO or more algebraical
or highest dimension which
expressions is the expression remainder
each of thern without 1.16. Find the HCF and LCM of 288, 432
divides
Common Divisor) using factorisation method. and 768
HCE is also called GCD (Greatest
HCE Sol. 288 = (24) (12)
Product of two numbers = LCM x 432 = (24) (18) and 768 = (24) (32)
Managernent Education Pt. Ltd. (T.L.M.E.) HO 95B. 2d Floor.
Triumphant Institute of Siddamsetty Complex.
:40-27841354 emajl : infoutimedviueoss. Secunderabad - 500 003
-Tel 40-4K)88400 Fax website: wwy timeteducation com SM1002208/8
 HCF 288, 432, 768 = 24x HCF (12, 18, 32) remainder given, i.e., add the remainder (which is the
same in all cases) to the LCM of the given numbers (i.e..
= 24 x 2= 48
LCM (288, 432, 768) = 24x LCM (12, 18, 32) divisors).
= 24 x 288 = 6912
To find any larger number that satisfies a given condition,
we will first need to find out a multiple of the LCM in that
HCFby Long Division range and add the remainder to this muitiple of the LCM.

Take two numbers. Divide the greater by the simaller; then The general rule can be written as follows:
divide the divisor by the remainder; divide the divisor of
this division by the next remainder and so on until the
remainder is zero. The last divisor is the HCF of the two Any number which when divided by p, qor r
numbers taken. leaving the same remainder s in each case will be
of the form k (LCM of p, q and r) +s
By the same nethod find the HCF of this HCF and the
third number. ThËs will be the HCF of the three numbers. where k = 0, 1,2,

1.17. Find the HCF of 288. and 432 using long division If we take k = 0, then we get the smallest such
method. Also find their LCM by division method. number.

Sol: HCF: Let us first find HCF of 288 and 432

1.18. Find the HCF of 1363 and 1457.
1
288 432
288
2 Sol: 1363)1457 (1
1363
144 288
288 9a)1362(14
1316

0 47)94(2
.. HCF of 288 and 432 is 144.
LCM:
.. HCF.(1367, 1457) = 47
288, 432
2 144, 216 1.19. Find the smallest number which when divided by
2 5 or 11 leaves aremainder of 4 and is greater
72, 108 than the remainder.
2
36, 54
Sol: Set of such numbers are of the form
3 27
18, K[LCM (5, 11)] + 4where K is a whole number.
3
6 We get the required number when K=1
Smallest number = LCM (5, 11) + 4
2, 3 =55 + 4= 59.
LCM of 288 and 432 1.20. Find the largest three-digit number which when
= (2) (2) (2)(2) (3) (3) (2) (3) divided by 8 or 12 leaves a remainder of 2 in each
= 25 x 33 = (32) (27) = 864 case.

LCM AND HCF MODELS Sol: Required number must leave a remainder of
2when divided by LCM (8, 12) = 24.
LCM- Model 1 It must be of the form 24K + 2 where K is the
In this model of problem, you will need to find out the
largest natural number satisfying 24K +2 < 1000.
smallest number (or number a specified range like the
largest five-digit numnber) which when divided by 2 or more K< 41 K= 41.
other numbers (i.e., divisors) leaves the same remainder 12

in all cases. Largest number = 986.

which when divided by
The basic distinguishing feature of this model of problems 1.21. Find the smallest number
is that the remainder will be the same in all the cases (and remainder of 1 and is greater
4, 11 or 13 leaves a
that remainder will also be given). than the remainder.
The smallest such number will be the remainder itself. The
13) +1=573.
next higher number that satisfies the given conditions is Sol: Required number= LCM(4, 11,
the LCM of the given numbers (i.e., divisors) plus the
Triumphant Institute of Management Education Pvt. Ltd. Secunderabad- 500003.
(T.I.M.E.) HO: 9SB. 2nd Floor. Siddamsetty Complex, SMI002208/9
Tel : 040-40088400 Fax :040-27847334 email: intoaune4cducation com Website : www.timeteducation.cOm
 LCM - Mod¢ 2 LCM - Model 3
In this model, the the same and
In this model the remainders will not be
be the same but remainders
the
in the divisions given will
not the differences between each of the given divisors
the remainder (i.e. thedifference between the divisor and
even the
remain
be the same in complement of the remainder) will and the corresponding remainders also will not
to find out "the each case. For example, you may be asked same.
6 gives smallest number which when divided by 4 or Let us take an example and see how to solve this type of
respective remaindersas of 3 and 5." Here, the problem.
remainders are not the same in LCM - Model 1; but the
difference between the
in each case: In the firstdivisor and the remainderis same Find out the smallest number which when divided by 7
gives a remainder of 3 and when divided by 5 gives the
divisor and the remaindercase the difference
is 1( 4-3). In the between the remainder of 2.
also the difference
is 1(= 6- 5). between the divisor and thesecond case
remainder Sol: Here, the remainders are not the same. The
The difference between the divisor and the remainder
smallest such number is LCM minus in the first case is 4 and in the second case, is 3.
difference(the constant constant
difference being the difference
between the divisor and the Take the larger of the two given divisors -7 in this case.
all cases). corresponding remainder in The required number, when divided by 7 gives a
remainder of 3. We know that anumber when divided by
Similarly, any multiple of the LCM minus the 7 giving a remainder of 3 is of the form 7k +3, which means
remainder also
In
will satisfy the same
condition.
constant we are looking for a number of the form 7k + 3.
the example
considered above, the LCM of 4 and 6 is
12 and hence the Since the same number, when divided by5 gives a
to 12 - 1). required number is 11 (which is equal remainder of 2, this number (7k + 3) when divided by
5 gives a remainder of 2. We
know that if there is a
The general rule can be
remainder in a division, by subtracting the remainder from
written as follows: the given number, the resulting number will then
exactly divisible by the divisor. be
Any number which when
divided by p, q or r subtracted from(7k +3), the resulting This means, if 2 is
leaves respective remainders of s,.t and u be exactly divisible by 5. We should number, i.e., 7k + 1 will
1, 2, .... to k and find out for now give values of 0,
where (p - s) = (g-t) = (r- u) v(say), will what value ofk, 7k + 1 will be
be of the form k (LCM of p, q divisible by 5.
and r) - v
yThe smallest value of k
The smallest such number will be
obtained condition, we notice, is 2 andwhich satisfies the above
by substituting k=1. number that we are looking for.hence k =2will give us a
Since the number, we
said, is 7k +3the numnber is 7 x
2+3 i.e.
smallest number which satisfies the two 17. So 17 is the
1.22. Find the smallest number which when given conditions.
divided by The next higher number
obtained by adding LCM ofwhich
9 and 11 leaves
remainders of 7 and 9 satisfies this condition is
7 and 5 to the
respectively. 17 found above. In this smallest number
Sol: Required number =LCM (9, 11)-2=97. (which is LCM of the twomanner by adding
given numbers) tomultiples of 35
series of numbers that satisfy 17, we get a
1.23. other words any number of the formthe given conditions. In
Find the largest four-digit number which when (35m + 17) will satisfy
divided by 9 and 11 leaves remainders of 7 and the given conditions.
9 respectively.
From this, we can also find out
Sol: Required number must be in the form LCM number, largest 5 digit number, etc.thethatsmallest 4 digit
will satisfy the
(9, 11) K-2i.e. 99K -2, where K is the largest given conditions.
natural number satisfying 99K -2< 10000. For example, let us find out
. . K< 101 that the largest five-digit
satisfies the conditions that the number
divided by 7 andremainders
33
2 respectively when are 3 and
.:. K= 101 5.
.. Largest number = 9997 Since we know that any
condition will be of the formnumber that satisfies the above
1.24. Find the smallest six-digit number which leaves largest 5-digit such number,(35m we
+ 17) and we
want the
aremainder of 10 when divided by 13 and leaves close to 99999, i.e., 35m+17 need to find a
a remainder of 4 when divided by 7. we need to find a 99999 35mn number s
to 99982 (and we multiple of 35 which less than or 99982
Sol: Required number must be in the form have
multiple of a given numberalready learnt how to findegual
LCM (13. 7) K - 3 i.e. 91K 3, where K is the
another which is less than or equaltheto
smallest natural number satisfying 91K 3 > to 99982given number). A
is 99960 (i.e., multiple of 35 less than or
100000 number which 35m =
is 35m + 1799960). Hence the equal
100003
1098
85
99960 17, i.e., 99977
+ will then be reguired
K
91 91 equal to
.. K= 1099
1.25. Find the
Smallest number =100006
remainder ofsmallest
7 when number which leaves a
Education remainder of 12 whendivided by 11 and leaves a
Triumphant Institute of
Management Pvt. Ltd. (T.I.M.E.) IO:
34 email : int 95B.2d or, divided by 13.
: x : 04)-278473 infoa Siddasetly Complex,
04(400884!
timededucation.com
www.time4education.comSecunderabadSMI002208/10
Tel:
website : - 500 003.
 Sol: Let the number be in the forms 1 1K, +7 and 13K2 2, then the quotients and remainders are as follows in the
+ 12 where K1 and K2 have the least possible successive division.
values. Dividend/Divisor Quotient Remainder
11Ki + 7= 13K,+ 12
826
K, =K, + 2K, +5 2479
5 165
11 826
165 7 23
As K, is an integer, 2K, +5 must be divisible by 11. 23 2 11 1
Hence K2 =3.
.Smallest number = 51. Here we say that when 2479 is successively divided by 3, 5,
7 and 2 the respective remainders are 1, 1, 4 and 2.
HCF- Model 1
In this model, we have to identify the largest number that 1.28. A number when divided by 6 and
exactly divides the given dividends (which are obtained by 4 successively leaves remainders of 5 and 2
respectively. Find the remainder when the
Subtracting the respective remainders from the given largest such two digit number is divided by 9.
numbers).
Sol: Let the quotients obtained when the number is
The largest number with which the numbers p. divided by 6 and 4 successively be gi and qz
qor rare divided giving remainders of s, t and respectively.
urespectively will be the HCF of the three Number = 6q1 + 5
In successive division, the quotient obtained for
numbers (p -s), (q-t) and (r- u).
each division starting from the first, forms the
dividend for the next division.
Let us understand this model with an example. .. q1 = 4q2 + 2
1.26. Find the largest number which leaves number=6 (4g2 + 2) + 5 = 24g2 + 17
remainders of 2 and 3 when it divides 89 and 148 Largest two-digit number satisfying the given
respectively. conditions is obtained when 24 gT + 17 < 100 and

Sol: Largest number = HCF (89 --2, 148 - 3) gz is maximum i.e. q2 < 3 and it is maximum
24
= 29
i.e., q2 =3.
HCF- Model 2 ..number = 89. Required remainder = 8

In this mòdel, the problem will be as follows: Alternative Method:

"Find the largest number with which if we divide the Divisors:
4
numbersp, q and r, the remainders are the same." 6
Take the difference between any two pairs out of the three 5 2
given numbers. Let us say we take the two differences (p Remainders :
- ) and (p - ). The HCF of these numbers will be the The smallest number satisfying the given
required number. conditions is found by using the following
method. Each divisor and the remainder it leaves
Here, the required number = HCF of (p - q) are written as shown above. Starting with the last
remainder, each remainder is multiplied with the
and (p -r) = HCF of (p - q) and (q r)=
HCF of (g-r) and (p-) previous divjsor and added to that divisor's
remainder. This procedure is carried out until the
divisor's remainder is the first remainder.
Let us take an example and look at this model.
1.27. Smallest possible value of the number
Find the largest number which divides 444, 804 = (6) (2) +5= 17
and 1344 leaving the same remainder in each General form of the number = k (6 4) + 17
case.
= 24k + 17 wherek is any whole number.
Sol: Largest number The number would be the largest two-digit
= HCF (804 - 444, 1344 804) number when 24k + 17 < 100 and k is maximum
= HCF (360, 540)= 180. ie. k < 31/24 and k is mnaximum ie. k = 3.
Largest two-digit number = 89
SUCCESSIVE DIVISION .. required remainder = 8
If the quotient of adivision is taken and this is used as the 1.29. Anumber when divided by 3,5 and 6 successively
dividend in the next division, such a division is called leaves remainders of 1, 3 and 2 respectively.
"'successive division." A successive division process can Find the number of possible values it can
continue up to ary number of steps - until the quotient in assume which are less than 1000.
a division becomes zero for the first time. i.e., the quotient
in the first division is taken as dividend and divided in the Sol: Let the quotients obtained when the number is
second division; the quotient in the second division is divided by 3, 5 and 6 successively be q1, q2 and
taken as the dividend in the third division; the quotient in q3 respectively.
the third division is taken as the dividend in the fourth Number = 3 q1 + 1
division and so on. q1=5q2 +3
If we say that 2479 is divided successively by 3, 5, 7 and q2 = 6g3 + 2
Triumphant Institute of Management Education Pvt. Ltd. (T.L.M.E.) II0: 95B. 2d Floor. SiddansetUy ('omplex, Secunderab;ad - SO0 (003.
Tel: 04040088400 Fax :04-27847334 email : inloatine4cducation.com website : www.tine4cducation com SMI002208/11
 256!, without
of7 that can divide
Find the IGP be concisely
1.31. remainder. (This can
.:. number =3 (5g2 +3) leaving any
of P in N!)
=3 (5(6q3 +2) +3) +1 = 90q3 +40 stated as find the IGP the detailed
90q3 + 40 < 1000 we shall take a look at method for
Sol: First at a simple
q3 < 102 explanation and then look 256! in
When we write N =
solving the problem. have 256 x 255 x 254 x...
.. q3 has 11possibilities i.e. 0to 10. we
its expanded form,
x3 x2 x 1
Alternative method: power of 7, we have the
When we divide 256! by a the numrator. The
in
Divisors 6 first 256 natural numbers 256 numbers
5 denominator will have only 7's. The
multiples of 7 which are
Remainders: 1 2 in the numerator have 36 of these,
7, 14.21 252. Corresponding to eachwhich will
denominator
Smallest possible value of the number we can have a 7 in the
=((5 2) +3] 3) +1 =40 divide Ncompletely without leaving any remainder
General form of the number=kx (3x5 x 6) + 40 i.e., 736 can definitely divide 256! Further, every
= 90 k + 40, where k is any whole number. multiple of 49 after cancelling out 7 as above, will
still have one more 7 left. Hence for every multiple
If 90 k + 40 < 1000, k < 10 ? of 49 N we can have an additional7 in the
3

.:. k has 11 possibilities (i.e., 0 to 10) denominator. There are 5 multiples of 49 in 256!
Hence we can have a 75 in the denominator. As
1.30. Anumber whendivided by 3,5 and 6 successively 735+5 = 741, 41 is the IGP.
leaves remainders of 1, 3 and 2 respectively. The above calculation is summarised below.
Find the remainders if its smallest possible value Successively dividing 256 by 7, we get:
is divided successively by 6, 5 and 3.
7 \256
Sol: Divisors 5 7365
Remainders 3 Add all the quotients to get 36 + 5 = 41.
So the IGP of 7 contained in 256! is 41.
Smallest possible number
= (2) (5) + 3)3 + 1 = 40 Please note that this method is applicable only if the
Required remairders are 4, 1and 1. number whose greatest power is to be found out is a
prime number.
Factorial 1.32.. Find the IGP of 3 in 599!

Factorial is first defined for positive integers. It is denoted Sol: Divide 599 successively by 3
by Z or !. Thus "Factorial n" is written as n! or /n. n! is 3 599
defined as the product of all the integers from 1to n. 3 199 ’ quotient
3 66 >quotient
Thus n! = 1.2.3. n(n 1) n. 3 22 -’ quotient
0! is defined to be equal to 1. 3
0! = 1and, 1! is also equal to 1. 7 ’ quotient
2
IGPof a Divisor in a Number Add all the quotients,
199 + 66 + 22 +7+2=296
Very often we would like to know how many times we can Hence, 296 is the largest power of 3 that divides
divide a given number by another and continue to get 599! without leaving any remainder.
integral quotients. We first consider prime divisors and
then other divisors. 1.33. Find the IGP of 10 that can divide 890!.
If a single number is given we simply represent it in its Sol: Here we cannot apply the successive division
canonical form (the simplest and the most convenient method as 10 is not aprime number, We know
form). For example, consider N= 258,048. 10 can be written as 2 x 5 and these are
numbers. So we find the largest powers of prime
2 and
Bytrial we express N = 212371. VWe see immediately that 5 respectively that can divide
N can be divided by 2 a total of 12 times, by 3 two times 890! and the
and by 7 just once. In other words the index of
smaller of the two indices is the index of the
required power.
the greatest power (1GP) of 2 in N is 12. of 3 is 2 and of 7
is 1. 2 890
2 445
IGP of a number in N! 2 222
This model involves finding the index of the greatest
2 111
of a given
power (IGP) ofa divisor that divides the factorial
b' means the
2 55
divIdes 2 27
number (say N) (The statement a
say
remainder of b divided by 'a is 0. In this case, we also 2 13
a'.) Let uS understand this type of problem 2 6
b is divisible by
example. 2 3
with the help of an
Management Education Pvt. Ltd. (T.L.M.E) IIO
Triumphant Institute of 95B, 2d Floor,
Tel : 40-44008840) Fax :
040-27847334 euail : nivutimc4educallon.com
website: www
Siddamsetly Complex. Secunderabad - s00 003.
tinie4education com
SMI002208/12
 Sum of the quotients = 883 a'-b²= (a + b)(a - b)
5 890 Identities with two symbols (degree 3)
5 178 (a + b)³ =a +3a?b +3ab² +b3
35 .(a -b)³= a³ -3a?b + 3ab² -b
7 a + b³=(a + b)(a? ab + b)
1 a - b = (a b)(a? + ab + b2)
Sum of the quotients = 221
Since the largest power of 5 is the smaller, the largest ldentities with three symbols (degree 2)
(a + b + c)²=a? + b² + c + 2ab + 2ac + 2bc
power of 10 (i.e., 2x 5) is 221. (a + b- c)² = a² + b² + c + 2ab - 2ac- 2bc
If the divisor (say D) is not aprime number, we resolve it (a -b- c? = a? + b? + c'-2ab - 2ac + 2bc
into its prime factors. Let D=p"q (where p, qare primes (x + a)(x + b) = x + x(a + b) + ab
and m, n are positive integers). We first determine the lGP ldentities with three symbols (degree 3)
of p that divides N and the IGP of q that divides N, Let (a + b\(b +c)\c + a) =a(b? +c') + b(c? + a') + c(a' +b') a
these be a and b respectively. Therefore, the IGP of pm + 2abc =a'(b +c) + b{c +a) + ca +b) + 2abc
= ab(a +b)+ bc(b+ c) + ca(c + a) + 2abc
that divides Nis and the IGP of g that divides N is (a + b + c\a' + b? + c- ab - bc - ca) = a + b³ +
c-3abc)
Finally, the IGP of D that divides N is the smaller Examples:
1122 (100 + 12)2
a b 1002 + (2 x 100 x 12) + 122 = 12544
m
and xis the greatest integer less than 892 (100 11)2
1002 - (2 x 100 x 11) + 112 = 7921
or equal to x.] 17 x 23 = (20-3)(20 + 3) = 202 -32 = 391
1.34. Find the IGP of 12 in 50! 172 (17 +3)(17 - 3) + 32
20 x14 +9= 289
Sol: 12 = 223. 392 (39 + 1)(39 1) + 12 = 40 >x 38 + 12
The IGP of 2 in 50! is obtained by successive 1520 + 1 =1521
division as shown below. 133 (10 + 3)
Number/Quotient 5025| 12 6 3 1 10° + 33 + (3 x 10x 3)(10 +3 ) =2197
Divisor 22 222 SOME IMPORTANT POINTS
The IGP of 2in 50! is 25 + 12 +6 +3 +1 =47 Please note the following points which will be very useful
47 in solvingproblems on Numbers.
The IGP of 22 in 50! is = 23

The IGP of 3in 50! is 16 +5+ 1 = 22

1 When any two consecutive integers are taken, one of
.:: The IGP of 12 in 50! is the smaller of 23 and
them is odd and the other is even. Hence the product
of any two consecutive integers is always even i.e.
22, viz 22. divisible by 2.
The following two results will prove to be extremely useful Two consecutive integers can be written in the form
in problems on IGPs. of n andn-1or n and n + 1. Hence, any number of
the form n(n -1)or n(n + 1)will always be even.
Let the IGP of p in Aand B be m and n respectively.
(1) The IGP of pin AB is m+n. 2 Out of any 3 consecutive integers, one of them is
(2) (a) If m n, the IGP of p in A + B is the smaller of divisible by 3 and at least one of the three is definitely
m andn. even. Hence, the product of any
(b) If m =n, the IGP of p in A + Bis at least m. It 3 consecutive integers is always divisible by 6.
could be more. (For example the IGP of 2 in 58
Three consecutive integers can be of the form (n - 1),
is 1and the IGP of 2 in 6 is also 1. But the IGP n and (n + 1). The product of 3 consecutive integers
of 2 in 58 + 6 is 6.)
wiH be of the form (n - 1)n(n + 1) or n(n² 1) or
1.35. Find the IGP of 2in 31! + 32! + 33! +.... +40!. (n-n). Hence any number of the form (n-1)n(n + 1)
Sol: The IGP of 2in 31!is 15 +7 +3 + 1, viz 26. or n(n' - 1)or (n-n) will always be divisible by 6.
The IGP of 2 in 32! is 16 + 8 +t 4 + 2 + 1,viz 31 3 Out of any n consecutive integers, exactly one
The IGP of 2 in the other terms is 31 or more.
.:. The IGP of 2 in the given expression is 26. number will be divided by n and the product of n
consecutive integers willbe divisible by n!
ALGEBRAIC IDENTITIES 4 Any prime number greater than 3 can be written in the
form of 6k + 1 or 6k - 1. The explanation is.
There are a number of identities that we have studied in Let p be any prime number greater than 3. Consider
lower classes. We consolidate them here. We can class1fy the three consecutive integers (p - 1), p and (p + 1).
them on two criteria - the number of symbols that are Sir.ce p is a prime number greater than 3, p CANNOT
used and the degree of each term in the identity
be even. Since p is odd, both (p - 1) and (p + 1) will
ldentities with two symbols (degree 2) be even, ie., both are divisible by 2.
(a + bj² =a'+ 2ab + b? Also, since, out of any three consecutive integers,
(a -by² = a' - 2ab + b? one number will be divisible by 3, one of the three
Triumphant Institute of Management Education Pvt. Ltd. (T.I.M.E.) IIO 953. 2d Floor. Siddunsetly Conplcx, Secunderabad - 500 003
Tel : 040-0088400 Fax :(040-27847334 email : ntoa time4education çom website : www.inc4education, com SMMI002208/13
 (3-69+2.16> +(3.69-2 16
numbers (p-1). por (o +1) will be divisible by 3. But, Simplify: 3-69+2 16
Dce p I8 a prime number, that too greater than 3, 1.40.
pcannot be divisible by 3, Hence, either (p - 1) or
(p+ 1),one of them and onlyone of them, is definitely is in the form
divis1ble by 3. Sol. The given expression
I (p- 1) is divisible by 3, since it is also divisible by ((a+ b (a-b
2, it will be divisible by 6, ie.. it will be ofthe form 6k. a' +b?
If (p - 1) is of the form 6k, then p will be of the form
(6k + 1). where a 3-69 and b = 2. 16
If (p +1) is divisible by 3, since it is also divisible by
2, it will be divisible by 6, i.e. it will be of the form 6k. (a+ b (a -b 2la' b') 2
If (p +1) Is of the form 6k. thenpwill be of the form
a' b) a'b?
(6k - 1),
Hence any prime numbergreater than 3 will be of the 1.41. Simply:
form (6k +1) or (6k - 1).
(3.193.19/3.192.232.232.23 +
1.36. Find the HCF of 3 6 1.581.581.58-9.57/2.231.58]
and
5 10 20
[3-19 +2. 23' +158-(3.19X2 23)
Sol: To find the LCM or HCF of fractions, first express
all the fractions in their simplest form.
(3-191- 58)-(2-23X158)
HCF (fractions) =
Sol. The givern expression is in the forrn
HCF(numerator HCF(3,3,9) 3
a +b +c'-3abc
LCM(denominatas) LCM(5,5,20) 20 a +b+c-ab-bc-ca
1.37. Find the LCM of 3 6 and
9
where a=3.19, b= 2.23 and c= 158
5' 10 20

Sol: To find the LCM or HCF of fractions, first express a' tb c-3abc
all the fractions in their simplest form. atb+c
LCM (fractions) a'+b+c -ab-bc-ca
LCMnumerator LCM3,3,9) .:.The given expression equals 7.
HCF(dencminators HCF(5,5,20) 5
1.42. Simplify: 1.422 + 2.332 + 4.252 + (2.84) (2,33) +
1.38 Arrange the following in ascending order (4.66) (4.25) + (8.5) (1.42)
5 3 7
and Sol:
7'4 10 The given expression is in the form
al + b² + + 2ab + 2bc + 2ca where a =
Sol: b= 2.33 and c = 4.25
1.42,
LCM (10, 7, 4) = 140
7 98 a? + b? + c? + 2ab + 2bc + 2ca = (a + b
.: The given
+c)'
10 140 expression equals 64.
5 100
7 140
1.43. Simplify:4.56
+
x 4.56 x 4.56 + 3.44 × 3.44 +344
3
13.68 x 4.56 x 3.44 + 10.32 x 4.56 x 3.44.
105
4 140 Sol: The given
7 5
expression is in the form
a + b + 3ab +3ab?
10 7 4 where a = 4.56 and b = 3.44
a + b + 3ab + 3ab² = (a + b)
1.39. Test whether the number 12320 is divisible by 2, :The given expression equals 512.
3, 4, 5, 6,9, 10, 11 and 19.
(i1) Simplify: 4.56 x 4.56 x 4.56 -0.56 x
Sol. The numnber has its -last two digits divisible by 0.56 x 0.56
13.68 x 4.56 x 0.56 + 1.68 x 4.56 x 0.56
4 and ends with a 0.
it is divisible by 4 and hence by 2 and also by The given expression is in the form
10 and 5 a'- b' + 3ab²- 3a'b
The sun of the digit_ of the number is 8 where a = 4.56 and b= 0.56.
. it is not divisible by 3. Hence, it is neither a'- b' + 3ab' 3a'b = (a - b)
divis1ble by 6 nor by 9. :The given expression equals 64.
The sun of the digits in the odd places
= The sum of the digits in even places.
..The number is div1s1ble by 11.
Number of tens in the number +2 (units diait of
the nutnber) = 1232 which is not divisible by 19
19,
. the number is not divisible by

Education Pvt. Ltd.

Triumphant nstitute of Management (T.L.M.E.) I0. 95B. 2l 1'loor
Tet: 040 40088 00 Fax:
040278-47334 cmail :
uoameeducalion co1 website :
Siddan1selly Complex. Secunderab:ad 500 003
www.limeteducatio). com SMI002208/14
 b
Chapter -2
NUMBERS II
the last digit of
have already looked at finding out digit of 2°7 + 374 is 8
Last digit of any power We 374, Hence the last
powers like 267 and
The last digits of the powers of any number follow a cyclic +9 i.e.. 7.
last
pattern - i.e.,they repeat after certain number of steps. If product will be equal to the
we find out after how many stens the last digít of the Similarly, the last digit of a digits of the two given
last
powers of a number repeat, we can find out the last digit digit of the product of the
of any power of any number. numbers
Let us look at the powers of 2.
Last digit of 21 is 2 the product 267x 374 willbe
For example, the last digit ofproduct of the last digit of 267
Last digit of 22 is 4 equal to the last digit of the i.e., 2.
Last digit of 23 is 8 and the last digit of 374, i.e. the last digit of 8 x 9,
Last digit of 2* is 6. Hence the last digit of 247 x 374 is 2.
Last digit of 25 is 2.
2.01. Find the units digit of 14124 x 29123
Since the last digit of 25 is same as the last digit of 21, then
onwards the last digit will start repeating, i.e. last digits of Units digit of (14124 x 29123) = Units digit of (4124
25, 26. 27, 28 will be the same as those of 21, 22, 23, 21. Sol:
The last digit of 29 is again the same as the last digit of 2" x9123)
and so on. So, we have been able to identify that for The units digit of any power of 4 is 4 if the
powers of 2, the last digits repeat after every 4 steps. In exponent is odd and 6 if the exponent is even.
other words, whenever the power is a multiple of 4, the The units digit of any exponent of 9 is 9 if the
last digit of that number will be the same as the last
digit exponent is odd and 1 if the exponent is even.
of 2* .:. The required units digit is 4.
Suppose we want to find out the last digit of 267, we should Pattern method
look at a multiple of 4 which is less than or
equal to
power 67. Since 64 is a multiple of 4, the last digit of the
264
will be the same as the last digit of 2°. Similar to the last digit of the powers of a number
repeating in a certain pattern, the remainders of powers of
Then the last digits of 265, 266 267 will be the same as a number also follow a certain pattern. If we identify the
last digits of 2,22, 2 the pattern in which the remainders repeat, we can find out
267 is the same as the respectively. Hence the last digit of
last digit of 29, i.e. 8. the remainder of any division.
To understand this better, let us find the
Similarly. we can find out the last digit of 374 by writing pattern that
down the pattern of the powers of 3.
remainders follow when various powerS of 2 are divided
by 7.
Last digit of 3' is 3.
Last digit of 3 is 9. Remainder when 2' is divided by 7 is 2.
Last digit of 3 is 7. Remainder when2² is divided by 7is 4.
Last digit of 34 is 1. Remainder when 2 is divided by 7 is 1.
Last digit of 35 is 3. Remainder when 24 is divided by 7 is 2.
We find that the remainder
The last digit repeats after every 4 steps (like in the case after every 3 steps. So, repeats in the fourth step, ie.
of powers of 2). the remainder of 2 when
that when 2' is divided divided by 7 is the same as
To find the last digit of 374, we look for a multiple of 4 the remainder of 25 by 7, i.e., 2
is less than or equal to 74. Since 72 is which when divided by 7 is the same as
that when 22 is divided
multiple of 4, the by 7, i.e., 4
last digit of 372 will be the same as that of 34, Hence the the
that remainder
of 2° when
last digit of 374 will be the same as the last digit of 32, i.e. when 2 is divided by 7 is the same as
9. the remaindr ofdivided by 7, i.e., 1
2' when
that when 2' is divided by 7 is the same as
Last digit of a sum or product and so on. divided by 7, i.e., 2
Some problerms involve finding the last digit of the sum of If we take 24,
two numbers, each of which is a power of some integer. since 54 is divisible
For exarnple, you may be asked to find out the last digit of completes a
when 24 is cycle of 3 steps and
by 3. 254 itself
the sum 267 + 374 is divided by divided by 7 will be hence the
remainder
the same as that
7. Hence the when 2
In general, whern we want to find out the last digit of the 2.02.
Find the remainder is 1.
Sumof two numbers, we can just take the last digits of the
two numbers and add them up. That will. be the last diait Sol:
remainder of 343 when divided by 4.
Let us find the
of the sum. The last digit of 243 +456 will be the same as when the pattern that the
thesum of the last digits of the two numbers, i.e., the sum
of 3 and 6. which is 3. Simlariy, in the case of 207 + 2/4
4 successive powers ofremainders
3 are follow
divided
also, thelast digit will be equal to the sum of the last dig1ts Remainder of 3²3' when divided by 4 =3 by
Remainder
of
terms, 2° and 374
of the two
Triumphant Institute of
Managerñent Education Pvt. Ltd.
(T..M.E.) IIO
Remainder of 3 when divided by 4 =1
when divided by 4=3
040-27847334 euail: nfo@uneducauon y53.2d loor,
Tel :
04-40088400 Fax : COIm Siddamset
website: www. ly Complex,
timceducation.comSecunderabad S00 003.
SMI002208/26
 .:. The remainder repeats after 2 steps and it is 3 By remainder theorem, remainder is 2 (1)20 = 2.
when the exponent of 3 is odd and it is
1when the exponent of 3 is even. 2.05. Find the remainder when 297 is divided by 15.
.. Required remainder = 3 (since the power of 3
is odd). Sol: Let us find the pattern that the remainders follow
when successive powers of 2 are divided by 15.
Remainder Theorem Remainder when 2' is divided by 15 =2
We can also apply Remainder Theorem to find the
Remainder when 22 is divided by 15 = 4
Remainder when 2 is divided by 15 = 8
remainder in problems like the one discussed above. Let Remainder when 2* is divided by 15 = 1
us first lok at Remainder Theorem and understandit. Remainder when 25 is divided by 15 = 2
Remainder Theorem states that when f(X), a polynomial The remainder repeats after 4 steps.
function in x is divided by x - a, the remainder is f(a). 2'
. Required remainder = Remainder of 2
15
A polvnomial function in x is a function where x will appear 22
only in the fom of x' and not in any other form, where n is (since 97= 4(24) + 1)
a positive integer.
2.06. Find the remainder when 220 is divided by 5.
Let us take an example to understand Remainder
Theorem. Sol: From the above example, the units digit of
powers of 2 repeats after 4 steps.
When the function x² + 2x 3is divided by x - 1, the 2'
remainder will be f(1). This is because, as per Remainder .. Required remainder = Remainder of 2
Theorem.when the divisor is (X-a), the remainder is f(a).
Here the divisor is X- 1 and hence the remainder is f(1). Remainder theorem method
To get f1). we should substitute x = 1 in the given
equation. As we get f(1) = 0, the remainder in this case is 2201
0. (Note that when f(x) is divided by x-a, if the remainder
is 0. then x-a will be a factor of f(x). So, in this case, (x 5 22-(-1)
1) is a factor of x + 2x-3}. By remainder theorem, required remainder
When the function x² + 2x + 3 is divided by x + 1, the
= 2(-1) 190=2
reminder willbe f(-1), which is (-1) + 2(-1) +3, i.e., 2. 2.07. Find the remainder when 310" is divided by 10.
Now let us take the example of finding the remainder
when 2 is divided by 7 (which was solved by the Pattern
Sol: Let us find the pattern that remainders follow
Method above) and solve it by Remainder Theorem when the successive powers of 3 are divided by
10.
Method.
In the division 257, the dividend is 254 and the divisor is Remainder when 31 is divided by 10 is 3
Remainder when 3² is divided by 10 is 9
7. Since the numerator is in terms of powers of 2, express
the denominator also in terms of powers of 2. Inthis case, Remainder when 3 is divided by 10 is 7
7can be written as 8-1. which is 231. So, nowthat the Remainder when 3 is divided by 10 is 1
denominator is in terms of 23. the numerator, i.e., the Remainder when 35 is divided by 10is 3
dividend should be rewritten in terms of 2° which will be The remainder repeats after 4 steps.
(2)Te, Now, the given problem reduces to finding out the 3
.:. Required remainder = Remainder of =3
remainder when (29)18 is divided by 29 - 1. Here, if we 10
consider 2 as x, it is equivalent to finding out the
remainder when x is divided by (x - 1), which, as per As is evident from the above examples, the remainder
Remainder Theorem, is f(1), i.e., the remainder is theorem is more suited to cases where the denominator
abtained by substituting 1 in place of x. So. the remainder (i.e., the divisor) can be written in the form of one more or
will be (1)e ie., 1.
one less than some power of the base in the numerator.
2.03. For example, in case of 25/7, since the base in the
Find the remainder when 295 is divided by 9. numerator is 2, the denominator 7 has to be written as one
more or one less than some power of 2. In this case it can
Sol:
25 (2 be written as 2-1. In cases where it is not possible to
9 2-(-1) write it in this manner, applying the Pattern Method is the
easiest method.
By rermainder theorem, remainder is (-1)33 = -1
-1+9=8
Last two digits of a"
Note: Vhenever a negative remainder is obtained add
the divisor to get the equivalent positive remainder The terms of any Geometric progression (GP) leave a
cyclic pattern of remainders when divided byany divisor.
2.04. Find the remainder when 2° is divided by 7. The sequence of powers of the base 'a' is a GP with
common ratio equal to 'a'.

Sol:
270 2(2 Ifwe take the divisor as 100, the remainder is simply the
last two digits. We ll hnd it convenient to consider the
7 2-1 following 4 cases separately.
Triumphant Institute of Management Education P Ltd. (TJ.M.E)IO 95B. 2 Floor. Siddannsetty Complex. Secunderabad- 500 003.
Tel : (440884M) tax :(HO27847334 cmail : nioaumctcducation con website: www. unetcducation com SMI002208/27
 last two digits of
(1) If a ends in 0. the next number, we take only the only the last
square and all higher pOwers ed To get the take
next number, we
172, ie. 89. To get theWe need not perform the complete
in at least 2
(2) If a ends in zeroes.
5. the powers either all
end in 25 or end two digits of 17(89). units and tens digits.
The
alternately in 25 and 75. depending on whether the multiplication, We need only the tens digit - the
tens digit of a is even or are 3 parts to the
(3) If a ends in 1,3, 7 or 9. odd. units digit is 3 and there digit of 9(1)and 8(7).e. 6 +9 +
there is a carryover of 6, the units units digit of this, which is 1,
distinct remainders. The twentieth cycle
power
of at most 20
ends in 01 6. Again, we need only
the
The cycle length could also be s me
2, 4, 5 or 10. factor of 20, ie. 1. 13. Similarly, we can work
(4) If a ends in 2, 4, 6 or 8, The last two digits of 17 are
there is a
distinct remainders. The twentieth cycle of at most 20 out the other numbers

The cycle length could also be some power ends in 76 after every 4 steps
factor of 20 It is convenient to break the column in each row. This
(4.1) Moreover, if a (the units digit is found to be the same
4k, the second set
subsequent sets of 20 remainders are exactlyandthe allsame
the serves as a check to our calculations). After we get 01,
as the first set. the next 20 powers show the same pattern.
In the given example, as 673 = 20 (33) + 13. the 13h
(4.2) But if a = 4k + 2, it is not number in the list, ie. 37, is our answer.
last twO digits in any higher possible
to get 4k + 2 as the
power. All such powers are In general, we find that if we are interested in the last
multiples of 4. Consequently, of the forty 'two-digit
numbers (02, 04, 06, 08. 12, 14. 16. 18 92, 94. 96, 98) 2digits,we need to go up to at most 20 steps In some cases
only twenty, viz 04. 08, 12, 16, 24. 92. 96 can occur the period may be some factor of 20 (1, 2. 4, 5 or 10).
as the last two digits in the higher
etc. do OccUr, they can occur only as the
powers. If 02, 06. 14
first power. We Consider the powers of 01. The pattern is 01. 01, 01
find that the last two digits of a? are The period is 1.
obtained
50 to 4k + 2(For example, 221 ends in 52, 62 by adding
1421 ends in 64 etc.). Therefore, while the ends in 56, Consider powers of 49, 51 or 99. The patterns are
20 remainders is almost the same as the second set of 49, 01: 49. 01
first set (differing 51, 01: 51, 01
only in the first remainder), all
the same as the second set. subsequent
sets are exactly 99, 01; 99, 01... i.e. the period is 2.
The examples below will illustrate these points.
Consider powers of 07, 43. 57 or 93. The patterns are
Consider point (3) above 07, 49, 43. 01
The last two digits of su.cessive powers of 13 43. 49, 07. 01
are 13, 69, 57, 49, 93, 01.
97. 61..01: 13. 69, 97,61....01 etc. 93, 49, 57, 01... ie. the period is 4.
Consider point (4.1) above
The last two digits of successive powers of 4 are 04, 16, Consider powers of 21. The pattern is 21, 41. 61.81. 01:
64. 56. .76: 04. 16.....76, etc. 21, 41. ... The period is 5.

Consider point (4.2) above Consider powers of 29, 71 or 79. The

The last two digits of successive powers of 2 are 02, 04, 29, 41, 89, 81, 49, 21, 09, 61, 69, 01: patterns
29, 41
are
08. 16, .... 16: 52, 04, 08, 16, ... 76 ( instead of the 02, we 71, 41, 11, 81, 51, 21, 91, 61, 31, 01: 71, 41...
get 52) 79, 41, 39, 81, 99, 21, 59, 61, 19, 01; 79, 41.
The period is 10.
These 6 points, 1, 2, 3, 4, 4.1, 4.2 (whichever is 2.09:
applicable) should be used in all problems on the last two What are the last two digits of
3712455
digits. Sol: N=3712345 = 3712340 375 = 3720617
3720 375
ends in 01
2.08: F1nd the remainder when 81773 is divided by while 375 =37)* 37
(1369)² (37) = (69) (37)
100. Alternatively, find the last two digits E(4761)37)
of 817673 E (61)(37) = 2257.
.. N ends in 57.
Sol: We are interested only in the last two digits of N.
We need to consider only the last two digits of Note: a =bmeans a -b is
817, i.e., 17. Successive powers of 17 (or any considered diviSor divisible by the
other number) show a cyclic pattern, when 2.10: Find the
divided by 100 (or any other divisor). We can ist
these remainders until we discover the point
100 remainder when 1645* is divided by
where the repetition starts Sol: We need the last two
17 57 97 37 77 The last two digits of digits of 164359
89 69 49 29 09 As 359 =340
successive
pattern of cycle length 20. powers form a
t 19 and
think of the last two 164 = 100 +
digits of 641 as 64.
13 73 33 93 53 we can
2114
21 41 61 81 01 those of
Now 2'4 = 16384, It
N also ends in 84.
171 = 17 ends in 84
Triumphant Institute of Management Education Pvt. Lid (TA.ME) HO 93B.
040--40088400 Fax : 04-27847334
cmail : nfoa e
tuuke4education
Om 2E,: Siddan1seity Complex.
websile www
tunetcducation comSecunderabad
Tel: - 500 003
SNIIO02208/28
 2.11: Find the last two digits of 282#22 Wilson's Theorem: If pis prime, (p -1)! +1 is a multiple of p.

Sol: N= 282822, We can thínk of 822 = 6724 For example,

..N ends in 24 (2- 1)! + 1= 2(1), (3-1)! + 1 =3(1), (5- 1)! + 1 =5(5),
(7-1)! + 1=721 =7(103) and so on.
Some important theorcms 2.16: What is the remainder when 28! is divided by 29?
Binomial Theorem: For any natural number n,(a + by
=Co a + °C1an1b + "C,an?b? + + "Ciab1 +"C,br, Sol: By Wilson's theorem, Rem 281 -0
"C, is the number of ways of choosing r objects out of n 29
distinct objects and is given by Rem =-1 or -1+ 29 = 28
n 29
nc. = n(n -1)(n- 2).(n -r 1) -
1(2)\3)..(r) rl(n-r)!
It can be observed that (a + b) =a" + (Some multiple of Remainder of a number when divided by 10" ± 1
b) =(Some multiple of a) + bn
This is best illustrated with examples.
2.12: Show that (a + b)- a' - b' is a multiple of 7 for 2.17: Find the remainder when 123123 (up to 300
all positive integral values of a and b. digits) is divided by 999.
Sol: (a + b)' = 'Coa' + C, a b+ C, a5 b² +7C% a b3 Sol: To find the remainder when some number (say
+...+ C, b? N)is divided by 9 (or 10' -1), we add up all the
(a + b)'-a' - b'= iC, a b + C, a b? 47C3 af b3 digits ofN to get (say S1) and divide S by 9.
+ + 7Cs a b... (1)
Similarly, to find the remainder when Nis divided
If p is any prime number, PC, willbe a multiple of by99 (or 102-1), we start at the right ernd of N,
p for all r<p. group the digits two at a time, and add up all the
:. The RHS of (1)is a multiple of 7. groups to get, say S2. Then we find the remainder
of S,/99.
Note: When nis prime, (a + b) =an + b +(a multiple of n). In general, to find the remainder when N is
divided by D, = 99....9(n nines) or (10 -1), we
2.13: Find the remainder when 21000 is divided by 33. start at the right end of N, group the digits
n at a time and add up all the groups to get
Sol: 21000 = (25)200=(33- 1)200 =(33200 4 200C (33)199 say Sn.
(-1)+200C2 (33) 190--1)+...+20C,199 (33) (-1)1s RemN = Rem S.
+ (-1j200 D, D,
=M(33) +(-1)200 =(A multiple of 33) +1 Similarly, we can start with the remainder rule for
Fermat's little theorem: If p is prime and HCF (a, p) =1 11and work out the corresponding rules for 101,
then a-1- 1is a rnultiple of p. 1001, 10001 etc. All this is an application of
Remainder theorem.
For example, take p =5, a=3. From the theoren, 3 -1 Here, N = 123, 123, ..,123 (a total of 300 digits
or 80 is a multiple of 5. or 100 groups) = 123(10009) + 123(100098)
.+ 123 (1000') + 123
If we take successive powers of 3, we get all the possible
Now, let N = f(1000); When N or f(1000) is
remainders. divided by 999 or (1000- 1), the remainder is f(1)
31 =3,32 =4, 33 = 2, 34 = 1 (also 35 = 3, 3° = 32, 37 = 3 i.e., 123(100) by remainder theorem. i.e.
etc). At a certain stage, we get a remainder of 1 and after S = 123 (100)]
that, the pattern repeats. In this exanple, the pattern is 3,
4, 2, 1; 3,4, 2, 1; etc. The pattern length is 4. In general, Rem
N = Rem 12300 =Rem
12 +300
it would be (p - 1) or some factor of (p - 1). 999 999 999
=312
2.14: What is the rernainder when 519 is divided by 59?
2.18: Let N = 345345345. up to 300 digits. What is
Sol: N=5119 We need Re m the remainder when Nis divided by 999? Also find
59
By Fermat's Little Theorem, 558 = 59k + 1 (where the remainder when N is ivided by 1001
k is a natural number)
559 = 59 (5k) + 5 or 5595 Sol: N = 345, 345, 345 (up to 300 digits or 100
..511% 25 and 5'19 125 =7 groups of 3 digits) = 345 (10(99) + 10(98) + 10(97)
+
+ 10 + 1]
2.15: Find the rernainder when 2657 is divided by 29. (345 )(100 )
N = Re m
Rem- = Rem
Sol:
2657 (26)(26) 999 (10-) 999
Re m =Rem
29 29
( By remainder theorem)
26 265%
29/Nem
=Rem 29 =Re m
34.500 = Re m 34
999
500
999
.= 534
= (26) (1) = 26. ..The rermainder is 26.
Triumphant Institute of Management Education Pvt. Ltd. (T..M.E.) HO 95B 2d Elonr Siddaniselty Complex. Secunderabad - 500 003.
SNMI002208/29
Tel : 040-40088400 Fax : 040-27847334 email: infoatime4educatio) com wehsite : www.tinc4educat1on com
 as odd)
when n is even as well
To get Re m N 1 It is always (i.e.
we need Uand Th, where divisible by a -b.
1001
Uis the sum of all the When n is even, it is
also divisible bya +b.
alternate groups starting 2 by a + b, if a t b is a
with the rightmost (the group 3 When n is odd, it is divisible
containing the units
digit) and Th is the sum of all the factor of 2bn.
starting with the second rightmost alternate groups
(the group remembered for numbers in
Cónsisting of the thousands digit)
U= 345(50) = 17250 and Th =
The following rules should be
the form of an + bn.
N
345(50) = 17250
.". Re m = Rem U-Th
1001 1001
= 0.
1 When n is odd, it is divisible by a +b. when
2. When n is odd, it is divisible by a - b,
Rules pertaining to a" + b" or a"- b" a-b is a factor of 2b.
Sometimes, there will be 3 When n is even, it is divisible by a + b, if
can be written in the formproblems involving numbers that
an + bn or an- bn which can be a + b is a factor of 2bn.
simplified using simple rules. Let us first look at the rules
pertaining to both an + bn and an - b (a, b and n
being Some important identities
positive integers).
+ a2 bN-3 +
aN - bN = (a - b)(ai + at2 b + ats b? +
The following rules should be ab2+ bN=1) for all positive integer values of N.
the form of an- bn remembered for numbers in
aN + bN = (a + b\ai-1 a2 b +a s²- a4 b + ... -a³
b4 + a? bts- ab N-2 + bN) for all odd positive integer
values of N.

Education Pvt. Ltd. (T.LM.E.) IO: 95B. 2Md Floor,

Triumphant Institute of Management
Tel : 040-40088400 Fax :040-27847334
email : inloame4education c Siddamsetty Complex, Secunderabad - 500 003
website:www.(ime4education.com SMI002208/30