Solution:

b+g = 8

Explanation:
for b in range(1,99):
for g in range(1,99):
sum1=2*b*g+42
sum2=(b+g)*(b+g+1)
if(sum1==sum2):
print(b,g,sum1)

(b,g)=(3,5) => b+g=8

Solution:

Ms. Britney did it.

We will take up every person and analyze the statements over all of them one by one.

Case 1: Ms. Britney did it, then
Statement 1 => true
Statement 2 => false (as Rihanna did not do it)
Statement 3 => false (as Ms. Britney is lying)
Statement 4 => false (as Ms. Gwyneth is lying)
Our first guess itself was right but let us confirm our analysis by analyzing the statements over others.

Case 2: Ms. Rihanna did it, then
Statement 1 => false (as Ms. Britney did not do it)
Statement 2 => true
Statement 3 => true (as Ms. Britney is not lying)
As per the conditions, three statements had to be wrong but here, we have two statements right which clearly contradict the condition.

Case 3: Ms. Gwyneth did it, then
Statement 1 => false (as Ms. Britney did not do it)
Statement 2 => false (as Ms. Rihanna did not do it)
Statement 3 => false (as Ms. Britney is lying)
Statement 4 => false (as Ms. Gwyneth is lying)
She did not do it as all the statements are false.

Case 4: Ms. Yoon did it, then
Statement 1 => false (as Ms. Britney did not do it)
Statement 2 => false (as Ms. Rihanna did not do it)
Statement 3 => false (as Ms. Britney is lying)
Statement 4 => false (as Ms. Gwyneth is lying)
All four statements are false in her case as well thus she did not do it.

Therefore we have proved that Ms. Britney did it.

Solution:

1/2

one of two is the possibility
1. If any of the first 99 people sit in Abhishek seat, Abhishek will not get to sit in his own seat.
2. If any of the first 99 people sit in Aishwarya's seat, Abhishek will get to sit in his seat.

Solution:

Hockey Stick $49.50 & ball $0.50

Solution:

Let m be initial number of flowers and n be the flowers offered at each temple by the man.
Initial flowers = m
After stepping into the first temple = 2m
Flowers offered at the first temple = n
Remaining flowers = 2m – n

After stepping into the second temple = 4m – 2n
Flowers offered at the second temple = n
Remaining flowers = 2m – n

After stepping into the third temple = 8m – 6n
Flowers offered at the third temple = n
Remaining flowers = 8m – 7n

Now as per the question (8m – 7n) must be equal to 0.
i.e. 8m – 7 n = 0
or 8m = 7y

Now the least numbers required to solve this equation are 7 and 8 for m and n respectively.

Thus m = 7; n = 8
Which means, the man had 7 flowers in the beginning and he offered 8 flowers at each temple.

Solution:

First fill the 8 liters jug complete - 4, 8, 0
Fill the 5 liters jug with 8 liters jug - 4, 3, 5
Pour back the beer from 5 liters jug to 12 liters jug - 9, 3, 0
Pour the 3 liters from 8 liters jug to 5 liters jug - 9, 0, 3
Fill the 8 liters jug completely from 12 liters jug - 1, 8, 3
Fill the 5 liters jug from the 8 liters jug - 1, 6, 5
Pour the entire 5 liters jug back in 12 liters jug - 6, 6, 0

You have successfully split the beer into two equal parts.

Solution:

Fifteen Minutes.

After frying for five minutes, you can take out one steak and put the third one inside while turning the other one inside. After five more minutes, one steak is fried from both sides and you can take it out. Now put in the steak that we removed and turn the other one inside. After five more minutes, they both will also be fried from both sides.

Solution:

Jamie is a window cleaner who was tired after cleaning the windows on the 45th floor and thus leaped inside the building.

Solution:

13 x 3 + 1 = 40

The number of decks is absolutely not relevant here which means whether we mix 5 or 500 cards still results would be same.
Any card drawn will be a Ace,2,3,4,5,6,7,8,9,10,Jack,Queen or King, so there are 13 possibilities each time a card is drawn.
If you are lucky just 5 cards of the same kind can be obtained in 4 steps

The unluckiest(worst) way is our solution as we need to guarantee a four of a kind.
Draw 3 of each kind =>now we have 39 cards. Next card will guarantee 4 of a kind.

Solution:

The code word is TIE.

Let us assume that the word is MOD. Now if you are told one character of this word, you would not be able to identify the number of vowels in the word. For example if you are told M, then the word can be MOD or AIM but they both have different number of vowels. If you are told about O, then there are two words MOD and OAT which again have different number of vowels. If you are told about D, there are two words again MOD and DUE which have different numbers of vowels again.

In such manner, all the words that have M, O or D in them can be excluded. Then only word that remains is TIE.
If you are told about T, there are two words OAT and TIE which both have two vowels.
If you are told about I, there are two words AIM and TIE which both have two vowels.
If you are told about E, there are two words DUE and TIE which both have two vowels.

Thus TIE is the code word.

Solution:

7 Races.