Solution:

Costa

Explanation:
c + 1 characters-> d
o + 2 characters-> q
s + 3 characters-> v
t + 4 characters-> x
a + 5 characters-> f

=> dqvxf = costa

Solution:

Costa

Explanation:
c + 1 characters-> d
o + 2 characters-> q
s + 3 characters-> v
t + 4 characters-> x
a + 5 characters-> f

=> dqvxf = costa

Solution:

Can be found on the pic below.

Solution:

100

Series of number that do not contain albhabet 'T'

Solution:

Zouma is 3 and has two footballs.
Ake is 1 and has one football.
Kalas is 4 and has three footballs.
Aina is 2 and has four footballs.

Solution:

Old password : altered

New Password : distinct

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:

A Question

Solution:

The competition was held on 11 November 2013. The logic is simple. In America, the dates are mentioned as Month/Day/Year and in Britain, dates are written as Day/Month/Year. But on 11 November 2013, the date and month will be the same. And thus both will write in the same manner i.e. 11/11/2013. If it would have been any other date, the evaluators would have been able to identify it.

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:

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.