Solution:

Princes (male and plural) add an 's' Princess (female and singular)

Solution:

100

Series of number that do not contain albhabet 'T'

Solution:

In the corners of the square, tighten two ropes. Tighten another rope between them by putting rings on each rope. That rope should be tightened on the sheep's neck on the other end.

Solution:

On Your lap.

Solution:

2, 3, 10 and 10
To maintain the difference of eight and keeping in mind the third and fourth hint, the first and third cards can be 2 and 10 or 10 and 2. But keeping in mind the first hint, we know that the first card is 2 and the third is 10. Similarly, if we see the fifth hint, the difference between the second and fourth card should be 7. Thus we know that the second card is 3 and the fourth card is 10.

Solution:

White should move the rook from
A1 to D1 and hence complete the castling move.

Solution:

Numbers of the first cube:
1, 2, 4, 0, 5 and 6.

Numbers on the second cube:
3, 1, 2, 7, 8 and 0.

Now you can pick any date and you will be able to show it using these cubes. Remember that you can always use 6 as 9 by inverting it.

This problem has another solution and we leave it for you to deduce.

Solution:

Batsman hit six and gone retired hurt while the new batsman come to play and get runout for his wicket and the other batsman hit six and made both century and team win..

Solution:

XIX is the answer which refers to nineteen in roman numeric system. On taking out one i.e. I, we will get XX that is equal to twenty.

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:

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