T ips, F ormul

ae and sh ortcuts
forN umberSystems

By
 N um ber System sT ipsby C R A C K U . IN

 N umber Systemsisth e mostimportanttopicin th e quantitative section.

 Itisavery vasttopicand asignificantnumber ofquestionsappear in

C A T every year from th issection.

 L earning simpl
e tricksl
ike divisibil
ity rules, H C F and L C M , prime
number and remainder th eoremscan h el p improve th e score drasticall
y.

 T h isdocumentpresentsbestsh ortcutswh ich makesth istopiceasy and

h elpsyou perform better.

1 0 M A H M B A C ET M ocksforR s. 4 9 9
Enrol lh ere: h ttps: / / cracku. in/ pay/ 9 F V jF
C racku T ip 1 - N um ber system s
H C F and L C M
▪ H C F * L C M oftwo numbers= Productoftwo numbers

▪ T h e greatestnumber dividing a, b and cl eaving remainders

ofx1 , x2 and x3 isth e H C F of( a- x1 ) , ( b- x2 ) and ( c- x3 ) .

▪ T h e greatestnumber dividing a, b and c( a< b< c) l eaving th e same

remainder each time isth e H C F of( c- b) , ( c- a) , ( b- a) .

▪ Ifanumber, N , isdivisibl
e by X and Y and H C F ( X , Y ) = 1 . T h en, N is
divisibl
e by X * Y

F orfree M A H M B A C ET mocksvisit
h ttps: / / cracku. in/ mah - mba- cet- mock- test
C racku T ip 2 - N um ber system s
P rime and C omposite N umbers

 Prime numbers are numbers wit

h onl
y two factors, 1 and th e number
itsel
f.

 C omposite numbersare numberswith more th an 2 factors. Exampl

es
are 4 , 6 , 8 , 9 .

 0 and 1 are neith er composite nor prime.

T h ere are 2 5 prime numbersl

essth an 1 0 0 .

M A H M B A C ET C rash course
h ttps: / / cracku. in/ mah - mba- cet- crash - course
 C racku T ip 3 - N um ber system s
P ropertiesofP rime numbers
▪ T o ch eck ifn isaprime number, l istal
lprime factorsl essth an or equal
to Sn. Ifnone ofth e prime factorscan divide n th en n isaprime number.

▪ F or any integer aand prime number p, apEaisal

waysdivisibl
e by p

▪ Al lprime numbersgreater th an 2 and 3 can be written in th e form of

6 k+ 1 or 6 k- 1

▪ Ifaand b are co- prime th en a( b- 1 ) mod b = 1 .

M A H M B A C ET L ive Sessions
h ttps: / / www. youtube. com/ ch annel
/ U C jrG 4 n3 cS6 y4 5 B fC Jjp3 boQ
C racku T ip 4 - N um ber system s
T h eoremson P rime numbers
F erm at'sT h eorem :

R emainder ofa^( p- 1 ) wh en divided by p is1 , wh ere p isaprime

W il
son'sT h eorem :

R emainder wh en ( p- 1 ) ! isdivided by p is( p- 1 ) wh ere p isaprime

Pl
ease JoinM B A Preparationtel egram group
h ttps: / / t. me/ C atW ith C racku
C racku T ip 5 - N um ber system s
T h eoremson P rime numbers

R em ainder T h eorem

 Ifa, b, care th e prime factorsofN such th atN = ap * bq * cr

T h en th e number ofnumbersl essth an N and co- prime to N is
F( N ) = N ( 1 - 1 / a) ( 1 - 1 / b) ( 1 - 1 / c) .
T h isfunction isknown asth e Eul er'stotientfunction.

Eul
er'sth eorem

 IfM and N are co- prime to each oth er th en remainder wh en M F( N ) is

divided by N is1 .

F orany queriespl
ease cal
lusat6 3 0 3 2 3 9 0 4 2 .
C racku T ip 6 - N um ber system s

▪ H igh estpower ofn in m! is[m/ n]+ [m/ n2 ]+ [m/ n3 ]+ … . .

Ex: H igh estpower of7 in 1 0 0 ! = [1 0 0 / 7 ]+ [1 0 0 / 4 9 ]= 1 6

