Basic concepts, definitions and identities

Number System
Test of divisibility:
1. A number is divisible by 2 if it ends in zero or in a digit which is a multiple of
2i.e. 2,4, , !.
2. A number is divisible by ", if the sum of the digits is divisible by ".
". A number is divisible by 4 if the number formed by the last two digits, i.e. tens
and units are divisible by 4.
4. A number is divisible by # if it ends in zero or #
#. A number is divisible by if it divisible by 2 as well as by ".
. A number is divisible by ! if the number formed by the last three digits, i.e,
hundreds, tens, and units is divisible by !.
$. A number is divisible by % if the sum of its digit is divisible by %
!. A number is divisible by 1& if it ends in zero.
%. A number is divisible by 11 if the difference between the sums of the digits in
the even and odd places is zero or a multiple of 11.
LCM:
'() of a given set of numbers is the least number which is e*actly divisible
by every number of the given set.
HCF:
+(, of a given set of numbers is the highest number which divides e*actly
every number of the given set.
LCM, HCF:
1. -roduct of two numbers . +(, '()
2. +(, of fractions .
rs denominato of '()
numerators of +(,
". '() of fractions .
rs denominato of +(,
numerators of '()
4. /ne number .
number 2nd
+(, '()
#. '() of two numbers.
+(,
numbers the of -roduct
.
'()
numbers the of -roduct
+(, =
Eamples to Follo!:
1. 0he s1uare of an odd number is always odd.
2. A number is said to be a prime number if it is divisible only by itself and unity.
2*. 1, 2, ", #,$,11,1" etc.
". 0he sum of two odd number is always even.
4. 0he difference of two odd numbers is always even.
#. 0he sum or difference of two even numbers is always even.
. 0he product of two odd numbers is always odd.
$. 0he product of two even numbers is always even.
"roblems:
1.
3f a number when divided by 2% gives a remainder $#, find the remainder when
"$ divides the same number.
)ethod4
'et the number be *, say
* . 2%5 6 $#, where 5 is 1uotient when * is divided by 2%
. "$ !5 6 "$ 2 6 1
. "$7!5 6 28 6 1
+ence, the remainder is 1 when the number * is divided by "$.
2.
3f 2
"2
61 is divisible by 41, find another number which is also divisible by 41.
)ethod4
(onsider 2
%
61 . 72
"2
8
"
6 1
"
. 72
"2
61872
4
92
"2
618
,rom the above e1uation, we find that 2
%
61 is also e*actly divisible by 41,
since it is already given that 2
"2
61 is e*actly divisible by 41.
".
3f m and n are two whole numbers and if m
n
. 2#. ,ind n
m
, given that n 1
)ethod4
m
n
. 2# . #
2
m . #, n . 2
n
m
. 2
#
. "2

4.
,ind the number of prime factors of
1&

$
1$
##
2$

1&

$
1$
##
2$
. 2
1&
"
1&
$
1$
#
2$
11
2$
0he number of prime factors . the sum of all the indices viz., 1& 6 1& 6 1$ 6
2$ 6 2$ . %1
#.
A number when successively divided by %, 11 and 1" leaves remainders !, % and
! respectively. ,ind the number.
)ethod4
0he least number that satisfies the condition. ! 6 7%%8 6 7!%118 . ! 6 !1 6
$%2 . !!1
.
A number when divided by 1%, gives the 1uotient 1% and remainder %. ,ind the
number.
'et the number be * say.
* . 1% 1% 6 %
. "1 6 % . "$&
$.
,our prime numbers are given in ascending order of their magnitudes, the
product of the first three is "!# and that of the last three is 1&&1. ,ind the
largest of the given prime numbers.
0he product of the first three prime numbers . "!#
0he product of the last three prime numbers . 1&&1
3n the above products, the second and the third prime numbers occur in
common. 0he product of the second and third prime numbers . +(, of the
given products.
+(, of "!# and 1&&1 . $$
'argest of the given primes .
$$
1&&1
. 1"
S#uare root, Cube root, Surds and $ndices
C%aracteristics of s#uare numbers
1. A s1uare cannot end with an odd number of zeros
2. A s1uare cannot end with an odd number 2, ", $ or !
". 0he s1uare of an odd number is odd
4. 0he s1uare of an even number is even.
#. 2very s1uare number is a multiple of " or e*ceeds a multiple of " by unity.
2*.
4 4 . 1 . # " 6 1
# # . 2# . ! " 6 1
$ $ . 4% . 1 " 6 1
. 2very s1uare number is a multiple of 4 or e*ceeds a multiple of 4 by unity.
2*.
# # . 2# . 4 6 1
$ $ . 4% . 12 4 6 1
$. 3f a s1uare numbers ends in %, the preceding digit is even.
2*.
$ $ . 4% 4 is the preceding even numbers
2$ 2$ . $2% 2 is the preceding even numbers.
(haracteristics of s1uare roots of numbers
1. 3f a s1uare number ends in %, its s1uare root is a number ending in" or $.
2. 3f a s1uare number ends in 1, its s1uare root is a number ending in1 or %.
". 3f a s1uare number ends in #, its s1uare root is a number ending in#
4. 3f a s1uare number ends in 4, its s1uare root is a number ending in2 or !.
#. 3f a s1uare number ends in , its s1uare root is a number ending in4 or .
. 3f a s1uare number ends in &, its s1uare root is a number ending in &.
2*.
7i8
etc "$ 1"%
"" 1&!%
2$ $2%
2" #2%
=
=
=
=
7ii8
1% "1
"1 %1
% !1
11 121
=
=
=
=
7iii8
on so : 4# 2&2#
"# 122#
2# 2#
=
=
=
7iv8
on so : 2! $!4
"2 1&24
! 4
22 4!4
=
=
=
=
7v8
on so : $
#$
2#
1%
26
24
16
14
=
=
=
=
7vi8
on so : 1&&&&
4&&
1&&
100
20
10
=
=
=
THE&'( &F $N)$CES
1.
a
m
a
n
. a
m 6 n
2.
7a
m
8
n
. a
mn
". n m
n
m
a
a
a

=
4.
7ab8
m
. a
m
b
m
#.
a
&
. 1
. p;1
a . 1th root of a
p
.
1
p
a
$. p 1
a . pth root of a
!.
m
m m
m
c
b a
c
ab
=

%.
a

.
1&.
a
9
. &
1.,ind the s1uare root of #1 7,actor method8
"
%
2$
!1
24"
$2%
21!$
#1
"
"
"
"
"
"
"

#1 . 7""87""87""87""8
.7%%87%%8
. !1!1
6561 . !1

2. ,ind the least number with which you multiply !!2, so that the product may be
a perfect s1uare.
,irst find the factors of !!2.
!!2 . 2 " " $ $
<ow, !!2 has factors as shown above, " repeated twice, $ repeated twice
and 2 only once. =o when one more factor 2 is used, then it becomes a perfect
s1uare.
!!2 2 . 72 28 7" "8 7$ $8
0he least number re1uired is 2
$
4%
14$
441
!!2
$
"
"
2
". ,ind the cube root of 2%!#%!4 7,actor method8
2%!#%!4 . 2
"
2
"
2
"
2
"
"
"
"
"
"
2%!#%!4 .
2 2 2 2 " " . 1 % . 144
1
"
"
%
2$
!1
24"
$2%
14#!
2%1
#!"2
114
2""2!
4#
%""12
1!24
"$"24!
$44%
14%2%%2
2%!#%!4
"
"
"
"
"
2
2
2
2
2
2
2
2
2
2
2
2
2
4. ,ind the value of
&4 . & 4
&4 . & 4
+

% . &
21
1%
42
"!
2 . 4
! . "
2 . & 4
2 . & 4
&4 . & 4
&4 . & 4
= = = =
+

=
+

#. "&
"
%&
" . &
%
&% . &
!1
&% . &
!1
= = = =
. =implify
4
"
"
4

" 2
1
" 2
" 4
2
"
"
2
4
"
"
4
=

= =
!. ,ind the value of
1
1
41&
1
1
41& .
1
#1
.
1
#1
.
4
!1
.
4
1
2&
.,ind the least number with which you multiply !!2. =o that the product may be
a perfect s1uare.
,irst find the factors of !!2.
$
4%
14$
441
!!2
$
"
"
2
<ow, !!2 has factors as shown above.
" repeated twice, $ repeated twice and 2 only
once. =o, when one more factor 2 is used, then
it becomes a perfect s1uare.
!!22.72287""87$$8
0he least number re1uired is 2.

$. ,ind the cube root of 2%!#%!4 7,actor method8
"
%
2$
!1
24"
$2%
14#!
2%1
#!"2
114
2""2!
4#
%""12
1!24
"$"24!
$44%
14%2%%2
2%!#%!4
"
"
"
"
"
"
2
2
2
2
2
2
2
2
2
2
2
2
2%!#%!4 . 2
"
2
"
2
"
2
"
"
"
"
"

3
2985984 . 3 3 2 2 2 2 . 9 16 . 144
!.,ind the value of
&4 . & 4
&4 . & 4
+

2 . & 4
2 . & 4
&4 . & 4
&4 . & 4
+

=
+

. % . &
21
1%
42
"!
242 . 4
! . "
= = = 7appro*8
%.
&% . &
!1
.
&% . &
!1
.
" . &
%
.
"
%&
. "&
1&. =implify
"
4
9
4
"
"
4
9
4
"
.
2
"
"
2

.
" 2
" 4
.
" 2
1
11. ,ind the least number with which 1$2! may be added so that the
resulting number is a perfect s1uare.
14
12!
1
1$2!
42
!2
4
<ote4
0a5e the s1uare root of 1$2! by long division method. 3t comes
to 41.6 something. As shown, if 12! is made 14, we get the
s1uare root as an integer. 0he difference between 14 and 12!
i.e., " must be added to 1$2!, so that 1$4 is a perfect
s1uare 1764 .42
T%eory of $ndices
"roblems:
1. A certain number of persons agree to subscribe as many rupees each as there
are subscribers. 0he whole subscription is >s.2#!244%. ,ind the number of
subscriber?
'et the number of subscribers be *, say since each subscriber agrees to
subscribe * rupees.
0he total subscription . no. of persons subscription per person
. * * . *
2
given *
2
. 2#!244%
* . 1&$
2. =implify4
3 4 3
192 b a
@se the 2 formulas
( )
( )
mn
n
m
m m m m
a a
c b a abc
=
=
( )
"
1
4 " " 4 "
b a 1%2 b a 1%2 =

( ) ( ) ( )
( )
( )
" 4
"
1
4
"
4
"
1
2
"
4

"
1
4
"
1
"
"
1
"b 4a.
"b 4a.
.ab ." 2
.ab " 2
b a . 1%2
=
=
=
=
=
". =implify
" 12 %
y *
=ol.
( )
"
1
12 % " 12 %
y * y * =
( ) ( )
4 "
"
1
12
"
1
%
y *
y *
=
=
4. ,ind the number whose s1uare is e1ual to the difference between the s1uares of
$#.12 and &.12
=ol.
'et * be the number re1uired
*
2
. 7$#.128
2
A 7&.128
2
. 7$#.12 6 &.128 7$#.12 A &.128
. 1"#.24 1# . 2&2!.&
= = & . 2&2! * 4#.&"%%
#. >educe to an e1uivalent fraction write rational denominator
=ol.
( )( )
( )( ) " # " #
" " " # "
" #
" # "
+
+ +
=

+

1# 2 %
2
1# 4 1!
" #
" 1# 1# " 1#
+ =
+
=

+ + +
=
. ,ind the value of
1&
%
##
$
2
44
21
14
=ol.
2 . #
1&
%
##
11$
44
"$
1&
%
##
$
2
44
21
14 = = appro*.
$. An army general trying to draw his 1,1& men in rows so that there are as
many men as true are rows, found that he had "1 men over. ,ind the number of
men in the front row.
'et a be the number of men in the front row.
a
2
6 "1 . 111&
<o. of men in the front row . 12$
a
2
. 111& A "1 . 112%
a . 12$
!. A man plants his orchid with #2# trees and arranges them so that there are as
many rows as there are trees in a row. +ow many rows are there?
=ol.
'et * be the number of rows and let the number of trees in a row be * say
*
2
. #2#
* . $#
0here are $# trees in a row and $# rows are arranged.