1) Discriminant of equation < 0 =>

a) roots are imaginery

b) the expression is +ve (x+iy)(x-iy)
c) Sum of 2 roots are also +ve
2) The areas of triangles with the same vertex and bases on the same straight line are in the
ratio of the squares of the lengths of their bases
3) Time and work- concept of number of units of work is important. This can be found by
calculating LCM of all 3 days and dividing by the individual days. If A,B,C can finish in 15, 20,
25 days, A can finish 300/15=20, 15, and 12 units of work respectively. This concept is
important and can be applied to calculate units of work when working together. Ex. When A
nd B work together then can finish 35 units of work in a day—When B&C work together, then
can finish 27 units of work in a day and when C&A work together they can finish 32 units of
work together. In this case, please note that C&A working together is faster than B&C
working together. This concept is useful in calculating maximum amount of work that can be
finished using single or a combination of one or more workers
4) Probability- rolling dices—Calculate probability by calculating individual probabilities by
multiplying probabilities of each person rolling the dices.. Then add up all the cases
5) Geometry- Join appropriate lines in figure and apply similar triangle concept..
6) Interior angle of a polygon= (n-2)180 and exterior angle=360/n
7) In Venn diagram qstns in words, calculate by drawing..
8) In calculating the number of real values for x^y=a^b, consider possibilities of base i.e x/a=-
1,0,-1
9) Number of ways in which a natural number N can be written as a product of two coprime
numbers is given by 2^(k-1) where k is the number of different prime factors of N. Least
possible such number is 2*3*5*7=210 and number of factors of 210=2*2*2*2=8
10) Diff b/w s.i and c.i for 2 yrs is p (r/100)^2 and c.i= P (1+r/n*100)^n*t where n= int.
Compounded no. Of times annually so n=4 for quarterly, 2 for semi-annually.
11) Interesting and useful concept.

IN above example, triag apb is on same base and between 9/13 of same parallels. So 2*area
of apb=9/13 area(ABCD) where area of fpe is 16y and area of apb is 81y since fe is 4y and
ab=9y.
12) Tangent secant theorem—angle at tangent equal to angle inside circle.... chk details..
13) Cyclic quad properties – a quad is cyclic only if opp angles are supplementary or ext angle is
equal to interior angle or if all vertices touch 4 distinct points inside the circumference of a
circle.
14) Time and distance—When 2 persons move in opp directions in a circular track, addition of
their speeds is equal to a multiple of the number of times they meet and when they move in
same directions, difference of their speeds is equal to a multiple of the number of time they
 meet. Ex: if x:y, then x+y=7 and x-y=3, so their speeds are in the ration of 5a and 2a. If the