▪ T o find th e number ofz eroesin n! find th e h igh estpower of5 in n!

▪ Ifal lpossibl e permutationsofn distinctdigitsare added togeth er th e sum

= ( n- 1 ) ! * ( sum ofn digits) * ( 1 1 1 1 1 . . . n times)

1 0 M A H M B A C ET M ocksforR s. 4 9 9
Enrol lh ere: h ttps: / / cracku. in/ pay/ 9 F V jF
 C racku T ip 7 - N um ber system s

▪ Ifth e number can be represented asN = ap bq cr. . . th en number of

factors th e is( p+ 1 ) * ( q+ 1 ) * ( r+ 1 )

▪ Sum ofth e factors=

▪ Ifth e number offactorsare odd th en N isaperfectsquare.

▪ Ifth ere are n factors, th en th e number ofpairsoffactorswoul d be n/ 2 . If

N isaperfectsquare th en number ofpairs( incl uding th e square root) is
( n+ 1 ) / 2

F orfree M A H M B A C ET mocksvisit
h ttps: / / cracku. in/ mah - mba- cet- mock- test
C racku T ip 8 - N um ber system s

Ifth e number can be expressed asN = 2 p aq br . . . wh ere th e

power of2 isp and a, b are prime numbers

▪ T h en th e number ofeven factorsofN = p ( 1 + q) ( 1 + r) . . .

▪ T h e number ofodd factorsofN = ( 1 + q) ( 1 + r) …

M A H M B A C ET C rash course
h ttps: / / cracku. in/ mah - mba- cet- crash - course
 C racku T ip 9 - N um ber system s

N umber ofpositive integralsol

utionsofth e equation x2 - y2 = k isgiven by

Total number of factors of k

2
 ( Ifk isodd butnotaperfectsquare)

(Total number of factors of k) − 1

2
 ( Ifk isodd and aperfectsquare)

k
Total number of factors of 4
2
 ( Ifk iseven and notaperfectsquare)

k
(Total number of factors of 4 ) −1
2
 ( Ifitiseven and aperfectsquare)

M A H M B A C ET L ive Sessions
h ttps: / / www. youtube. com/ ch annel
/ U C jrG 4 n3 cS6 y4 5 B fC Jjp3 boQ
 C racku T ip 1 0 - N um ber system s

 N umber ofdigitsin ab = [b l
ogm ( a) ]+ 1 ; wh ere m isth e base ofth e
number and [. ]denotesgreatestinteger function

 Even number wh ich isnotamul tipl

e of4 , can never be expressed as
adifference of2 perfectsquares.

Pl
ease JoinM B A Preparationtel egram group
h ttps: / / t. me/ C atW ith C racku
C racku T ip 1 1 - N um ber system s

 Sum offirstn odd numbersisn2

 Sum offirstn even numbersisn( n+ 1 )

 T h e productofth e factorsofN isgiven by N a/ 2 , wh ere aisth e

number offactors

F orany queriespl
ease cal
lusat6 3 0 3 2 3 9 0 4 2 .
 C racku T ip 1 2 - N um ber system s

 Th el
asttwo digitsofa2 , ( 5 0 - a) 2 , ( 5 0 + a) 2 , ( 1 0 0 - a) 2 . . . . . . . . are same.

 Ifth e number iswritten as2 1 0 n

W h en n isodd, th e l
ast2 digitsare 2 4 .

W h en n iseven, th e l
ast2 digitsare 7 6 .

1 0 M A H M B A C ET M ocksforR s. 4 9 9
Enrol lh ere: h ttps: / / cracku. in/ pay/ 9 F V jF
C racku T ip 1 3 - N um ber system s

Divisibil
ity

 Divisibil
ity by 2 : L astdigitdivisibl
e by 2

 Divisibil
ity by 4 : L asttwo digitsdivisibl
e by 4

 Divisibil
ity by 8 : L astth ree digitsdivisibl
e by 8

 Divisibil
ity by 1 6 : L astfour digitdivisibl
e by 1 6

F orfree M A H M B A C ET mocksvisit
h ttps: / / cracku. in/ mah - mba- cet- mock- test
 C racku T ip 1 4 - N um ber system s

Divisibil
ity

 Divisibil
