Trick to Remember Mughal Emperors
Trick to Remember Mughal EmperorsCode -“BHAJI SABJI FOR MAASAAB”
B : Babur
H : Humayun
A : Akbar
JI : Jahangir
S : Shah jahan
A : Aurangazeb
B : Bahadur shah
JI : Jahandar shah
For : Farrukhsiyar
M : Muhammad Shah
A : Ahmad Shah
A : Alamgir II
SA : Shah Alam II
A : Akbar II
B : Bahadur Shah Zafar
Code: ഇപ്പൊ ഭിക്ഷയ്ക്കു അവിടെ പോഡി .
ഇപ്പൊ ഭി - ഹെപ്പറ്റൈറ്റിസ് ബി .
ക്ഷ - ക്ഷയം .
അ - അഞ്ചാം പനി .
വി - വില്ലൻ ചുമ .
ടെ - ടെറ്റനസ് .
പോ - പോളിയോ .
ഡി - ഡിഫ്ത്തീരിയ.
...
Problems Type 1: .
A can finish work in X days. .
B can finish work in Y days.
Both can finish in Z days = (X*Y) / (X+Y). .
Problems Type 2: .
Both A and B together can do work in T days.
A can do this work in X days.
then, B can do it in Y days = (X*T) / (X-T) .
Problems Type 3: .
A can finish work in X days.
B can finish work in Y days.
C can finish work in Z days.
Together they can do work in T days = (X*Y*Z)/ [(X*Y)+(Y*Z)+(X*Z)] .
Problems Type 4: .
A can finish work in X days.
B can finish work in Y days.
A*X = B*Y.
...
Suppose there are n people in the party. The first person shakes hand with the other (n-1) guests. The second guest shakes hand with the other (n-2) guests. this will continue until the (n-1) th guest shakes hand with the nth guest.
Total number of handshakes is (n-1) + (n-2).. + 3 + 2 + 1. .
= ((n-1)(n))/2 .
For example, 6 people in a party shake hand with other guests. So how many handshakes will be there?.
=((6-1)(6))/2.
=15.
...
















