Solution:

The node can be connected as shown.

Solution:

4 6 5 3 (from magician perspective)
3 5 6 4 (viewer perspective)

Detail:

From user perspective:
3 5 6 4 => 5 6 4 3 => 6 5 4 3

For magician perspective
3 4 5 6 (ascending order as)

Solution:

Selfie
Explanation:
: Selfie = is six letter word
: Self = The first four letter is me.
: e = The second and last letter are the same.
: fee = The fourth second and last letter are payment.

Solution:

Since every bacterium divides into two in two minutes and we know the fact that the dish was half filled with bacteria at 3 pm, after exactly 2 minutes, all will divide into two and will fill the petri dish. Thus, the petri dish will become full at 3:02 pm.

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:

Put one black rock in one sack and put all the rest in the other one. In such manner you will get about 3/4 probability of surviving.

Solution:

1. Fill 5 liters jar ( 5l-jar:5, 3l-jar:0)
2. Transfer to 3 liters pail (5l-jar:2, 3l-jar:3)
3. Empty 3 liters jar ( 5l-jar:2, 3l-jar:0)
4. Transfer 2q from 5 pail to 3 pail (5l-jar:0, 3l-jar:2)
5. Fill 5 liters pail(5l-jar:5, 3l-jar:2)
6. Transfer 1q from 5 pail to 3 pail(5l-jar:4, 3l-jar:3)

Solution:

3 1 2 2 1 1
1 3 1 1 2 2 2 1

Read Line as one 1 => 1
Read Line 2 as two one => 2 1
Read Line 3 as one two and one one => 1 2 1 1
and so on.

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:

To do it, the marbles must be arranged as the vertices of an octahedron. If you are unsure, check the image below.

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.