number of times they meet is not given and only ratio of speeds are given, you have to
calculate the circumference from this L.c.m of difference and addition of speeds—then
calculate the time points where they meet and so on..—examples are: Let the speed of A, B
and C be 5v, v and v respectively. A&B in same and C in opp.
Let the circumference of the track be 12vt.
Instance when A meets:
B – 3t, 6t, 9t, 12t, 15t, 18t ....
C – 2t, 4t, 6t, 8t, 10t, 12t ....
In every 6t units of time A meets B twice while A meets
C thrice. So in 36t A would give:
B – 2 × 6 = 12 cards
C – 3 × 6 = 18 cards. (total 30)
THERE ARE ALSO QSTNS WHEN THEY ASK NOT ABT MEETING POINTS BUT POINTS WHERE
THERE IS A SPECIFIC SPACING (EX: ONE-FOURTH CIRCUMFERENCE) BETWEEN THE TWO
BODIES
#1. When 4 bodies A,B,C,D ( it can be any number of bodies, I'm taking 4 here) move in a
circular track in the same direction with different speeds, then find the time of their first
meet?
Sol-> First, looking at their speed's , determine which is the fastest .Let say A is the fastest.
Then find the time taken by A to overtake B,C & D and let these time be T1,T2&T3. Now the
LCM of these times will give the result
#2. When 4 bodies A,B,C,D ( it can be any number of bodies, I'm taking 4 here) move in a
circular track in the same direction with different speeds, then find the time of their first
meet at the starting point?
Sol-> Find the time taken by each body to complete 1 complete circle. Let those be
T1,T2,T3,T4. The LCM of all these 4 times will give you your desired result
Funda is If the two bodies are moving in opposite direction.
# They will meet first time after covering a total distance of d
# For subsequent meetings they will meet after covering a total distance of 2d.
So we can generalize it to be d(2n+1)
Similarly, If the two bodies are moving in same direction.
# They will meet first time after covering a total distance of 2d
# For subsequent meetings they will meet after covering a total distance of 2d.
So we can generalize it to be 2dn.
Cars start in opposite direction with speeds 60km/h and 40km/h
Relative speed = 100km/h
Distance b/w them (d)= 120 km
Time taken to cover (d) = 1.2hrs
their meeting will go by the general formula ( 2n+1)d, so their next meeting will be when
both of them cover distance of 3d,5d,7d.....so on
Time taken to cover (2d) = 2.4hrs
No of meeting in 20 hrs = [(20 - 1.2)/2.4 ] + 1 = 8 meetings
However, when the track is circular (or a triangle or a hexagon, pentagon... i mean any joint
track which has no end unlike straight line, or you can say when the participants will keep
 on running without changing direction unlike straight line where they have to change the
direction after reaching one end), the 2 persons would cover a single track length every time,
and not double the track length....
15) In compound interest, if loans are repaid every year in equal instalments, then situation is
same as borrowing same money from 3 different sources for 1,2,3 and... years...
16) Whole nbrs vs nat nbrs
17) Area of triangle= r*s=abc/4R
18) Grouping of first and last, second and second last is a handy concept in series
19) Minute hand covers 360/60= 6 degree per minute and hour hand covers 30/60=1/2 degree
per minute.
20) 3 roots –x+y+z= -b/a, xyz=d/a, xy+yz+zx=c/a
21) In Bayes Theorem, P(A∩B)= P(A).P(B|A)=P(B).P(A|B)
22) Ratio proportion –when 2 solutions (a%,b%) mixed with (c%, d%) to make (10%,16%) then a-
10/10-c=b-16/16-d;CHECK OUT FOR IMPOSSIBLE CASES ex: if milk is 60% in one soln and
70% in another, resulting soln milk % has to be b/w 60 and 70
23) The circle with equation x2+y2+2gx+2fy+c=0 has centre (-g,-f) and radius √{g2 + f2 –c
24) To find sun of coefficients of a polynomial (x-1)?^6(x-1)^5.. and so on, substitute x with x=1
25) Time gap between first two meetings will be double time taken for first meeting if 2 people
meet multiple times running in opposite directions in a st line with speeds x and 2x resply.
They will meet at d,3d,5d... (total dist travelled by 2 people)
26) a) If we have to divide 3 distinct objects (A,B,C) in 2 distinct partitions in 2^3(r^n) ways. Ex: 3
different colored balls placed in 2 different boxes
b) if we have to divide 3 distinct objects (A,B,C) in 2 non-distinct partitions in 2^3/2!
( r^n/r!) Ways ex: 3 different colored balls in 2 identical boxes.
19) a) Number of ways of partitioning n non-distinct things into r distinct groups is (n-1)C(r-1) –all
groups non-empty. Ex: 4 identical chocolates distributed among 4 different boys so that one boy gets
at least one chocolate.
b) Number of ways of partitioning n non-distinct things into r distinct groups is (n+r-1)C(r-1) –
some groups empty ex: 4 identical chocolates distributed among 4 different boys so that any boy can
get 0 chocolates.. qstns are common in CAT
20) Number of ways in which (m+n+p) items can be distributed among 3 people in groups containing
m,n,p items is Number of ways to divide * Number of groups = (m+n+p)!/M!N!P! * 3!

1. how many ways one can put

(a) 4 different boll in 3 different bag
(b) 4 identical ball in 3 different bag
(C)4 different boll in 3identical bag
(d)4 identical boll in 3identical bag
1) 4 identical balls in 4 identical bags: (This is easy one)
5 ways:
(4, 0, 0, 0), (3, 1, 0, 0), (2, 2, 0, 0), (2, 1, 1, 0) or (1, 1, 1, 1)

(2) 4 identical balls in 4 different bags: (This is also easy one)

