Solution:

5832/17496
This fraction will give the desired result i.e. 1/3.

Solution:

The answer is 2. First, divide the coins into 3 equal piles. Place a pile on each side of the scale, leaving the remaining pile of 3 coins off the scale. If the scale does not tip, you know that the 6 coins on the scale are legitimate, and the counterfeit is in the pile in front of you. If the scale does tip, you know the counterfeit is in the pile on the side of the scale that raised up. Either way, put the 6 legitimate coins aside. Having only 3 coins left, put a coin on each side of the scale, leaving the third in front of you. The same process of elimination will find the counterfeit coin.

Solution:

Tuesday

We know that Christanio Ronaldo tells the truth on only a single day of the week. If the statement on day 1 is untrue, this means that he tells the truth on Monday or Tuesday. If the statement on day 3 is untrue, this means that he tells the truth on Wednesday or Friday. Since Christanio Ronaldo tells the truth on only one day, these statements cannot both be untrue. So, exactly one of these statements must be true, and the statement on day 2 must be untrue.
Assume that the statement on day 1 is true. Then the statement on day 3 must be untrue, from which follows that Christanio Ronaldo tells the truth on Wednesday or Friday. So, day 1 is a Wednesday or a Friday. Therefore, day 2 is a Thursday or a Saturday. However, this would imply that the statement on day 2 is true, which is impossible. From this we can conclude that the statement on day 1 must be untrue.

This means that Christanio Ronaldo told the truth on day 3 and that this day is a Monday or a Tuesday. So day 2 is a Sunday or a Monday. Because the statement on day 2 must be untrue, we can conclude that day 2 is a Monday.

So day 3 is a Tuesday. Therefore, the day on which Christanio Ronaldo tells the truth is Tuesday.

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:

There are six unique answers

Ans1:
7 x 4 = 28
36 / 4 = 9
1 + 4 = 5

Ans2:
9 x 4 = 36
28 / 4 = 7
1 + 4 = 5

Ans3:
3 x 8 = 24
56 / 8 = 7
1 + 8 = 9

Ans4:
7 x 8 = 56
24 / 8 = 3
1 + 8 = 9

Ans5:
4 x 8 = 32
56 / 8 = 7
1 + 8 = 9

Ans6:
7 x 8 = 56
32 / 8 = 4
1 + 8 = 9

Solution:

The equation can be solved by substituting
B = 7
A = 8
S = 8
E = 3
L = 5

Therefore the equation now looks as:
7483 +
7455
-------
14938
-------

Solution:

It can surely be true because it is not mentioned that it was raining.

Solution:

1 2 3 4 5 6 and 7 8 6

Since summation of numbers 1-9(1 2 3 4 5 6 7 8 9) is 45 , so its impossible to divide into two equal parts.
Since we cant flip over 6 to make it 9 but we can flip 9 to make it 6 and hence the solution

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:

The Bangladeshi seaman is the thief. This is because the Japanese flag cannot be identified as upside down as it is the same both ways. Thus he is just trying to escape the situation.

Solution:

Step one: First you will have to make 3 trips of 1,000 apples 333 miles. Then you will be left with 2,001 apples and 667 miles to go.

Step two: Next you will have to take 2 trips of 1,000 apples 500 miles. In this manner you will be left with 1,000 apples and 167 miles to go (you have to leave an apple behind).

Step three: At last, you will have to travel the last 167 miles with one load of 1,000 apples and you will be left with 833 apples when you reach the town