Solution:

2418

Explanation:
The rule that is being followed here is

P ~ Q ~ R ~ S = [first digit of (P * S)] [last digit of (Q * R)] [first digit of (Q * R)] [last digit of (P * S)]

Using the same rule in the incomplete equation,
7 ~ 2 ~ 7 ~ 4 = [first digit of (7 * 4)] [last digit of (2 * 7)] [first digit of (2 * 7)] [last digit of (7 * 4)]
= 2418

Thus 2418 is the missing number.

Solution:

146900

Explanation:
Whenever you face such type of questions, it is wise to begin from the last thing. Here in this question the last thing will be the 9th temple. He climbed down 100 steps and thus you know, he had Rs. 100 before beginning climbing down. Thus, he must have offered Rs. 100 to the god in that temple too (he offered half of the total amount). Also, he must have dropped Rs. 100 while climbing the steps of the ninth temple. This means that he had Rs. 300 before he begand climbing the steps of the ninth temple.

Now, we will calculate in the similar manner for each of the temples backwards.
Before the devotee climbed the eight temple: (300+100)*2 + 100 = 900
Before the devotee climbed the seventh temple: (900+100)*2 + 100 = 2100
Before the devotee climbed the Sixth temple: (2100+100)*2 + 100 = 4300
Before the devotee climbed the fifth temple: (4300+100)*2 + 100 = 8900
Before the devotee climbed the fourth temple: (8900+100)*2 + 100 = 18100
Before the devotee climbed the third temple: (18100+100)*2 + 100 = 36,500
Before the devotee climbed the second temple: (36500+100)*2 + 100 = 73300
Before the devotee climbed the first temple: (73300+100)*2 + 100 = 146900

Therefore, the devotee had Rs. 146900 with him initially.

Solution:

TIF56

Explanation:
The password is formed as:
T (5th letter of Shruti)
I (5th letter of Arshika)
F(1st letter of Friday)
5(5th day of week)
6(Length of Friday)

Similarly, we will pick the 1st letter for Monday and 3rd letter for Wednesday.

Solution:

The woman told him to take out one nut each from the rest of the wheels and use them.

Solution:

A typical way will be to start thinking about summing up the distance that the bee will travel but that will be quite a tedious task. How about we offer you a much easy solution?

The tunnel is 200 miles long and the trains are running at as peed of 100 mph which means that they will collide exactly at the center of the tunnel and seeking their speed, they will collide after an hour.

Now consider the bee which is flying at a speed of 1000 mph and will keep flying till the train collides. As calculated, it will keep flying for an hour which means the distance that it will cover is 1000 miles.

Solution:

Lucky days are here again.

Explanation:
Lucky + Day + s + R + H + Ear + Again (Flower represent lucky symbol)

Solution:

== Mathematical Answer ==
Mathematical Answer = number of seconds in a minute * number of minute in an hour * number hour in a day * number of day in year
60 * 60 * 24 * 365 = 31536000
60 * 60 * 24 * 365.25 = 31557600 (if you want account for leap year)


== We are looking for trick answer (which is 24) ==
Every month contains only 2 second like
A) 2nd January ("second" January)
B) 22nd January (twenty"second" January)

Therefore 2 * 12 months = 24.

Solution:

Just 2

Day One: You make your first cut at the 1/7th mark and give that to the worker.
Day Two: You cut 2/7ths and pay that to the worker and receive the original 1/7th in change.
Day three: You give the worker the 1/7th you received as change on the previous day.
Day four: You give the worker 4/7ths and he returns his 1/7th cut and his 2/7th cut as change.
Day Five: You give the worker back the 1/7th cut of gold.
Day Six: You give the worker the 2/7th cut and receive the 1/7th cut back in change.
Day Seven: You pay the worker his final 1/7th.

Solution:

See the colored sticks in the picture. We have moved those sticks in the position given in the second image corresponding with the color.

Solution:

10 prisoners must sample the wine. Bonus points if you worked out a way to ensure than no more than 8 prisoners die.

Number all bottles using binary digits. Assign each prisoner to one of the binary flags. Prisoners must take a sip from each bottle where their binary flag is set.

Here is how you would find one poisoned bottle out of eight total bottles of wine.

Bottle 1 Bottle 2 Bottle 3 Bottle 4 Bottle 5 Bottle 6 Bottle 7 Bottle 8
Prisoner A X X X X
Prisoner B X X X X
Prisoner C X X X X
In the above example, if all prisoners die, bottle 8 is bad. If none die, bottle 1 is bad. If A & B dies, bottle 4 is bad.

With ten people there are 1024 unique combination so you could test up to 1024 bottles of wine.

Each of the ten prisoners will take a small sip from about 500 bottles. Each sip should take no longer than 30 seconds and should be a very small amount. Small sips not only leave more wine for guests. Small sips also avoid death by alcohol poisoning. As long as each prisoner is administered about a milliliter from each bottle, they will only consume the equivalent of about one bottle of wine each.

Each prisoner will have at least a fifty percent chance of living. There is only one binary combination where all prisoners must sip from the wine. If there are ten prisoners then there are ten more combination where all but one prisoner must sip from the wine. By avoiding these two types of combination you can ensure no more than 8 prisoners die.

One viewer felt that this solution was in flagrant contempt of restaurant etiquette. The emperor paid for this wine, so there should be no need to prove to the guests that wine is the same as the label. I am not even sure if ancient wine even came with labels affixed. However, it is true that after leaving the wine open for a day, that this medieval wine will taste more like vinegar than it ever did. C'est la vie.

Solution:

192

Explanation:
I started with the number 192.
Adding the reversed 291 to 192 gave me 483.
Similarly,
483 + 384 = 867
867 + 768 = 1635
1635 + 5361 = 6996