Deductive Reasoning Puzzles With Answers

First of all, he will have to make three trips of 1000 mangoes till 333 miles. After that, he will be left with 2001 mangoes and 667 more miles to go.

Then he must take two trips of 1000 mangoes covering 500 miles more. Doing this, he will be left with 1000 mangoes and 167 remaining miles to reach the town. (He will have to leave a mango behind)

Lastly, he will have to travel the rest of 167 miles with the remaining 1000 mangoes and by the time he reaches town, he will be left with 833 mangoes.

The date is 12 December 2013. For any other date, the checkers would have been able to identify the papers. Why? Because the British people write dates in Day/Month/Year Format and the American people write date in Month/Day/Year format. On 12 December, the date and month will be the same and thus there is no way to distinguish when the names are same as well.

43

If you analyze, then you will find that all the 6 numbers divisible by 3 can be ordered. Why? Because you can break them own as the sum of 6 and 9.
Now after 26, all the numbers that are divisible by 3 if subtracted by 40 can be obtained.
After 46, all the numbers will fit into one of the above categories and thus all such numbers can be obtained. But 43 will be last number that will not fall into one of the above categories.
44 = 20 + 6 * 4, 45 = 6 * 6 + 9

First Step: Invert both the hourglasses.

Second step: When the 11 min hourglass is finished, invert it.

Third Step: When the 13 min hourglass is finished, flip the 11 min hourglass would have lost only 2 minutes till now. On inverting, we get to measure those two minutes.
Now 13 + 2 = 15 minutes.

In this way, fifteen minutes can be measured in just 3 steps.

Product is 52 and sum is 17. The numbers are 4 and 13.

If you put a single precious black stone in one bag and all the others in the other bag, it will give you almost three/fourth of the probability of picking up a precious black stone.

Zero

He catches 10 fishes without an I or 1 according to Roman numeral. Taking off 1 from 10 makes it 0. Cutting the tail of 9 makes it zero. Removing the head of 6 makes it zero. Slicing 8 in half makes it zero as well. Thus in total, he caught zero fishes.

The code word is TIE.

Suppose if you are told a character of MOD, then you can’t identify if the number of vowels are one or two. Suppose that the character you are told of is M, then you can associate two words with it i.e. AIM (that has two vowels) and MOD (that has 1 vowel). You can say the same regarding other characters O and D as well.

Thus all those words that comprises of M, O or D in them can be ruled out. This points us to TIE. If you check with the characters of TIE, you will agree that it stands true for each of the characters of the word. Thus this is the code word.

Let us assume that there were x flowers present in the basket of the pilgrim and he offered y flowers at each temple. Now as per the details given in the question, the number of flowers when he came out of the third temple.

But the number of flowers when he comes out of the third temple must be (8x – 7y)

Thus (8x – 7y) = 0
8x = 7y

Now the minimum values that you can put by hit and trial are 7 and 8 for x and y respectively.

Thus, the pilgrim had 7 flowers in the beginning and he offered 8 flowers at each temple.

The correct answers are b, a, True, False and False. Also, the scores are Justin (0), Adam (1), Cabe (2), Vince (3) and Michael (4).

Since no two students were able to answer the exact number of correct answers, there can be only two possibilities
1) 1 + 2 +3 + 4 + 5 = 15
2) 0 + 1 + 2 + 3 + 4 = 10

Now let us determine the maximum number of correct answers possible through the answers they gave.
For Question I = 2 (b or c)
For Question II = 2 (b or c)
For Question III = 4 (True)
For Question IV = 4 (True)
For Question V = 3 (True)

Now we know that the maximum number of correct answers possible are 15 (2+2+4+4+3) according to which, Adam would have given all correct answers as only he answered True for questions III, IV and V. But then Cabe and Justin would have given exactly 3 correct answers. And also, Michael and Vince would have given 2 correct answers. Therefore none of them got all the five correct answers. Thus this assumption is wrong.

The total number of correct answers therefore are 10 (0+1+2+3+4). Both Questions III and IV cannot be False as in that case, the number of correct answers would not be 10. So the student who got all wrong answers cannot be Cabe, Adam and Michael.

Suppose if Vince got all wrong, then Cabe, Justin and Michael each would have at least 2 correct answers. Thus, Adam would have to be the student with only one correct answer and in that case, the correct answers for questions I and II would be a and a respectively. But that is not possible as then the total number of correct answers would be 1 (a) + 1 (a) + 1 (False) + 4 (True) + 2 (Flase) = 9.

Thus it is Justin who has given all wrong answers. The correct answers are b, a, True, False and False. Also, the scores are Justin (0), Adam (1), Cabe (2), Vince (3) and Michael (4).