ity by 3 : Sum ofdigitsdivisibl
e by 3

 Divisibil
ity by 9 : Sum ofdigitsdivisibl
e by 9

 Divisibil
ity by 2 7 : Sum ofbl
ocksof3 ( taken righ tto l
eft) divisibl
e by 2 7

 Divisibility by 7 : R emove th e l
astdigit, doubl
e itand subtractitfrom th e
truncated originalnumber. C h eck ifnumber isdivisibl e by 7

Divisibility by 1 1 : ( sum ofodd digits) - ( sum ofeven digits) sh oul

d be 0 or
divisibl
e by 1 1
M A H M B A C ET C rash course
h ttps: / / cracku. in/ mah - mba- cet- crash - course
C racku T ip 1 5 - N um ber system s

Divisibil
ity properties

 F or composite divisors, ch eck ifth e number isdivisible by th e factors

individual l
y. H ence to ch eck ifanumber isdivisibl e by 6 itmustbe
divisible by 2 and 3 .

 T h e equation anEbn isal

waysdivisibl
e by a- b. Ifn iseven itisdivisibl
e
by a+ b. Ifn isodd itisnotdivisibl
e by a+ b.

 T h e equation an+ bn , isdivisibl

e by a+ b ifn isodd. Ifn iseven itisnot
divisibl e by a+ b.

M A H M B A C ET L ive Sessions
h ttps: / / www. youtube. com/ ch annel
/ U C jrG 4 n3 cS6 y4 5 B fC Jjp3 boQ
 C racku T ip 1 6 - N um ber system s

• C onverting from decimalto base b. L etR 1 , R 2 . . . be th e remainders

leftafter repeatedly dividing th e number with b. H ence, th e number in
base b isgiven by . . . R 2 R 1 .

• C onverting from base b to decimal- mul tipl

y each digitofth e number
with apower ofb starting with th e righ tmostdigitand b0 .

• A decimalnumber isdivisibl e by b- 1 onl

y ifth e sum ofth e digitsof
th e number wh en written in base b are divisibl
e by b- 1 .

Pl
ease JoinM B A Preparationtel egram group
h ttps: / / t. me/ C atW ith C racku
 C racku T ip 1 7 - N um ber system s

C ycl
icity
▸ T o find th e l astdigitofan find th e cycl
icity ofa. F or Ex. ifa= 2 , we
see th at
▸2 1 = 2
▸2 2 = 4
▸2 3 = 8
▸2 4 = 1 6
▸2 5 = 3 2
H ence, th e l astdigitof2 repeatsafter every 4 th power. H ence cycl icity
of2 = 4 . H ence ifwe h ave to find th e l astdigitofan,
T h e stepsare:
1 . F ind th e cycl icity ofa, say itisx
2 . F ind th e remainder wh en n isdivided by x, say remainder r
3 . F ind ar ifr> 0 and ax wh en r= 0

F orany queriespl
ease cal
lusat6 3 0 3 2 3 9 0 4 2 .
C racku T ip 1 8 - N um ber system s

▪ ( a+ b) ( a- b) = ( a2 - b2 )

▪ ( a+ b) 2 = ( a2 + b2 + 2 ab)

▪ ( a- b) 2 = ( a2 + b2 - 2 ab)

▪ ( a+ b + c) 2 = a2 + b2 + c2 + 2 ( ab + bc+ ca)

1 0 M A H M B A C ET M ocksforR s. 4 9 9
Enrol lh ere: h ttps: / / cracku. in/ pay/ 9 F V jF
C racku T ip 1 9 - N um ber system s

▪ ( a3 + b3 ) = ( a+ b) ( a2 - ab + b2 )

▪ ( a3 - b3 ) = ( a- b) ( a2 + ab + b2 )

▪ ( a3 + b3 + c3 - 3 abc) = ( a+ b + c) ( a2 + b2 + c2 - ab - bc- ac)

▪ W h en a+ b + c= 0 , th en a3 + b3 + c3 = 3 abc.

F orfree M A H M B A C ET mocksvisit
h ttps: / / cracku. in/ mah - mba- cet- mock- test
F orM B A guidance wh atsapp‘M B A ’ to + 9 1 6 3 0 3 2 3 9 0 4 2