Solution:

927

Explanation
1) 5 4 7 : 7 is placed correctly
2) 5 3 0 : None of the numbers is in the code
3) 2 5 9 : 2 & 9 are correct number of code but placed at wrong position
4) 7 0 6: Number 7 is there but placed at wrong position
5) 6 4 9: Number 9 is there but placed at wrong position

Solution:

mother

We know from (3) that the youngest person was not the victim, from (4) that the youngest person was not the helper and from (6) that the youngest person was not the killer. The youngest person can only have been the witness therefore. If we make up a chart there are now three possible combinations:

Oldest person (father) H H M

Next to oldest (mother) V M H

Next to youngest (son) M V V

Youngest (daughter) W W W

(H = Helper ; V = Victim ; M = Murderer ; W = Witness)

We can work out from (5) that the father was the oldest, from (2) that the youngest person must have been the daughter. Therefore the next to the youngest must have been the son and the next to the oldest, the mother.

Solution:

73

Explanation:
It's a very famous puzzle known as "Josephus Problem Puzzle". It can be solved in various ways but the trick to solve this problem is illustrated below.

Binay number of 100 is: 1100100
complement pf 100 is 0011011, whose decimal equivalent is 27.
The desired answer will be 100 - 27 = 73

Solution:

13 numbers

Explanation:
Since we are looking to find odd reminder which implies that the remainder will be either 1 or 3
Therefore number must follow below two conditions:
A) We can list number 5n + 1 or 5n + 3. (where n = 0,1,2,3.....)
B) The number must end in 1 or 3.

List of such numbers less than 100 are:
1, 3, 11, 13, 21, 23, 31, 33, 41, 43, 51, 53, 61, 63, 71, 73, 81, 83, 91, 93

Let's remove the nonprime ones which are 1, 21, 33, 51, 63, 81 and 91

So, I will be left with 13 numbers which fit the bill.
3, 11, 13, 23, 31, 41, 43, 53, 61, 71, 73, 83 and 93

Solution:

One of the cop will move clockwise while the other will move anti-clockwise every day. In such a manner, they will catch the thief in minimum seven days.

Solution:

17 min

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 minutes. 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 minutes

Solution:

Since Jasmine and Thibault ate equal amount, they should pay the same amount. But since that's not possible, they can decide with 'rock, paper, scissor' or an equivalent measure to determine who will pay the extra dollar. Now, let's assume tha Jasmine pays $1 extra after losing

Jasmine will pay $5, Thibault will pay $4 and Noah will pay $2.

If the pizza's cost was $11, we can simply keep the same offset and divide. Jasmine is paying 6% more, Thibault is paying 15% more and Noah is paying 27% more.
Keeping the offset same both Jasmine and Thibault will pay $5 each and Noah will pay $1.

Solution:

Pages 19, 20, 23, 37, 38, & 42 will also be missing

Solution:

Hhe hung herself using big Ice slabs , which are now now melted and hence puddle of water.

Solution:

At each draw, the number of strawberry candies are either decreasing by 2 or not decreasing at all. In the case of orange candies, at each draw, they are either increasing by 1 or decreasing by 1.

Thus on an assumed outset with at least one candy in the jar to begin with, if the number of strawberry candies are 0 or are even in numbers, they will finish off leaving an orange candy at the end. If otherwise, the remaining candy will be a strawberry one.

Solution:

You better switch!

Your first choice has a 1/3 chance of having the car, and that does not change.<br>The other two doors HAD a combined chance of 2/3, but now a Goat has ben revealed behind one, all the 2/3 chance is with the other door.