Solution:

98

2+3=2*[3+(2-1)]=8
3+7=3*[7+(3-1)]=27
4+5=4*[5+(4-1)]=32
5+8=5*[8+(5-1)]=60
6+7=6*[7+(6-1)]=72
therefore
7+8=7*[8+(7-1)]=98
x+y=x[y+(x-1)]=x^2+xy-x

Solution:

3,3,8

Lets break it down. The product of their ages is 72. So what are the possible choices?

2, 2, 18 sum(2, 2, 18) = 22
2, 4, 9 sum(2, 4, 9) = 15
2, 6, 6 sum(2, 6, 6) = 14
2, 3, 12 sum(2, 3, 12) = 17
3, 4, 6 sum(3, 4, 6) = 13
3, 3, 8 sum(3, 3, 8 ) = 14
1, 8, 9 sum(1,8,9) = 18
1, 3, 24 sum(1, 3, 24) = 28
1, 4, 18 sum(1, 4, 18) = 23
1, 2, 36 sum(1, 2, 36) = 39
1, 6, 12 sum(1, 6, 12) = 19

The sum of their ages is the same as your birth date. That could be anything from 1 to 31 but the fact that Torres was unable to find out the ages, it means there are two or more combinations with the same sum. From the choices above, only two of them are possible now.

2, 6, 6 sum(2, 6, 6) = 14
3, 3, 8 sum(3, 3, 8 ) = 14

Since the eldest kid is taking piano lessons, we can eliminate combination 1 since there are two eldest ones. The answer is 3, 3 and 8.

Solution:

Assassination
(Ass ass i nation)

Solution:

answer is: 14

Let x be the answer we want, the number of drops required.

So if the first egg breaks maximum we can have x-1 drops and so we must always put the first egg from height x. So we have determined that for a given x we must drop the first ball from x height. And now if the first drop of the first egg doesn’t breaks we can have x-2 drops for the second egg if the first egg breaks in the second drop.

Taking an example, lets say 16 is my answer. That I need 16 drops to find out the answer. Lets see whether we can find out the height in 16 drops. First we drop from height 16,and if it breaks we try all floors from 1 to 15.If the egg don’t break then we have left 15 drops, so we will drop it from 16+15+1 =32nd floor. The reason being if it breaks at 32nd floor we can try all the floors from 17 to 31 in 14 drops (total of 16 drops). Now if it did not break then we have left 13 drops. and we can figure out whether we can find out whether we can figure out the floor in 16 drops.

Lets take the case with 16 as the answer

1 + 15 16 if breaks at 16 checks from 1 to 15 in 15 drops
1 + 14 31 if breaks at 31 checks from 17 to 30 in 14 drops
1 + 13 45 .....
1 + 12 58
1 + 11 70
1 + 10 81
1 + 9 91
1 + 8 100 We can easily do in the end as we have enough drops to accomplish the task


Now finding out the optimal one we can see that we could have done it in either 15 or 14 drops only but how can we find the optimal one. From the above table we can see that the optimal one will be needing 0 linear trials in the last step.

So we could write it as

(1+p) + (1+(p-1))+ (1+(p-2)) + .........+ (1+0) >= 100.

Let 1+p=q which is the answer we are looking for

q (q+1)/2 >=100

Solving for 100 you get q=14.
So the answer is: 14
Drop first orb from floors 14, 27, 39, 50, 60, 69, 77, 84, 90, 95, 99, 100... (i.e. move up 14 then 13, then 12 floors, etc) until it breaks (or doesn't at 100)

Solution:

Suicide

Solution:

We colored the squares in the center. They are a total of 6. If you count the ones outside it, you will find 12 squares.

6 + 12 = 18.

Therefore, there are a total of 18 squares.

Solution:

The best way to increase the probability of winning is to place one yellow ball in the first bowl and all the other balls in the second bowl.

Now, you have a 1/2 probability of choosing the bowl with just one yellow ball. If you choose that, you win.

If you choose the other bowl, it has 49 yellow balls and 50 white balls. You still have almost 1/2 probability of picking a yellow ball out of it and winning.

Solution:

Both S and T are of same height because they are the same people.

Suppose that each person is marked with their respective number which also denotes their height.
Now when the longest from each row is called out, they will be 50, 100, 150 ... 500. Shortest among them will be 50 aka S.
When the shortest from each colum is called out, they will be 1, 2, 3, ....50. Longest among them will be 50 aka T.

Thus, they both are same person.

Solution:

The required word is BANANA.

Solution:

The man asked the king that he wanted to die of old age.