It is like this:
a+b+c+d = 4
 where a, b, c and d are number of balls in each bag.
So, 7C3 ways
(3) 4 different balls in 4 different bags: (This is also easy one)
Each ball can go to one of the 4 bags. So, it has 4 choices. So, it will be 4*4*4*4.. 4 choices
for each.
So, 4^4.
(4) 4 different balls in 4 same bags: (This is calculation bsed..)
This is based on first case (1)
(4, 0, 0, 0) => 1 way only
(3, 1, 0, 0) => 4C3 ways
3 balls to be grouped can be chosen in 4C3 ways and remaining one in 1 way
(2, 2, 0, 0) => 2 balls can be chosen in 4C2 ways.
So, 6 ways. But, as we select 2, at the same time we make one more pair of remaing 2. So, at
one time, we take care of 2 cases. So, we can take 4C2/2 = 3 ways.
(2, 1, 1, 0) => 4C2
4C2 ways to chose 2 balls and then reaming will be 1 and 1.
(1, 1, 1, 1) => 1 way only
21) The number of ways in which mn different items can be divided equally into m groups each
containing n group and the order of groups is important is (mn)!/(n!)^m ex: Number of ways to
divide a pack of 52 cards equally among 4 players in order is (4*13)!/(13!)^4
If ‘n’ distinct items are arranged in a row, then the number of ways they can be rearranged such that
none of them occupies its original position is,
n! * ((1/0!) – (1/1!) + (1/2!) – (1/3!) + … ((-1)n/n!))
Note: De-arrangement of 1 object is not possible.
Dearr(2) = 1; Dearr(3) = 2; Dearr(4) =12 – 4 + 1 = 9; Dearr(5) = 60 – 20 + 5 – 1 = 44
2 .................. 1
3 .................. 2
4 ................. 9
5 ................. 44
6 ................. 265
If you know first two values(for 2& 3) you can calculate rest values as follows:
Tn = (n-1)*[Tn-1 + Tn-2]
e.g. For n=5
T5 = (5-1) * [T4+T3]
= 4*(9+2)
= 44
Example,
A person has eight letters and eight addressed envelopes corresponding to those letters. In how
many ways can he put the letters in the envelopes such that exactly 5 of them get delivered
correctly?
Solution,
At first, select the five letters that get delivered correctly. That can be done in 8C5 ways.
Now, the other three must get delivered to the wrong address. That can be done in Dearr(3) = 2
ways.
So, total ways is 2 x 8C5 = 2 x 56 = 112 ways
There are 16 teams and they are divided into 2 pools of 8 each. Each team in a group plays against
one another on a round-robin basis. Draws in the competition are not allowed. The top four teams
from each group will qualify for the next round i.e round 2. In case of teams having the same
number of wins, the team with better run-rate would be ranked ahead.
1. Minimum number of wins required to qualify for the next round _____?
2. Minimum number of wins required to guarantee qualification in the next round _____?
Now, i don't know how many of you are aware of the following method. But 1 thing I mention in
advance that this should take only 30 seconds to solve
1.1 group is consisting of 8 teams. So each team will play 7 match each. Suppose each of the 8 teams
were seeded and we consider the case where a higher seeded team will always win.
So the number of wins for the 8 teams would be 7,6,5,4,3,2,1,0 with highest seeded team winning all
and lowest seeded team losing all.
For minimum number of wins we allow 3 teams to win maximum number of matches. Of the
remaining 5 teams just find out the mean of their number of wins.
In this case it would be (4+3+2+1+0)/5=2.
So 5 teams can end up with 2 wins each and a team with better run rate will qualify with 2 wins.
2.In this case consider the mean of first 5 higher seeded teams
(7+6+5+4+3)/5=5
So it may be the case that 5 teams can end up having 5 wins each. And hence 1 team will miss the
second round birth. So minimum number of wins to guarantee a place would be 6.
Square of 93
it would be 9^2 = 81 and 3^2 =9
step 1 : 8109
step 2: 9x3=27 .. double it 54..add 0 to the end. becomes 540.
add to step 1 number : 8109+540= 8649. the answer
to find sqrt
nearest square root +/- (depends u"ll see) (difference /2*nearest square root)
sqrt 23
nearest number = 16 sqrt 16 =4
so diff=( 23-16)=7
4+ 7/(2*4)
4+7/8
rest u can do

If |x| +|y|=a
then the area of the region bounded by the given curve will be 2a^2.
This is also valid also when |x+k|+|y+k|=a
Find the area of the region bounded by the graph |x-7|+|y-9|=12 (AIMCAT 1209)
Area bounded by the graph |x-7|+|y-9| = 12 is same as Area bounded by the graph |x|+|y|
= 12 and that is
=>2*12^2=288 sq units

Cities A and B are in different time zones. A is located 3000 km east of B. The table below
describes the schedule of an airline operating non-stop flights between A and B. All the
times indicated are local and on the same day.
See tableDeparture
City Time Arrival Time
B 8 am A 3 Pm
A 4 pm B 8 pm
Assume that planes cruise at the same speed in both directions. However, the effective
speed is influenced by a steady wind blowing from east to west at 50 km per hour.
1. What is the time difference between A and B?
(1) 1 hour and 30 minutes
(2) 2 hours
(3) 2 hours and 30 minutes
(4) 1 hour
(5) Cannot be determined
2. What is the plane’s cruising speed in km per hour?
(1) 700
(2) 550
(3) 600
(4) 500
(5) Cannot be determined
Solution
Let the speed of the plane be x
so speeds from B to A and A to B are x-50 and x +50 resp.
So total time of travel including the 1 hour stop is 12.....
3000/x-50 +1+ 3000/x-50 =12
Solve from the options.ull get 550...
Now, going by this the plane takes 3000/550-50 = 6 hrs to to reach A
But time shown is 7 hours ...so Time diff is 1 hour...
Round Robin/League Games:
Suppose A,B,C,D,E,F play each other exactly once. Top 2 Qualify for Finals.
4 Standard Questions:
Q1. Find total no. of matches.
Q2. Min. no. of matches a team must win in order to have a chance of qualifying.
Q3. Max. no. of matches a team can win and still not qualify.
Q4. Min. no. of matches a team must win to reach next round undisputed/ guaranteed.
A1. Easiest of the lot.
A2. If top "k" teams are supposed to qualify for the next round then choose top k-1 teams
and make them win as many matches as possible. Distribute the remaining points equally/
as equal as possible.
A3. If top "k" teams are supposed to qualify then choose top k+1 teams and make them beat
every other team then you'll be left with matches between k+1 teams. Distribute as equally
as possible.
A4. A3 + 1
For the example quoted.
A1. 6C2
A2.
A5B2C2D2E2F2
Answer is 2.
A3.
A4
B4
C4
Answer is 4
A4. Answer is 5.
The question will be like, there are 64 players in a knock out tournament and every player is
ranked (seeded) from 1 - 64. And now the matches are played in such a manner that in
round one the 1st seeded player plays with the 64th, 2nd with the 63rd and so on.
The players who win move on to the next round whereas others are out of the competition.
In second round the winner of match 1 will play winner of the last match (which was
between seed 32 and seed 33), and winner of match 2 will meet the winner of second last
match in round 1 and so forth.
Thus after N number of rounds winner is declared.
In these Questions: the term UPSET means when a lower seeded player beats the higher
seed.
Now the Questions: I will start with basic and gradually move up:
Q1: Which seeds will play Match no 4 and Match no 9 in Round 1 of a 32 player
tournament?
Ans: Easy: 4 Vs 29 & 9 Vs 24 resp
Time for trick: Notice one thing the sum of the seedings in every match will be equal to total
players + 1.i.e. 1 + 32 = 33, 2 + 31 = 33.
In round of 64, sum of seeds will be 65, and in round of 16, sum of seeds will be 17. And so
forth. (This will be useful in solving complicated questions)
This way we can easily calculate the opponents in any round.
For eg: If ques is: In a tournament of 128 players who will play 36 in round II if there are no
upsets?
No need to do any back calculations: Just see in Round 2 there will be 64 players. So the
opponent of 36 will be = 65-36 = 29. Similarly u can calculate for anyone.
Now this was without upsets, lets take a ques on upsets:

Q: Who will meet Seed 68 in the Quaterfinals of a 128 format tournament, if seed 5 lost in
the prequarters and there was no other upset?
Now the ques seems complicated but its not if we go step by step using the above method:
try once to solve the ques urself and then read further:
So We know Seed 68 is in Quarters that means he has defeated Seed 129 - 68 = 61 in round
1. Now 61 would have played 65 - 61 = 4 in round 2 (Which now 68 will be playing). Now, 68
has defeated 4 as well as he is in quarters.
Now look at the quarters opponent of 4 (68 will be playing with him) - its 9-4 = 5. We know 5
has lost in pre quarters where his opponent was 17 - 5 = 12.
So opponent of 68 will be 12.
Once you are through with the concept these questions will be a cakewalk.
This is just an example u can try for more no. of yrs or different values including negatives
Some painted cube funda
We assume the cube is divided into n^3 small cubes.
no. of small cubes with ONLY 3 sides painted : 8( all the corner cubes )
no. of small cubes with ONLY 2 sides painted :
thus, then number is, 12 * (n-2)
no of small cubes with ONLY 1 side painted :.
so th number is, 6*(n-2)^2
no of small cubes with NO sides painted :
cubes with no sides painted.
this number will be equal to, (n-2)^3.
Also, remember for Cuboids with all different sizes, the following are the results:
a x b x c (All lengths different)
Three faces - 8 (all the corner small cubes of the cuboid).
So, total with two faces painted = 4(a - 2) + 4(b - 2) + 4(c - 2)
So, total with one face painted = 2(a - 2)(b - 2) + 2(a - 2)(c - 2) + 2(b - 2)(c - 2)
Zero faces -(a - 2)(b - 2)(c - 2)
To verify for a cube, put a=b=c=L, you get
Three faces - 8
Two faces - 12(L - 2)
One face - 6(L - 2)^2
Zero faces - (L - 2)^3

|x-a| + |x-b|......takes minimum value at median of a,b,c,d

1. a^n + b^n is div by (a+b) if n is odd
2. a^n - b^n is div by (a+b) if n is even
3. a^n - b^n is always div by (a-b
So whay u say what will be the min value of |x-1|+|x-3|+|x-4|+|x-6|??
here median values are 3 and 4 .. so min value will be at 2 places, i.e. both 3 and 4 (which is
equal to 6)..
Putting it as a formula:
to find the min value of p(x)=|x-a|+|x-b|+|x-c|+|x-d|+....
1) when no. of terms are odd, min. value of P(x) would be at x=median(a,b,c,d,...).
2) when no. of terms are even, min p(x)= |d-a|+|b-c| i.e (|nth term- 1st term| + |n-1th
term- 2nd term| + ---- ), where a<b<c<d<.... nth term

