To start with

Angle Bisector Theorem

A classic example from one of the simcat's which makes use of both external and internal angle
bisector theorems.
Find DE : DB, if BC = 3 units, EB = 1 unit and DE is an angle bisector of CDB and DB is an
angle bisector of ADE.
We are asked to find DE/DB
!rom the abo"e figure we see that DE is internal angle bisector of Triangle#D$B% whereas DB is the
External angle bisector of Triangle#D$E%.
&o
!rom an external angle bisector in Triangle#D$E% we ha"e
D$/DE ' B$/BE..............i
!rom an internal angle bisector in Triangle#D$B% we ha"e
D$/DB ' E$/EB .............ii
!rom i ( ii
we get DE/DB ' )/*.
+n addition to the abo"e Angle Bisector theorem + ha"e attached a file with respect to angle bisectors
that will help ,ou in comprehending the below concept.
A ! " = #b $ c% ! a
where - is the incentre and a b c are the respecti"e sides of the triangle.
This concept will be reall, hand, in sol"ing the problems.
Thanks in ad"ance. #attached thumbnail &g ' &ost ()%
For an* set of n &ositi+e numbers ,
Arithmetic .ean /' 0eometric .ean /'1armonic mean
The e2ualit, occurs onl, when all the numbers are e2ual .
This can be used if the sum#or product % of some numbers are gi"en and the maximum#or minimum%
"alue of the product#or sum % is asked ...
Ex 3 x,')4
minimum "alue of *x56, 7
taking *x and 6, to be two numbers and appl,ing our rule
A.. 3 #*x56,%/)
0.. 3 #8)x,%98/)'#6:*:)4%98/) ' 8;
A.. /' 0.
*x56, /' ):8;
1ence the minimum "alue of #*x56,% is *<
how to put = identical rings in 6 fingers.
conce&t= n$r,1Cr,1
this formula is used to distribute n identical things among r people.
if the = rings are named a8a)a*....a4a;a=
we want to distribute them among 6 fingers means we want to make four groups out of this = rings.
so if we arrange the = rings side b, side.
>a8>a)>a* >a6> a?> a<> a4>a;>a=>
we need three separator to di"ide them in 6 groups. and we can put the separator at an, of the black
space abo"e.
suppose + put first separator after a8 second after a6 *rd after a<
so groups are
a8
a)a*a6
a?a<
a4a;a=
that means + can sa, + ha"e total 8) items # =5*% to arrange them sel"es.
that is 8)@
but = rings are identical and * separators are also identical
so final answer shd be ' 8)@/=@:*
if we replace = with n* with r
we get
n$r,1Cr,1
). how to distribute = different rings among 6 fingers.
Aust a single change rings are different so we dont ha"e to di"ide b, =@
so answer ' 8)@/*@
general formula = n$r,1r,1
both of the abo"e B are of arrangement and distribution.
examples where this concept can be used.
8. distribute 8o chocolates aming < children such that no children is empt, handed.
). find whole number solutions for C5D5E ' ))
*. find natural number solutions for C5D5E' ))
6. total number of terms in #a5b5c5d%98?
conce&t 3. total number of s2uares which can be made from siFe in G:G siFe s2uare.
' 89) 5 )9) 5 *9* .....G9)
like for ):) s2uare we can ha"e total ? s2uares 6 s2uare of 8:8 and the ):) s2uare itself.
conce&t -. total number of rectangles which can be made from G:G s2uare.
' 89*5)9*5*9*.....n9*
conce&t .. A plane# restricted% is to be di"ided in G distinct parts find the minimum number of lines
to do so.
formula ' / sigma C ' GH8
C is the minimum number of lines.
suppose we want to di"ide plane in 8< distinct parts
sigma? ' 8?
so answer is ? lines.
Sigma denotes the sum of all the term
eg-
1+2+3+...n = sigma (n)
1+3+6+10+.....(1+2+..n)=Sigma[Sigma(n)]
&uppose we ha"e to find the number of wa,s in which an ordered &air #a b% where a and b are
natural numbers can be choosen such that I$. of a and b is #p9x%:#29,%:#r9F%:...
Iet a ' #p9x8%:#29,)%:#r9F*%:...
and b ' #p9x)%:#29,)%:#r9F)%:...
&ince I$. of a and b is #p9x%:#29,%:#r9F%:... we can sa, that
max#x8 x)% ' x
'/ one of x8 and x) has to be x this can be done in #x 5 8%9) H x9) ' #)x 5 8% wa,s
&imilarl, max#,8 ,)% ' , '/ #), 5 8% wa,s
( max#F8 F)% ' F '/ #)F 5 8% wa,s
&o total number of such ordered pairs ' #)x 5 8%#), 5 8%#)F 5 8%..
1ad the 2uestion been that in how man, wa,s two numbers can be choosen such that their I$. is
#p9x%:#29,%:#r9F%:... then the answer would be
J#)x 5 8%#), 5 8%#)F 5 8%.... 5 8K/)
/umber 0*stems #Conce&t 1%
Iets brush up some painted cube funda
We assume the cube is di"ided into n9* small cubes.
no. of small cubes 1ith 2/34 3 sides &ainted 3 ;# all the corner cubes %
no. of small cubes 1ith 2/34 5 sides &ainted 3
A cube is painted on ) sides means it is on the edge of the bigger cube and we ha"e 8) edges each
ha"ing n cubes. but since the corner cubes are painted on * sides we need to neglect them. so in
effect for each side we will ha"e #nH)% small cubes with onl, ) sides painted.
thus then number is 8) : #nH)%
no of small cubes 1ith 2/34 1 side &ainted 3
for each face of the cube # < faces % we ha"e #nH)%9) small cubes with onl, one side painted. and we
ha"e < faces in total.
so th number is <:#nH)%9)
no of small cubes 1ith /2 sides &ainted 3
if we remo"e the top la,er of small cubes from the big cube we will end up a chunk of small cubes
with no sides painted.
this number will be e2ual to #nH)%9*.
Also remember for $uboids with all different siFes the following are the results3
a x b x c #All lengths different%
Three faces , ) #all the corner small cubes of the cuboid%
T1o faces , There are t1o #a,5% units of small cubes on one face of the cuboid and there is
a &air of such faces. 6ence, number of such small cubes corres&onding dimension a of the
cuboid = -#a,5%.
0imilarl*, for others.
0o, total 1ith t1o faces &ainted = -#a , 5% $ -#b , 5% $ -#c , 5%
2ne face , 0ince each face of the cuboid is a combination t1o different dimensions, hence
for the face 1hich is a combination of a and b dimensions, the number of small cubes is 57
#a,5%#b,5% 8multi&liesd b* 5 because there are 5 such faces for the combination9
0imilarl*, for others.
0o, total 1ith one face &ainted = 5#a , 5%#b , 5% $ 5#a , 5%#c , 5% $ 5#b , 5%#c , 5%
:ero faces , The entire +olume of small cubes e;ce&t for t1o cubes in each of the ro1s and
columns 1ill not be &ainted at all. hence this is the sim&lest ...
#a , 5%#b , 5%#c , 5%
Dou can put different integer "alues for number of small cubes producing different edge lengths of
cuboid to get "aried results.
To "erif, for a cube put a'b'c'I ,ou get
Three faces , )
T1o faces , 15#3 , 5%
2ne face , (#3 , 5%<5
:ero faces , #3 , 5%<3
-roblems on +ntersection of &traight lines $ircles !ormation of -oints and !ormation of Triangles
Buadrilaterals Etc
Basic Conce&t Fundas
8. +f there are n number of straight lines The, intersect each other in nc5 wa,s
). +f there are m number of circles The, intersect each other in
):#mc)% wa,s ' m #mH8%' 5&5 1a*s
*. When n straight lines and m circles intersect each other the, intersect in
at most 5 7 m 7 n ' ): # no. of circles % : # no.of straight lines%
6. When n parallel lines intersect m straight lines Then no. of parallelograms possible ' nc5 7 mc5'
mn #mH8% #nH8%/6
?. There is one case when collinear and nonH collinear points are gi"en and asked how man,
triangles it can formed'/
The funda for this H # Triangles that can be formed with all points % L # Triangles formed with collinear
points %
And the same funda is applied whene"er such "ariations in condition occurs
<. !or 2uadrilaterals standard approach is followed
1. - &oints out of ) &oints are collinear . /umber of different =uadrilaterals that can be
formed b* >oining this is
1. .( 5. .3 3. '( -. (?
'/ total points ' ;
'/ $ollinear points ' 6 Gon L collinear points ' 6
'/ &tandard approach '
'/ 6cM : 6c6 5 6c8: 6c* 5 6c) : 6c)
'/ 85 8<5*<
'/ ?*
Go f 2uads with M points 3 8
Go of 2uads with 8 point 6 : 6$* ' 8<
Go of 2uads with ) points 6$) : 6$) ' *< so in all ?*.
NNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNL
5. The number of &oints of intersection of ) different circles is
1. 1( 5. 5- 3. 5) -. .(
'/ 0uess eas, now O &tandard !ormula ' ): nc)' n:#nH8% ' np)
'/ ; : #;H8%' ;:4
'/ ?<
NNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNL
3. The ma; . number of &oints of intersections of ) straight lines
1. ) 5.1( 3. 5) -. .(
'/ &tandard formula ' nc)
'/ ;c) ' ;:4/ )' );
NNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNL
-. The ma;. no of &oints into 1hich - circles and - straight lines intersect is ,
1.5( 5. .? 3. .( -.'5
'/ &ince max. no of points is asked
'/ # no. of points possible due to intersection of 6 circles with each other % 5
# no. of points possible due to intersection of 6 straight lines %
5 # no. of points possible due to intersection of 6 circles with 6 straight lines %
'/ 6p)5 6c)5 ):6:6
'/ 6:*5):*5*)
'/ 8)5<5*)
'/ ?M
NNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNL
.. @f . straight lines are intersected b* - straight lines , The number of
&arallelograms &ossible
'/ &tandard formula
'/ ?c) : 6c)
'/<M
NNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNL
<. Gow problems on !ormation of triangles
@f there are ' &oints out of 15 lie on the same straight line , then number of triangles
thus formed isA.
'/ 1ere total points' 8)
'/ These 8) points can formed 8)c* triangles
'/ and 4 collinear points can also form 4c* triangles
'/ Thus total triangles possible ' 8)c*H4c*
'/ 8;?
NNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNL
'. The sides BC,CA,AB of triangle ABC ha+e 3,-,. interior &oints res&ecti+el* on
them. 6o1 man* triangles can be formed using these &oints as +ertices.
a.5??
b.5?.
c.-??
d.-1?
'/ 1ere total number of points will be A5B5$5*565?
'/ *5*565?' 8? -oints
'/ Total number of triangles possible ' 8?c*
'/ * points are collinear 6 points are collinear ? points are also collinear
'/ &o triangles formed with these points is omitted thus answer is
'/ 8?c* L *c*H6c*H?c*
'/ )M?
1owe"er + am afraid that there is a mistake made in deri"ing the abo"e solution.
The total "ertices to be considered should be *565? ' 8) instead of 8?. We should not
include the existing "ertices #A B $% since the 2uestion was how man, triangles can be
formed from using the new points as "ertices.
Gow the solution becomes
15C3 , 3C3 , -C3 , .C3 ' ))M L 8 L 6 L 8M
which ,ields 5?. as the answer.
NNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNL
There are ( straight lines in a &lane, no 5 of 1hich are &arallel and no 3 of 1hich
&ass through the same &oint. @f their &oints of intersection are >oined, then the
number of additional lines thus introduced is
#a% -. #b% ') #c% 1?. #d% none of the foregoing
'/ solution for this '/
Total points formed from the intersection 3 #<c)%c) ' 8M?
Gumber of existing lines from these points 3 <:?c) ' <M
&o 8M?H<M ' 6?
B.1hich one is the list containing the number of &oints at 1hich a circle can intersect
a triangle CCC
5, -
5, -, (
1, 5, 3
1, 5, 3, -
1, 5, 3, -, ., (
'/ 8)*6?<
1?.if there are ' &ts. on a circle and 1? non collinear &ts outside circle in same &lane
ho1 man* circles can be madeC
'/ Total -oints ' 458M ' 84
'/ !or a circle formation * points are re2uired NH 84c*5 8N# This one is added cause 4
points can gi"e one circle %
'/ 4 points are collinear so circles are omitted NH 4c*
'/ Thus the answer is 84c* 5 8 H4c*
* points are re2uired for a circle. And there are 84 points. hence 84$* circles can be formed.
But 4 points are on the same circle.
hence 84$* H 4$* 58 #58 because 4 points are on the same circle%.
11.if there are collinear ' &ts and ) collinear &ts. on other line &arallel to it and 3
non collinear &ts outside t1o lines and all are in same &lane , find no. of circ can be
made
'/ Total no. of points ' 45;5*' 8; -oints
'/ Gumber of circles that can be made with these points ' 8;c*
'/ And since 4 points and ; points are collinear the circles made with it are omittedP
4c* and ;c*
'/ Thus answer is 8;c*H4c*H;c*
A cuboid with dimensions l b and h is painted on surface and then cut into cubes of 8cm* siFes. Gow
how man, cubes ha"e none of the faces painted how man, cubes ha"e one face painted how man,
cubes ha"e two faces painted and how man, cubes ha"e three faces painted.
Ans3 Go of cubes with no face#side% painted is #lH)%#bH)%#hH)%
Go of cubes with one face#side% painted is )#lH)%#bH)% 5 )#bH)%#hH)% 5 )#lH)%#hH)%
Go of cubes with two faces#sides% painted is 6#lH)% 5 6#bH)% 5 6#hH)%
Go of cubes with three faces#sides% painted is ; #alwa,s constant%
Go of cubes with four or more faces #sides% painted is Fero.
+f problem statement sa,s its cube instead of cubiod with k cm sides. Then the answers will be #kH)%*
<#kH)%) 8)#kH)% ; and Fero respecti"el,.
#.ultiplication -rinciple% +f there are n choices for the first step of a two step process and m choices
for the
second step the number of wa,s of doing the two step process is nm.
The number of arrangements of n obAects is n@
The number of arrangements of r out of n obAects is n-r ' n@/#nHr%@
The number of arrangements of n obAects in a circle is #nH8%@
The number of arrangements of n obAects on a ke, ring is #nH8%@/)
The number of arrangements of n obAects with r8 of t,pe 8 r) of t,pe ) ... ri of t,pe i is n@/#r8@
r)@...ri@%
The number of wa,s of choosing n out of r obAects is n$r ' n@/##nHr%@ r@%
The number of distributions of n distinct obAects in k distinct boxes is kn.
The number of wa,s of distributing n identical obAects in k distinct boxes is #n5kH8%$n.
1.if f#;% = a;<5 $ b; $ c, ho1 to find ma;imum, minimum .
Q&E first deri"ation test.
f'#x%' )aC5b.
find "alue of C for which )ax5b' M.
when a/M at this "alue of C f#x% is minimum.
when aRM at this "alue of C !#x% is maximum.
now example....
f#x% ' C9) 5 6C 5 *.
if )C56 ' M
C' H)
here a/M so at x'H) f#x% will attain minimum "alue.
f#H)% ' 6H;5* ' H8.
if f#x% ' HC9) 5 6C 5 *
fS#x% ' H)x 5 6
C' ).
f#)% ' H65;5* ' 4 is the maximum "alue of f#x%.
generaliDing for f#;% = a;<5 $ b; $ c,
;=,b!5a #5a;$c=o%gi+es ma;imum or minimum +alue of f#;% de&ending u&on aE? or aF?.
for more examples and explanation with graphs "isit the linkH
!irst deri"ati"e Test
second deri"ati"e test
5. f#;% = l ;,a l $ l ;,b l $ l ;,c l
for such 2uestions either at x'a or x' b or x' c or x'a"g#abc% will f#x% minimum.
f#x% ' l xH) l 5 l xH; l 5 l xH88 l
here x' )5;588/* ' 4 will gi"e the minimum "alue # f#4% ' 88%
f#x% ' l xH) l 5 l xH? l 5 l xH88 l
here x' ? will gi"e the minimum "alue. # f#?% ' =%
3. 1hen sum of an* =uantities is constant, there &roduct is ma;imum 1hen the* are e=ual.
example. if *x5?,'8?. find maximum "alue of x9):,9*.
here *x5?,'8?
'/ *x/) 5 *x/) 5 ?,/* 5 ?,/* 5 ?,/* ' 8?.HHHHHHHHHHHHHH8
as + said when sum of an, 2uantities is constant there product is maximum when the, are e2ual.
here sum is constant.
so when *x/) ' ?,/*. we get maximum "alue of x9):,9*.
taking *x/) ' ?,/* putting it in 8
'/ ?#*x/)% ' 8?.
'/x'). and , ' =/?.
answer is )9):#=/?%9*.
generaliFing it how to find maximum "alue of x9m:,9n where ax5b,'-.
abx,/M
x9m:,9n is maximum when
ax/m ' b,/ n ' p/m5n
-. 1hen the &roduct of an* =uantit* is constant, sum of the all the =uantit* is minimum,
1hen the* are e=ual.
x,9* ' <6.
find minimum "alue of x58),.
we need to adAust x58), accordingl,.
x58), ' x5 #8),/*%:*
now x:#8),/*%9*' <6 :<6 # coF x,9* ' <6%HHHHHHHHHHH8
the product is constant. so the sum of the 2uantities will be minimum when 2uantities are e2ual.
take x' 8),/*
putting it in 8 we get x' ;
'/8),/* ' ; , ' ).
minimum "alue of x58), ' ;5)6 ' *).
generaliFing it how to find minimum "alue of ax5b, where x9m:,9n'-
abx,/M
ax5b, is minimum when
ax/m ' b,/n
concept of $TT 3
before getting to chinese remainder theorem let me explain whats the need for it7
problem3
find the smallest number when di"ided b, ? lea"es * and when di"ided b, 4 lea"es 6
common approach
di"isor of ? 5 * H *;8*8;)*);**
di"isor of 4 5 6 H 6888;)?*)
8; is common to both series .. so we ha"e the answer...
same is the case with chinese remainder theorem
find the remainder of *98MM8 di"ided b, 8MM8 ...
8MM8 H 4:88:8*
so find the remainder when *98MM8 di"ided b, 8MM8
*98MM8 / 4 HHHH/ *9?/4 remainder H ?
*98MM8/88 HHHH/ */4 remainder H *
*98MM8/8* HHHH/ *9?/8* remainder H =
so we get 4a 5 ? ' 88b 5 * ' 8*c5=
now what is word interpretation of the abo"e statement ..
find the smallest number which when di"ided b, 4 gi"es remainder ? when di"ided b, 88 lea"es
remainder * and when di"ided b, 8* lea"es remainder =7
first take an, two condition i alwa,s prefer big numbers
88b 5 * ' 8*c 5 =
di"isor of 8* 5 = ' =))*?6;<846;48MM88*8)<8*=
di"isor of 88 5 * H *86)?*<64?;<=;M=88M)88*
so smallest number is 88*
whats the next number then 7
its of form I$.#888*% 5 88* ' 86*k 5 88*
so we ha"e combined two conditions
so now our Aob is to compare this with third one
86*k 5 88* ' 4a 5 ?
86*k 5 8M; ' 4a
86M5 *k 5 8M? 5 * ' 4a
so *k 5 * should gi"e M remainder when di"ided b, 4
so k ' <
final remainder is hence 86*#<% 5 88* ' =48
this is all about chinese remainder theorem
to sum up use this theorem onl* 1hen denominator is factorisable to &rime factors.
Bases
8. A number is base G is di"isible b, GH8 when the sum of digits in base G is di"isible
b, GH8
). When digits of a number G8 in base G are rearranged to form a number G) then
G)HG8 is alwa,s di"isible b, GH8.
*. +f a number in base G has e"en number of digits and that number is a palindrome
then the number is di"isible b, G58
roblems
8. A number )*6)a8)8 is in base ; and it is di"isible b, 4. !ind the "alue of a.
). A palindromic number in base 8< will alwa,s be di"isible b, which number7
*. A fi"e digit number is in base 8=. +t is rearranged to form another ? digit number.
The difference of these numbers will be di"isible b, 77
Eeller's Tule 3 With this techni2ue named after its founder Eeller ,ou can sol"e an, 'Dates and
$alendars' problems.
Eellers rule can be used to find the da, on an, particular date in the calendar in the histor,. All ,ou
ha"e to know is the formula gi"en below and how to use it.
Eeller's Tule !ormula3
! ' U 5 V#8*x. H 8%/?W 5 D 5 VD/6W 5 V$/6W H )$
U ' Date '/ for )?/*/)MM= we take )?
+n Eellers rule months start from march.
. ' .onth no. '/ &tarts from .arch.
.arch ' 8 April ' ) .a, ' *
Go". ' = Dec ' 8M Xan ' 88
!eb. ' 8)
D ' Iast two digits of the ,ear '/ for )MM= ' M=
$ ' The first two digits of centur, '/ for )MM= ' )M
Example3 )?/M*/)MM=
! ' )? 5 VJ#8* x8%H 8K/?W 5 M= 5 M=/6 5 )M/6 H #) x )M%
' )? 5 8)/? 5 M= 5 M=/6 5 )M/6 H )x)M
')?5)5M=5)5?H6M
V We will Aust consider the integral "alue and ignore the "alue after decimalW
' 6* H 6M '
Teplace the number with the da, using the information gi"en below.
8 ' .onda,
) ' Tuesda,
* ' Wednesda,
6 ' Thursda,
? ' !rida,
< ' &aturda,
4 ' &unda,
&o it's Wednesda, on )?th march )MM=.
+f the number is more than 4 di"ide the no. b, 4. The remainder will gi"e ,ou the da,.
+ hope ,ou will find the abo"e method "er, useful
062GTCHT "ET62D T2 F@/D GA/I 2F A J@KE/ L2GD
This shortcut method is used when the lettors of the gi"en word are not repeated.
0i"en word is "A0TEG
The letters of the are .A&TET.
Write the alphabetical order of the letters of the gi"en word ' .A&TET ' as AE.T&T
Gow strike off the first letter ..
A,E,",G,0,T.
Then count the no.of letters before . and it is e2ual to )which is the coefficient of ?@.
Again strike off the first letter A.
A,E,",G,0,T
Then count the no.of letters before A and it is e2ual to M which is coefficient of 6@
Again strike off the first letter &.
A,E,",G,0,T
Then count the no.of letters before & and it is e2ual to ) which is coeffcient of *@
Again strike off the first letter T.
A,E,",G, 0, T
Then count the no.of letters before T and it is e2ual to ) which is coeffcient of )@
Again strike off the first letter E.
A,E, ",G, 0,T
Then count the no.of letters before E and it is e2ual to M which is coeffcient of 8@
!inall, add 8 to the abo"e "alues to get the rank of the word .A&TET as follows3
)#?@% 5 M#6@% 5)#*@%5)#)@%5M#8@%58')?4
The concept of rank goes like this...
&a, for the number of letters before &..we ha"e AE. ( T before it...but we ha"e alread, counted A (
...so we will go with E ( T...i.e ) letters remain...
&imilarl, in case of T..we ha"e AE.T& before it..but we ha"e alread, counted A.&...so onl, ET
are left..i.e ) letters..
Also in case of E we ha"e A.T&T..but we ha"e alread, taken care of all of them..no letters are
pending..so M letters..
1ope this clears ,our confusion..-lease -. me if further clarification is re2uired..
Basic Formulae for Sequences and Series
&ome more formulaeH
8. 0reatest possible sum of the A.- H +t is possible onl, when all the terms of A.- are nonH negati"e
Tn /or e2ual M
).Ieast possible sum of the A.- H it is possible onl, when all the terms of A.- are nonH positi"e
Tn R e2ual M
*. Tn ' &nH&#nH8%
8.The perimeter of a right angle triangle'#)r5)T%
And the area 'r9)5)rT
+ think there is a small error with this formula for perimeter...The "alue should be -')#)T5r%....
$onsider *6? to be the sides of a right triangle...&o area is < and the perimeter is 8)...
r'8 and T'8M/6
)r5)T makes the perimeter )5?'4...
)#)T5r%'8M5)'8) which is the standard formula...
Where r'inradius
T'circumradius
).!or an right angle triangle
T/'Vroot#)%58Wr
let me start from di"isibilit, of )
if last digit is di"isible b, ) then it is di"isible b, ) ...
wh, 7
last digit is nothing but di"ide b, 8M ...
8M is perfectl, di"isible b, )..
now we can extend it for 6 ..
lets take last digit HH/ di"ide b, 8M 8M /6 HH/ not perfectl, di"isible
now mo"e to next digitHH/ di"ide b, 8MM
8MM is perfectl, di"isible b, 6 ..
now this goes on ... Aus tr, for "arious numbers
the abo"e logic works for factor of 8M9n .. other numbers cant be treated this wa,
HHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHH
lets take an example of other number .. take *
8M/* HH/ not di"isible
8MM/* HH/ not di"isible
8MMM/* HH/ not di"isible and it goes on ..
here comes next case remainder 8 case
if remainder is 8 add the digits
HHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHH
now here comes one more set of numbers .. like 4
8M/4 HH/ not di"isible but remainder is not M or 8 or H8
8MM/4 HH/ not di"isible but remainder is not M or 8 or H8
8MMM/4 HH/ not di"isible but remainder is H8
so e"er, three digit we will ha"e H8 remainder ..
if 8M9* has H8 remainder 8M9< has 8 as remainder...
so its alternati"e
sa, number is 8)*8*M to checked di"isibilit, b, 4 ...
so according to this concept we ha"e 8*M H 8)*' 4 which is di"isible b, 4
hardl, ) sec answer ..
u might think wats so special about it .. di"isor can be trick, like 86*
)*?*4;/86* .. is it di"isible 7
b, this method we can sa, *4; H )*? ' 86*.. thats all u r done
appl,ing this formula we can test di"isibilit, of )*6?4;=888**4)44486* etc ....
Aus work on it .. u can easil, find di"isibilit,
This is a "er, useful method to determine the last non Fero digit of a factorial...
Gomenclatures3
E#x%' The last non Fero digit of ;M
I#x%'The last non Fero digit of ;
but don't ,ou think that for higher "alues it will become recursi"e. like for x'4= u will ha"e to
calculate F#4=/?% ' F#8?.CC%
E#x%'I#69,%:F#x/?%:F#xY8M%
-lease don get frightened b, the abo"e formula...+ll tell ,ou how it works...
F#4=%'l#694%:F#8?%:F#=%
F#8?%'I#698%:F#*%:F#?%'6:<:)';
last digit of 69x
when x is odd is odd is 6
when x is e"en is <
1enceF#4=%'6:;:;'<
As i told u it will sound cumbersome...Dou get down and sol"e its wa, easier
&uppose we want to find the non Fero digit of 8?@
then ,' the higest multiple of 8M in the target number...
8?'8M:85?hence ,'8
))'8M:)5)hence ,') and so on
&o
E#8?%'I#698%:F#8?/?%:F#8?Y8M%'6:F#*%:F#?%'6:<:)';.....
1ow r u getting F#*% and F#?% 7
b, similar approach or there an, table7
+t is good to remember the "alues for E#8% to E#=%...
E#8%'8 E#)%') E#*%'< E#6%'6 E#?%') E#<%') E#4%'6 E#;%') E#=%';
/2. 2F 0NHAGE0 A/D GECTA/J3E0 @/ A C6E00B2AGD
in a chessboardthere are ;:; s2uares.
in a ):) chessboard there are ? s2uares #6 small a2uares 8 big s2uare%.
similarl, in an n:n chessboard there are 89) 5)9)5....5n9) s2uares.
so in a ;:; chessboard n';
'/ no.of s2uares ' 89) 5)9)5*9)5.....5;9)
' Vn #n58% #)n58%W/< #summation formula%
' )M6
rectangles 3
in a ):) chessboard there are = rectangles #6 8:8s8 ):)) ):8s ) 8:)s%
for an n:n chessboard there are 89* 5)9*5*9*5.....5n9* rectangles.
so for an ;:; chessboard there are rectangles ' 89*5)9*5....5;9*
'/ no. of rectangles ' VJn9)KJ#n58%9)K/6
n'; we get no. of rectangles ' 8)=<
::Go. of rectangles that are not s2uares in an ;:; chessboard
'/ 8)=<H )M6
' 8M=)
CIRCULAR MOTION
$onsider a circle with circumference )MM s2 metres and two people A and B mo"ing in clockwise
direction with speeds ?m/s and =m/s
a% when do the, meet at the starting point for the first time 7
b% after how much time will the, meet for the first time 7
c% at how man, distinct points the, meet 7
d% if the, mo"e in opposite direction then in how man, distinct points do the, meet 7
ans a% time taken b, A to reach the starting point for the first time is )MM/? ' 6M sec
for the second time ;M seconds
for the third time 8)M seconds and so on .......
similarl, time taken b, B to reach the starting place is )MM/=
for the second time ) : )MM/=
for the third time * : )MM/=
so the, meet for first time at the starting point at the LCM of their time periods which are 6M and
)MM/= in this case and hence the, will meet at t' )MM for the first time .
ans b %this should be sol"ed using the relati"e speed concept time taken for them to meet for the first
time will be relative distance/ relative speed here relati"e distance is )MM and relati"e speed is =H
?'6.
so ans is )MM/6' ?M
ans c%when ) bodies are mo"ing in circular motion in same direction the number of distinct
points here the! meet is the difference of the speeds " here it is =H? ' 6 distinct points.
the lcm of the speeds must be #
ans d % when ) bodies mo"e in circular motion in opposite direction then the number of distict
points the! meet is the sum of the speeds here it will be 86 . the lcm of the speeds must be #
e% find the number of distict points at which ) bodies with speed 6 and ; meet when the, mo"e in
clockwise direcion and when the, mo"e in anticlock wise direction 7
here we first need to di"ide the 1$! so we get 83)
now using the formula stated abo"e the number of distict point the, meet when mo"ing in same
direction will be )H8 '
the number of distict point the, meet when mo"ing in opposite direction is )58 ' *
f%consider three bodies abc with speeds ?=8* respecti"el, mo"ing in clockHwise direction now
number of distinct points at which all three meet 7
aHb ' 6
bHc ' 6
aHc ' ;
so number of distinct points will be the hcf of the differences which is 6 ans.
g%consider three bodies ab with speeds ?= respecti"el, mo"ing in clockHwise direction and c with
speed 8* in antiHclockwise direction now number of distinct points at which all three meet 7
aHb'6
a5c'8;
b5c'))
hcf is ) so the, all will meet at ) distinct points
last $ digits of a number W
divide the number b! #%% then it ill give the last $ digits
if di"ision is cumbersome u ma, use one of the following methods3
points to remember 3
if last ) digits are )? then #abcdef)?%9F where F is a natural number will alwa,s gi"e the last ) digit
as )?.
if last ) digits are 4< then #abcdef4<%9F where F is a natural number will alwa,s gi"e the last ) digit
as 4<.
if the last digit is 8 sa, the number is #abcdefg8%9thgfds then the units digit will be 8 and the tens
digit will be g:s
e.g #8)*8%96?<* last ) digits will be =8.
#sdfdsf)6%9 odd ' last ) digits )6
#dfdsfd)6%9e"en ' last ) digits 4<
#dbfh)<%9odd ' last ) digits )<
#dfdsaf)<%9e"en ' last ) digits 4<
few examples 3
last ) digits for #48%96? ' ?8
#)%9*) ' #)98M%9* : )9) ' #8M)6%9* :)9) ' asAahsA4< :6 ' sdnsAM6
#<%94< ' #*:)%94< ' #;8%98= : #8M)6%94 : #)%9< ' aks)8 : )6 : <6 ' ss?<
last $ digits of a number W
divide the number b! #%% then it ill give the last $ digits
if di"ision is cumbersome u ma, use one of the following methods3
points to remember 3
if last ) digits are )? then #abcdef)?%9F where F is a natural number will alwa,s gi"e the last ) digit
as )?.
if last ) digits are 4< then #abcdef4<%9F where F is a natural number will alwa,s gi"e the last ) digit
as 4<.
if the last digit is 8 sa, the number is #abcdefg8%9thgfds then the units digit will be 8 and the tens
digit will be g:s
e.g #8)*8%96?<* last ) digits will be =8.
#sdfdsf5-%< odd = last 5 digits 5-
#dfdsfd)6%9e"en ' last ) digits 4<
#dbfh)<%9odd ' last ) digits )<
#dfdsaf)<%9e"en ' last ) digits 4<
few examples 3
last ) digits for #48%96? ' ?8
#5%<35 = #5<1?%<3 7 5<5 = #1?5-%<3 75<5 = as>ahs>'( 7- = sdns>?-
#<%94< ' #*:)%94< ' #;8%98= : #8M)6%94 : #)%9< ' aks)8 : )6 : <6 ' ss?<
p.s. correct me if i an, mistakes
thanks for ,our method...but ,ou made a small mistake.i ha"e marked in bold.
1ZW to find the last non Fero digit in x@
+ appreciate &iddharth's approach.
!ollowing is another approach3
nice method...originall, i used this method 3
finding the last non-zero digit of !
The last non-zero digit of a number N is (4^n)*(2n)! ..... (for N = 1!2!"....)
#here n=N$1
"or nos other than multi#les of 10$ the result %an &e easil' &a%( tra%(ed..
for eg.. if u are as(ed for 36!$ then find for )0! and then &a%( tra%t to 36!..
*ut finding 30! and mo+ing to 36! might &e tri%('...sin%e it in+ol+es a 3, and -ill introdu%e an
unne%essar' 0..
here =)0! and n=)0.10 = )
so the last digit is )/n0(2n)! = )/)01! = 602 = 2
2 is the last non-zero digit of )0!$
no- if u -ant to %al%ulate for 36!$
then 36!0201030) = 2 (i am -riting all the last digit)
36!06 = 2
so last non-zero digit of 36! = 2
Iast nonHFero digit of 8M@ ' ;
!or )M@ ' ;:; ' 6 V< is droppedW
This can continue for an, number of 8Ms.
!or example
Iast digit of 4M@ will be gi"en b, ;94
!or last digit of ;94 ' )9)8
'# )98M%9) : )
' 4<:)
')
Therefore last digit of 4M@ is ).
+f ,ou are asked for 4*@ then Aust multipl, the abo"e ) with 48:4):4*
or simpl, ) with 8:):*
Therefore last non Fero digit for 4*@ become ):< ' ) Vignoring 8Ms digitW
alwa,s got confused with power of powers. !ollowing is what i found out3
a9b9c ' a9#b9c%
Abo"e is not e2ual to a9#b:c%
+n fact #a9b%9c'a9#b:c%
Zne correction. +f
Iast nonHFero digit of 8M@ ' ;
then the last nonHFero digit of )M@ ' ;x;x) #this ) comes from )M%';
Iast non Fero digit of 4M@' last non Fero digit of #;94% x)x*x6x?x<x4
That is incorrect.
The power of ) remains the same. Gote that between 8 and 8M we ha"e 6 and ; which are pure
multiples #+ am sorr, to coin this word% of ).
Xust write down the numbers between 88 and )M and ,ou will see the gap.
Iet us consider a triangle AB$ of an, dimension. Gow there is a point E on the line B$ such that it
di"ides B$ into the ratio sa, *3? and there is another point ! on the line A$ such that it di"ides A$
into the ratio )34
Gow the 2uestion is in what ratio does the line AE di"ides the line B!777
Zk since + ha"e alwa,s been weak in geometr, + found this method which i found to be prett,
useful but + can't pro"e it... but is +t has ne"er let me down...
&o the method is this...
All of ,ou might remember the method of balancing a beam in school da,s. &o here's what ,ou can
do. $onsider line A$ such that ! is the fulcrum and A!') units and !$'4units. Gow to balance this
beam we need to put loads in the in"erse ratio ie 43). &o now a load of 4x will act on point A and )x
will act on point $ and a net load of =x will act on point !.
&imilarl, create a beam balance for B$ also. And ,ou ha"e loads at point B ( ! so when ,ou consider
the fulcrum at Z where AE di"ides B! ,ou can calculate the length and that will gi"e ,ou the ratio.
ZU this was not the best of explanations but if ,ou can Aust check out the attached image + belie"e it
will be prett, clear. Attached thumbnails.#later &g . &ost .?%
Difference of &2uares 3
The concept is if there is an, G ' a9) H b9) and a and b are integers.
&o man, wa,s a and b are chosen7
+f G ' a9) H b9) ' #a5b% #aHb% if ,ou want to find integers a and b
then #a5b% and #aHb% should be both either odd or e"en
!or example if we take G ' = in that case = ' =:8 ' *:* #+n this
case both Zdd%
if a5b ' = and aHb ' 8 therefore a ' ? and b ' 6 thats wh, we ha"e
)?H8< ' =
and also if a5b ' * and aHb ' * a ' * and b ' M and thats wh, we =HM
' =
so we see that onl, two wa,s we can represent the number = as
D+!!ETEG$E Z! &BQATE& Z! +GTE0ET& numbers.
+f we extend this concept.
!or odd Gumbers
8% An, odd prime numbers can be represented in ZGID 8 wa,.
!or example 3 * ' *:8 ZGID so onl, 8 wa,
)% Zther than this an, composite Zdd numbers can be represented in
.ore than 8 wa,
!or E"en Gumbers3
8% An, number of the form 6U5) $AGGZT be represented at all hence M
wa,s.
!or example Gumber < ' ):* ' 8:< #&o we don't get an, combination for
either Both E"en or Both Zdd% hence +nteger numbers +& GZT -Z&&+BIE.
)% An, -rime factor .ultiple of 6 is AIWAD& 8 wa,.
!or example 3 Gumber ; ' ):6 ' alwa,s 8 wa,.
The reasoning behind is for prime number ) when mutplied with ) we can
alwa,s break up into factors of E"en numbers. 1ence 6:) we can alwa,s
break up.
And for odd prime numbers we alread, ha"e ) twos in 6 so also we can
break up into 8 wa,s into both e"en factors.
*% An, other e"en numbers more than 8 wa,. &ource 3 B,Au's class Gotes last ,ear
+ts great to keep all the concepts at a single place.
find the sum of all the numbers greater than 1???? formed b* digits 1,3,.,',B C /o
re&etition.
#8 5 * 5 ? 5 4 5 =%:6@:88888 ' <<<<<MM
find the sum of all the numbers less than 8MMMM formed b, digits 8*?4= 7 Go repetition HHHit means
all single digitdoubletriplefour digit nos.
#8 5 * 5 ? 5 4 5 =%#8 5 88:6 5 888:6:* 5 8888:6:*:)% ' 4M8M)?
Aus form the general formula for other number
The general formula is #n,1%M 7 #111...n times% #0um of the terms%.
&o for the 8st $ase where the number of digits are alwa,s same thats is alwa,s a ? digit number then
6@ : #88888% : )? ' <MM : 88888 ' <<<<<MM.
The &econd case is when ,ou take one digit two digit etc.
!or one digit.
&igma #Gumbers % ' )? ' #8 5 * 5 ? 5 4 5 =%
!or two digit ' 8@ : 88 : #&um of the numbers taking two at a time%
' 8@ : 88 : 6$8 : #8 5 * 5 ? 5 4 5 =%
!or three Digits 3
' )@ : 88 : 6$) : #8 5 * 5 ? 5 4 5 =%
!or four Digits 3
' *@ : 88 : 6$* : #8 5 * 5 ? 5 4 5 =%
Adding all
#8 5 * 5 ? 5 4 5 =% : #8 5 6$8 : 88 5 )@ : 6$): 888 5 *@ : 6$*:8888 5 6@ : 6$6 : 88888%
1ence 0eneral terms can be
&igma #Terms% : #8 5 8@ : #nH8%$#8% #88% 5 )@ : #nH8%$) : 888 5 ... #nH8%@ : #nH8%$#nH8% : #8888...n
times%% 0ood one e"en + learnt this concept
!or the first 2uestion#e;&lanation%
1ow man, numbers will be there ha"ing 8 at the first place H 6@
there contribution to sum ' 8:)6:8MMMM
&imilarl, for other numbers it will be *:)6:8MMMM ?:)6:8MMMM and so on
'/ $ontribution of first place to the sum ' #8 5 * 5 ? 5 4 5 =%:6@:8MMMM
&imilarl, for )nd place it will be #8 5 * 5 ? 5 4 5 =%:6@:8MMM
&imilarl, for other places
'/ !inal sum comes out to be #8 5 * 5 ? 5 4 5 =%:6@:88888
+n the similar manner ,ou can tr, next one
There are some =uestions 1here a &erson A and &erson B starts at different time and meets
at a s&ecific time and then reaches the destination at same time from 1here the other has
started.
This t,pe of 2uestions appear fre2uentl, in .ocks and other exams.
Iets sa, person A and B starts from points - and B at different times and meets at point & and
reaches the points B and - at the same time.
-HHHHHHHHHHHHHHHHHHHHHH&HHHHHHHHHHHHHHHHHHHHHHB
HHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHH
Time taken b, person A is sa, t8 and speed being s8.
Time taken b, person B is sa, t) and speed being s).
hence -& ' t8:s8.
&B ' t) : s).
As the, reach the destination at the same time.
hence #t8 : s8%/#t)% ' #t):s)%/#t8%
hence s8/s) ' root#t)/t8%
This is the principle and depending upon the 2uestions use options to keep either the time ratio same
or speed ratio same.
Find the number of 1a*s of selecting - booOs from a set of 15 booOs such that no 5 booOs
are ad>acent to one another.
The usual method in"ol"es finding the total number of combinations and eliminating the in"alid ones.
1ere's a little short cut..
To pick 6 books we'd re2uire at least 4 books.. ie xHxHxHx #where x is book and H is space between
books%
There are * hp,ens. subtract this from the total no. of books. Ans is =c6 #8)H*%
+ normall, use
A 5 B 5 $ 5 D5E ' 8) where 5 are books and A B $ D and E are the separators.
1ence &um of A B $ D E can take 8)H6 #6 Books% ' ;
B $ D /'8 and A and E can be M.
1ence &ubtract ; H* which is ?
hence =$6
6o1 1e can find different &*thagorus tri&lets.
The !ormula is a mixed fraction nVn/#)n58%W
hence G can take "alues from 8).....
hence the first mixed fraction becomes 8V8/*W ' 6/*
Zne side of the p,thagorus theorem is denominator which is * and other side is numerator which is 6
the h,potenuse is 658 ' ?
1ence the triplet is *6?.
Iets take n ' *
)n58 ' 4
.ixed fraction becomes ' )6/4
the first side becomes 4 the other side is )6 and h,potenuse is )658 ' )?
hence 4)6)?.
all the other remaining p,thagorus triplet is multiples of the triplets gi"en b, the abo"e formula
n $ 8n!5n$19 if not mi;ed fraction
a% +n a plane if there are n points of which no three are collinear then
The number of straight lines that can be formed b, Aoining them isnC5.
The number of triangles that can be formed b, Aoining them is nC3.
The number of pol,gons with k sides that can be formed b, Aoining them is nCO.
#b% +n a plane if there are n points out of which m points are collinear then
The number of straight lines that can be formed b, Aoining them isnC5 P mC5 $ 1.
The number of triangles that can be formed b, Aoining them is nC3 P mC3.
The number of pol,gons with k sides that can be formed b, Aoining them is nCO P
mCO.
#c% The number of diagonals of a n sided pol,gon are nC5 P n = n Q #n P 3%!5.
#d% The number of triangles that can be formed b, Aoining the "ertices of a nHsided pol,gon which
has
Exactl, one side common with that of the pol,gon are n Q #n P -%.
Exactl, two sides common with that of the pol,gon are n.
Go side common with that of the pol,gon are n Q #n P -% Q #n P .%!(.
Cauch*,0ch1artD E=uation:
+f a b c d are four real numbers the, alwa,s satisf, the relationship
#a9)5b9)%#c9)5d9)%/'#ac5bd%9)
This can be generaliFed to a large number of "ariables as
#a89)5a)9)5a*9)5.....%#b89)5b)9)5b*9)5....%/'#a8b8 5a)b)5a*b*5....%9)
Buestions3
8/!ind the least "alue of C9)5D9)5F9) if C5),5*E'86
&ol3HH/#C9)5D9)5F9)%#89)5)9)5*9)%/'#C:85D:)5F:*%9)
hence min "alue' 869)/86'86
e"er, odd no is a part of p,thagorian triplet...
the other two nos are two consecuti"e no.s addin up to the odd nos s2ure...
fr *...65?'='*9)
fr ?.....8)58*')?'?9)
.......fr =...6M568';8'=9)
fr )?'*8)5*8*'<)?....i hope so...
in geometr,....we no that in a rt angld isosceles triangle the h,potenuse is tr) times the e2ual sides...
in an isosceles triangle with enclosed angle'8)M degree the larger side is rt* times the e2ual sides...
Fe1 Conce&ts3
8/ !or an, prime number p #pH8%times same digit is repeated then that number formed is exactl,
di"isible b, p
eg. <<<<<< is di"isible b, 4.
)/All perfect s2uares of the form
*U5G where G'M8
6U5G where G'M8
;U5G where G'M86
=U5G where G'M864
*/!or an, two integers satisf,ing *RaRb HHHH/a9b / b9A
6/+f three circles touch Each other in a row and the, ha"e two direct common tangents then their
radii are in 0- series
?/-roduct of factors of a number ' #Gumber %9#total no of factors/)%
</All odd natural numbers can be represented as the difference of two perfect s2uares. All e"en
numbers which are multiple of 6 can be also written as the difference of two perfect s2uares.
4/&uppose we get a 2uestion like#+% A and B start at same time towards each other meet at a point
after time T then reach their respecti"e destinations after time T8 and T) or #++%their start at different
time meet each other at a time where A takes T8 to reach and B takes T) to reach and then reaches
their destination after time T at the same time
Then [A/[B 'Toot#T)/T8%
And T ' Toot#T8:T)% where T is the same the, take either to reach their meeting point in first or
Destination in second case
;/+f a Tight Angled Triangle is rotated about its Axis to generate a cone then the cone will ha"e
maximum "olume when rotated about the smallest side as an axis and minimum when rotated about
the side perpendicular to the smallest side as an axis.
=/+f a n digit number is multiplied b, an #n58% digit number the product has )n or #)n58% digits.
8M/ Difference between -rincipal +nterest and $ompound +nterest for the second ,ear'-r9)
And Difference between -+ and $+ for the third ,ear'-r9)#r5)%where r'#T/8MM%
and - is the amount and T is the rate of interest.
88/+f A and B takes U da,s when working together and C5U and D5U da,s when working alone
respecti"el, to complete a work then #C/U%'#U/D% or CD'U9).
8)/The number of times the sign of the coefficients of an e2uation changes gi"es the number of
roots of a 2uadratic or higher degree e2uation.
8*/The number of wa,s of writing an, number as a sum of two or more consecuti"e positi"e numbers
' number of odd factors of that numberH8. An, number that doesn\t ha"e an odd factor can\t be
expressed as a sum of two or more consecuti"e numbers.
eg. ?M has two odd factors. &o it can be written in onl, one wa, as a sum of two or more consecuti"e
positi"e numbers which is 8858)58*586.
Adding some more fundas:
8% E"er, isosceles TrapeFium is a c,clic 2uadrilateral.
)% if in TrapeFium AB and $D are -arallel sides then A$9) 5 BD9) ' AD9) 5 B$9) 5 ) : AB : $D.
* points are re2uired for a circle. And there are 84 points. hence 84$* circles can be formed. But 4
points are on the same circle.
To Find out *thagorean tri&lets
There is a formula
#G)H8%/)# G)58/)% of an, number G.
!or Example if the number is * the p,thagorean triplets are #*%)H8/) ' 6
and #*%)58/) ' ?.
!or an, other number i.e. @? the triplets are #8?%)H8/) ' 88) and #8?%)58/) ' 88*.
please solve one question from quadratic equations:
if a and b(not equal to 0) are the roots of the eqation x^2+ax+b=0, then the least value of
x^2+ax+b is
1)!" 2)#!" $)#1!" ")1!"
a 5 b ' Ha
'/ a ' Hb/)
ab ' b
'/ a ' 8
'/ b ' H)
&o the e2 becomes x9) 5 x H )
x9) 5 x H ) ' #x 5 8/)%9) H=/6
'/ Ieast "alue will be H=/6
the min. would exist at x' Hb/):a.. and the "alue is ' HD/6:a
b is coeff of x a is coeff of x9)
hence min "al ' H=/6
6o1 to find the number of factor of form #3n $ ?!1!5% of number /.
+ts easier for the factors of kind *n.
Xust find the number of factors of G/* and that will be the answer.
!or factors of form #*n 5 8% or #*n 5 )%
We know that
#*n 5 8%#*n 5 8% ' #*k 5 8%
#*n 5 8%#*n 5 )% ' #*k 5 )%
#*n 5 )%#*n 5 )% ' #*k 5 8%
Iets consider the example of G ' *8*< ' #)9<%:#49)%
i% #*n 5 8%
We know that ) is of form #*k 5 )% but 6 is of form #*k 5 8%.
4 is also of form #*k 5 8%.
&o all the factors of form #*k 5 8% are expressed as #)9)k%:#49n%
k "an take 6 "alues#M 8 ) *% and n can take * "alues #M 8 )%
'/ Gumber of such factors ' 6:* ' 8)
ii% #*n 5 )%
We know ) is of form #*n 5 )%
&o all factors of form #*n 5 )% can be expressed as #)9#)k 5 8%%:#49n%
k can take * "alues #M 8 )% and b can take ) "alues
'/ Gumber of such factors ' *:* ' =
&imilarl, we can go for #6n 5 8% or #6n 5 *% Zr some other form
see all &rime numbers #e;ce&t 5 and 3% can be e;&ressed in the form on (O$1 or (O,
1though the re"erse is not true..i.e. if a number can be expressed in the form of <k58 or <kH8 it is
not necessaril, a prime number...
for exampleH 8*'<:)58?'<:8H8
another wa, of checking whether a number is prime or not is this...
i m explaining it with the help of an example..
sa, the number is 848 and ,ou want check whether the number is prime or not..
so find the nearest s2uare root of the numberin this case it would be 8*#8*9)'8<=%..so di"ide 848
with all prime number less than or e2ual to 8*..in this case check if 848 is di"isible b,
8*884?)*...if it di"isible then the number is not prime else the number will be prime...
E=uations:
8% Buadratic E2uation ax9)5bx5c ' M has maxima ' HD/6a at x ' Hb/)a VD ' b9)H6acW
)% All pol,nomials of degree 8 would be a straight line. hence if a area under the cur"e is asked sol"e
for x ' M and , 'M and we can get the two points and draw straight lines. This helps in elimininating
some options.
*% if the -ol,nomial is gi"en as ax9n 5 bx9#nH8% 5...5 F ' M
then sum of the roots #taken one at a time% ' Hb/a
sum of roots taken two at a time ' 5c/a
similarl, it continues with alternate H/5 signs.
6% !or Buadratic e2uations if a/M then the graph would be a parabola with opens upward and if aRM
then the graph opens downwards.
There are n nonHo"erlapping identical triangles then at max how man, bounded regions these
intersecting triangle can form.
*n9) H *n 5 8
We are drawing ; circles on an infinite plane. 1ow man, maximum distinct regions can be obtained b,
drawing the ; circles in this wa,7
f#n% ' n9) H n 5 )
the three dimensional plane is di"ided into distinct regions #can be unbounded% b, drawing spheres.
1ow man, maximum regions can 6 spheres di"ide the space into7
f#n% ' n9) H n 5 )
$ircle Di"ision b, $hords # for n'8 to n%
8 ) 6 ; 8< *8 ?4 == 8<* )?<
-lane Di"ision b, Iines
G#n%'8/)#n9)5n5)%
There are n non o"erlapping identical rectangles then at max how man, bounded regions these
intersecting rectangles can form.
6n9) H 6n 5 8 ' #)n H 8%9)
Well gu,s here is a small funda for calculating s2uares of number ending with ?. Well man, ma, be
aware of this but this is targeted to those who are unaware of this method. &o here it goes
To find the s=uare of number ending 1ith . liOe 5., 3., '. 13. etc.
$onsider number a number ab? where a and b can be an, number. Then #ab?%9) is concatenation
of#ab :#ab58%% and )? .
&ome examples
#6?%9) ' #6:?%')M. )M concatenated with )? gi"es )M)?.
#;?%9) ' #;:=%'4). 4) concatenated with )? gi"es 4))?
#8=?%9) ' #8=:)M%' *;M concatenated with )? gi"es *;M)?
&ame applies to an, number ending with ? but calculation of # ab:#ab58% % ma, become complicated
with larger digit numbers. Therefore suitable for up to * digits number
0ome =uicO and basic conce&ts ,
8%Tectangle &2uare and +so TrapeFium can be circumscribed in a circle. -arallelogram rhombus and
trapeFium#not iso trapeFium% can't be.
)% Area of c,clic 2uadrilateral ' s2rtV#sHa%#sHb%#sHc%#sHd%W
*% +f one pair of opposite sides are e2ual in a c,clic 2uadrilateral then the diagonals are e2ual.
6% Angle bisectors of c,clic 2uadrilateral meet and form c,clic 2uadrilateral.
?% +n regular pol,gon of G sidescentral angle subtended b, a side ' exterior angle ' *<M/G
<% +n a regular hexagon of side A units the longest diagonal ' )A
4% E2. triangle of side A and an isosceles triangle 8)MH*MH*M#A being the side opp to *M degrees% ha"e
the same area root#*%/6 : A9) ...... and sides of 8)MH*MH*M triangle are in the ratio 8383root#*%
+n a solid figure no. of faces 5 "ertices ' no. of edges5) i.e. !5['E5)
=% +f a larger cube painted b, a color is broken into n smaller cubes then no. of cubes ha"ing
* faces painted ' ;
) faces painted ' 8)#nH)%
8 face painted ' <#nH)%9)
M faces painted ' #nH)%9*
find the remainder when 12^600/100 or say 34^320/107 and the like....
i%ve tried searchin& throu&h the threads and have come across thin&s li'e (hinese
remainder theorem and )uler%s method and stuff****but haven%t been able to find a post that
explains these concepts properl+ and ho, to appl+ them to solve the problems****
!or these kind of problems ,ou can do the following3
step8. 8)9<MM/8MM HH/ now since 8) is less than 8MM let us find power of 8) which is nearer to
8MM.we get 8)9).
step). &o the expr become 8669*MM/8MM HH/ di"ide 866/8MM rem ' 66
step*. The expr now become 669*MM/8MM HH/ repeat step8.
Iike this go on and ultimatel, ,ou will end with a term less than 8MM in numerator. That will be the
remainder. this is a bit time consuming but with practice ,ou will get it.
similarl,... if numerator was 8)9<M8 then ,ou can write it as 8)9<MM : 8). Gow ,ou would ha"e to
find rem#8)/8MM% : rem#8)9<MM/8MM%
+n the end if numerator is greater than 8MM again di"ide b, 8MM. Dou alwa,s ha"e to continue di"iding
b, 8MM until the numerator doesnt become less than denominator.