Solution:

This one definitely sounds too unusual. But there is an easy way to look at things.

Let us say that there is one unfaithful husband in the town. In such a case, 99 women will know about him. The wife of that man will be the only one who will not know about him and would have always thought that his husband is truly faithful to her. But since the mayor announced that there is at least one cheater among them, she will come to a realization that her husband must be cheating on her. So her husband will be executed on the first day of the announcement.

Now let us take up a case that there are two cheating husbands in the town. Now 98 women of the town must be knowing about them both. The two wives of those men will think that there is only one cheater in the town. Both of them believes that their respective husbands are loyal and this would not report about them

But when both of them will find out on the next day that no one was executed, they will realize that it could only mean that both of their husbands are cheaters. Thus both the husbands will be executed on the second day.

Thus if we have X number of cheating husbands, they all will die on the Xth day after the announcement is being made.

Solution:

Both will rotate at Same speed.

Explanation:
Gears of the same size will always rotate at constant speeds despite any smaller or larger gears in between them.

Solution:

Step 5 is invalid, because we are dividing by (x-y), and since x=y, we are thus dividing by 0. This is an invalid mathematical operation (division by 0), and so by not following basic mathematical rules

Solution:

0%

Explanation:
1) why cant be 1/4 : If the answer is 1/4, then as we know two out of four answer choices is '1/4', the answer has be 1/2.
This is a contradiction, so the answer cannot be 1/4.

2) why cant be 1/2 : If the answer is 1/2 then because answer:"1/2" is 1 out of 4 answer choices, the answer must be 1/4. This is also a contradiction. So the answer cannot be 1/2.

3) why cant be 1 : If the answer is 1 then because answer:"1" is 1 out of 4 answer choices, the answer must be 1/4. Again the same contradiction and therefore answer cannot be 1.

Solution:

17 mins

The initial solution most people will think of is to use the fastest person as an usher to guide everyone across. How long would that take? 10 + 1 + 7 + 1 + 2 = 21 mins. Is that it? No. That would make this question too simple even as a warm up question.

Let’s brainstorm a little further. To reduce the amount of time, we should find a way for 10 and 7 to go together. If they cross together, then we need one of them to come back to get the others. That would not be ideal. How do we get around that? Maybe we can have 1 waiting on the other side to bring the torch back. Ahaa, we are getting closer. The fastest way to get 1 across and be back is to use 2 to usher 1 across. So let’s put all this together.

1 and 2 go cross
2 comes back
7 and 10 go across
1 comes back
1 and 2 go across (done)

Total time = 2 + 2 + 10 + 1 + 2 = 17 mins

Solution:

Since the knife was in her hand which implies that she was planning to kill her husband "Inspector Montalbano".

Solution:

Playing chess

Game needs two players so Brother-8 is playing chess with Brother-2

Solution:

The 100th statement for sure is incorrect because it says that at least 100 of the statements are incorrect.

Suppose if that is correct, then 100 statements cannot be true.
This suggests that the 100th statement is incorrect and that the first statement is true.

Similarly 99 statements cannot be true because if they were true, then two statements would become correct i.e. the 1st and the 99th.
But the 99th statement says that at least 99 are incorrect.
This suggests that the 99th statement is incorrect and that 2ndone is true.

If we keep analyzing is the same way till the end, we will find out that only the first fifty statements are true and all the remaining ones are incorrect.

Solution:

There are two things to keep in mind:
Firstly there is at least one red hat. (There can be two or three as well).
Secondly the competition is fair for everyone.

Thus if there is only one red hat, that person will see two green hats on other heads and will be able to deduce his own color as red. However the other students will see one red and one green hat and can never be sure. In such manner, the competition will prove to be partial for one student.

Suppose if there are two red hats. Then the students who are wearing red hats will see one red and one green hat on others. Now they must have deduced that there can’t be just one red hat. Thus they will know that they are also wearing a red hat. But the one who is wearing a green hat will see two red hats and can never be sure of his own color. In this case as well, the competition will not be fair.

Thus the only possible and fair means is if all of them are wearing a red hat. The one who is able to deduce the situation first, will raise his hand and will tell the correct answer.

Solution:

Let us assume that all of them are standing on the X shore and they have to travel to the Y shore.

X = mother, first daughter, second daughter, father, first son, second son, maid and dog
Y = None

Maid and dog go first and maid returns back
X = mother, first daughter, second daughter, father, first son, second son and maid
Y = dog

Maid and first son go and maid returns with dog
X = mother, first daughter, second daughter, father, second son, maid and dog
Y = first son

Father and second son go and father returns back
X = mother, first daughter, second daughter, father, maid and dog
Y = first son and second son

Mother and father go and mother comes back
X = mother, first daughter, second daughter, maid and dog
Y = father, first son and second son

Maid and Dog go and Father returns back
X = mother, first daughter, second daughter and father
Y = first son, second son, maid and dog

Father and Mother go and mother comes back
X = mother, first daughter and second daughter
Y = father, first son, second son, maid and dog

Mother and first daughter go and maid comes back with dog
X = second daughter, maid and dog
Y = mother, first daughter, father, first son and second son

Maid and second daughter go and maid comes back
X = Maid and dog
Y = mother, first daughter, second daughter, father, first son and second son

Maid and dog go
X= none
Y = mother, first daughter, second daughter, father, first son, second son, maid and dog

Thus everyone has reached the other end.

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.