if % growth is given for yrs(over the previous) lets say

2001 _ 2002 _ 2003 _ 2004
1 _____ 2 ____ 3 _____ 4
overall % growth in 2004 over 2000 would be 10.355024
solution:- multiplication of 4 no.s together considering base as 100 ( no.s should be nearby
100)
101 = 100 + a
102 = 100 + b
103 = 100 + c
104 = 100 + d
____
---110------35-------50------24
100+S(a)---S(ab)--S(abc)---S(abcd)
S = sigma , S(ab) = Sum of pdt of no.s taken two at a time!!!!!
this case is valid of any no. of products or any number u can take in place of a b c d negatives
included....
so if numbers are small just like 1 2 3 4 here then u can neglact the no,s 50 and 24 as they
will not be needed and directly can say that growth is 10.35%
********Care to be taken all the S should be placed there in 2 digit form so if no. of digit is
less (example - 2*3 = 06) add 0 to it and make it 2 digit no. and if S is of 3 digit then take a
carry to next no.
example
110
105
103
______
118 95 150
let the eqn be 7x+4y = 41
to find out possible combinations , we are using remainder funda
divide by 4
so rem(7x/4) = rem(41/4)
hence x =3 thn find y= 5
its even better for much bigger values
e.g. 99x+2y=5481
here rem(2y/99)=36
y =18 n find x
now we can find a series of solutions to find next solution
just cross add n subtract othr , 7x+4y=41 we got 1st solution as x=3 y=5
nxt solution will be (3+4,5-7)=>(7,-2) nxt will be (11,-9)
we can reverse the operation n get solution in othr way means (4-3,7+5)
Zeller's rule
Zeller's rule is used to calculate the day on which any date falls for any year. With this
technique you will have the calendar for any given year available to you.
The rule is as follows
f = k + [(13*m - 1)/5] + d + [d/4] + [c/4] - 2*c
where,
k = day of month
m = month number, taking Mar=1, ..., Dec=10, Jan=11, Feb=12
d = last two digits of year, using the previous year for Jan and Feb
c = first two digits of year
Rules:
1.In Zeller's rule the year begins in March and ends in February. Hence, the month number
from March is 1, April is 2, May is 3 and so on up to January, which is 11, and February is 12.
2.January and February are counted as the 11th and 12th months of the previous year.
Hence, if you re calculating the day of any date on January 2026, the notation will be
(month=11 and year= 2025) instead of (month=1 and year=2026).
3.While calculating, we drop off every number after the decimal point.
4.Once we have found the answer we divide it by 7 and take the remainder. Remainder 0
corresponds to Sunday; Remainder 1 corresponds to Monday ; Remainder 2 corresponds to
Tuesday and so on....
Example:
Find the day on 26th June 1983
f = k + [(13*m - 1)/5] + d + [d/4] + [c/4] - 2*c
Here k=26, m=4, d=83, c =19
f= 26+(13*4-1/5)+83+83/4+19/4-2*19
= 105
105 divided by 7 leaves a remainder 0. Hence the day is a Sunday!
Some pretty rudimentary fundas, but these hv helped me several times:
1)If we need to form an AP with all primes, then there cant be more than 10 primes in that
AP. (The logic is something about the density of primes, google it if u like).
2)Any number repeated 3k times is perfectly divisible by 37.
3)Any number repeated 6k times is perfectly divisible by 11 & 13.
(2) and (3) remainders mein kaafi kaam aate h.
-----------------------------------------------------------------.
If the coefficients of an equation are all positive then the equation has no positive root.
Hence, the equation 9x^5 + 6x^3 + 5x^2 + 3x + 1 = 0 has no positive root.
• If the coefficients of even powers of x are all of one sign, and the coefficients of the odd
powers are all of opposite sign, then the equation has no negative root. Hence, the equation
16x^4 - 12x^3 + 15x^2 - 12x + 1 = 0 has no negative root
• If the equation contains only even powers of x and the coefficients are all of the same sign,
the equation has no real root. Hence, the equation 4x^4 + 4x^2 + 2 = 0 has no real root.
• If the equation contains only odd powers of x, and the coefficients are all of the same sign,
the equation has no real root except x = 0. Hence, the equation 7x^5 + 6x^3 + x = 0 has only
one real root at x = 0.
• Descartes' Rule of Signs : An equation f(x) = 0 cannot have more positive roots than there
are changes of sign in f(x), and cannot have more negative roots than there changes of sign
in f( - x). Thus the equation x^4 + 7x^3 - 4x^2 - x - 7 = 0 has one positive root because there is
only change in sign. f( - x) = x^4 - 7x^3 - 4x^2 + x - 7 = 0 hence the number of negative real
roots will be either 1 or 3.

Q. suppose a person has to travel from point A to point B ( refer the attachment plz ). So
what is the shortest possible no. of ways in which he can reach point b ??
A. the no. of ways of reaching B from c or d or e or g or h is 1 . Now no of ways from h to B
will be no written on its right hand side + no. written below it. ( in this case 1 way (from c) +
1 way (from d) = 2) .
similarly no of ways from i to B will be 2 (from h) + 1(from e) . hence add up all the nos. and
the final no which u recieve at A is ur ans.
I observed the following relation while solving ssuch questions which will save more time :
No. of ways from A to B = nCr ( read as n combination r as in P&C .. sorry cudnt figure out
how to use subscript and superscript , where
n = total no of horizontal lines + total no. of vertical lines included in the whole box ( i.e in
this case we have 4 vertical lines but only 2 are included in the box or u can also say total no
of vertical lines - 2 ) and r = min value ( no of units we have to move to reach adjacent to B
( ie in this case we have to move 2 units down from A to reach in horizontal plane with B and
4 units right from A to reach in vertical plane with B )
so in this case n = 3 ( horizontal lines ) + 2 ( vertical lines - 2 ) = 5
and r = min ( 2 , 4 ) = 2
so no of ways = 5C2 = 10
2. Successive Discount of a% and b % is equivalent to Discount =
(a + b -ab/100) %
To calculate the last digit of any no. raised to any power .
I have generally observed people doing it either by using cyclicity or by using Euler (i.e, they
find the remainder of the no. divided by 10).
But I have never applied any of these methods.
Here follows the method:
Find the unit digit of abc^x.
Case 1: x is divisible by 4.
--> If c is even the unit digit will come out to be 6, ALWAYS **
--> If c is odd the unit digit will be 1, ALWAYS***
Case 2: x is NOT divisible by 4.
Step 1: Find the remainder of (x/4), say you get it as d.
Step 2: Now calculate c^d.
Step: The unit digit of c^d will be unit digit of abc^x.
my contribution to the forum suppose we have a question of time and work where earlier
there were 10 workers working for 12 hrs a day dig a hole of 2feet radius and 12 feet height
in 14 days now find the number of days required by 28 workers working 8 hrs a day and
digging a hole of 3 feet radius and 15 feet height can be done easily like this
we need to find the no of days
so days= we will take each quantity individually earlier there were 10 men now there are
28 so days will decrease hence it will contribute 10/28 of no of days then the no of hrs are
decreasing from 12 to 8 it will contribute to an increase hence it will contribute 12/8 to the
no of days then volume of cylinder is increasing from 48pi to135pi hence it will contribute
135pi/48pi to number of days so final answer is
days =10/28*12/8*135pi/48pi *14
which is 21.09 or 21 days approximately
Basic Concept Fundas
1. If there are n number of straight lines , They intersect each other in nc2 ways
2. If there are m number of circles , They intersect each other in
 2*(mc2) ways = m (m-1)= mp2 ways
3. When n straight lines and m circles intersect each other , they intersect in
at most 2 * m * n = 2* ( no. of circles ) * ( no.of straight lines)
4. When n parallel lines intersect m straight lines , Then no. of parallelograms possible = nc2
* mc2= mn (m-1) (n-1)/4
Last non-zero digit of 10! = 8
For 20! = 8*8 = 4 [6 is dropped]
This can continue for any number of 10s.
For example,
Last digit of 70! will be given by 8^7
For last digit of 8^7 = 2^21
=( 2^10)^2 * 2
= 76*2
=2
Therefore, last digit of 70! is 2.
If you are asked for 73!, then just multiply the above 2 with 71*72*73
or simply 2 with 1*2*3
Therefore, last non zero digit for 73! become 2*6 = 2 [ignoring 10s digit]
LR Notes
1) if 6 teams play with each other 6 times, then they each play 30 times- so there are
30*6/2=90 Matches. Number of wins= Number of losses
2) In circular arrangement, between means no space between- So A is between B and C
means B,A,C/C,A,B are in sequence
3) If any of the choices does not match with any of the possible cases, then that choice is
wrong. For true statement , it has to be true in all possible arrangements.
Destruction of a PJ Follow these steps religiously:
Identify a Dangler: A dangler is a sentence which is not connected with the rest. A Dangler has
to be an opening line or concluding line. Ways to identify danglers:
o By Pronouns: If there is a pronoun present which cannot be traced to any of the
nouns in the other sentence, then it has to be a dangler. Probably its a concluding
line of some para
o By Subject Matter: Danglers can be spotted by looking at the subject, if author is
quoting someone, there should be a reference of it in following line. If there isn't
one, Its a opening line of a new para. e.g. [D].... Place it in last
 Linking. Linking two sentences is a common practice and everyone knows about it
o By Pronouns ,By Structure words, very very important,Genral idea followed by
example or specific idea
 De-Linking... Its to separate different sentences. We have to pick the tone of each sentence,
o Positive (P) ,However followed by positive (HP)
o Negative (N),However followed by Negative (HN) ,Neutral (E)
Now to switch between the tones, from P to N or N to P, there must be a HP or HN.
e.g. following can be Structure of a para
P P P P HN ,P P P HN N ,P P HN N N ,P HN N N N ,N N N N HP ,N N N HP P ,N N HP P P ,N HP P P P