A Check Post At Each Mile

A poor villager grows mango in his land and sells them in the town. The town is 1000 miles away from the village. He has rented a truck for transporting the mangoes to the town. The truck can carry 1000 mangoes at one time and this season, he was able to yield 3000 mangoes.

There is a problem. At each mile till the town, there is a check post at which he must give one mango each while traveling towards the town. However, if he is traveling from the town towards his village, he won’t have to give anything.

Transportation Truck

Tell a way in which the villager can take highest possible number of mangoes to the town.

Know here that highest possible number!

Source 

Smart Saving At Check Posts

How much each check post charging?

Obviously, he can't make 3 trips from town to village straightaway as in that case he wouldn't have anything left (3 x 1000 mangoes paid).

So he need to divide the journey into parts. While breaking journey into parts he has to make sure that after each part he will need less trips to complete the next part.

Now if somehow he pays 1000 mangoes in first part of the journey then for next part he has to make only 2 trips to carry 2000 mangoes.

Part 1 : Hence, he should first make 3 trips till 333 miles. In this part, he would pay 3 x 333 = 999 mangoes leaving 3000 - 999 = 2001 mangoes in stock.

Part : 1

Part 2 : He should leave 1 mango here & take 2000 mangoes further. For next part, he need to make at least 2 trips for 2000 mangoes. In order to save number of trips in next part some how he need to make mangoes in stock less than 1000. For that he should make 2 trips 500 mile further. So he will pay 2 x 500 = 1000 mangoes but having 2000 - 1000 = 1000 mangoes in stock. Still he has to travel 1000 - 500 - 337 = 167 miles.

Part : 2

Part 3 : For next 167 miles, he need to make only 1 trip of 1000 mangoes where he will pay 167 mangoes leaving 1000 - 167 = 833 mangoes. 

Part : 3

This is how he can save 833 mangoes in entire journey. 

Wrong Looking Correct Mathematical Equation!

The following question it puts forth you:

25 - 55 + (85 + 65) = ?

Then, you are told that even though you might think its wrong, the correct answer is actually 5!

Whats your reaction to it? How can this be true? 

 That's how it's perfectly correct!

That's How Equation is Correct!

Why it was looking wrong? 

If you read the data carefully then you will notice '!' attached to number 5 which is being claimed answer. Actually claimed answer is 5! not 5 Read it again...

"Then, you are told that even though you might think its wrong, the correct answer is actually 5!."

Now use of '!' is not limited to the sentences only. In mathematics it's a 'factorial'.

So 5! = 5 x 4 x 3 x 2 x 1 = 120 and 25 - 55 + (85 + 65) = 120 and hence,

25 - 55 + (85 + 65) = 5! 

Now doesn't it look the correct equation? 

How Accurate You are?

In a competitive exam, each correct answer could win you 10 points and each wrong answer could lose you 5 points. You sat in the exam and answered all the 20 questions, which were given in the exam.

When you checked the result, you had scored 125 marks in the test.
Can you calculate how many answers given by you were correct and wrong ?

These should be those numbers! 

Source 

  

Analysis Of Your Result

What was the test ?

Let C be the number of correct answers and W be the number of wrong answers.

Since there are 20 question in total,

C + W = 20    .....(1)

and the score 125 must be subtraction of marks obtained for correct answer and marks due to wrong answers.

10C - 5W = 125   .....(2)

Multiplying (1) by 5 and then adding it to (2),

5C + 5W + 10C - 5W = 100 + 125

15C = 225

C = 15.

From (1), W = 20 - C = 20 - 5 = 5.

Hence, your 15 answers are correct while 5 answers are wrong.

Who Will Be Not Out?

It is a strange cricket match in which batsman is getting bowled in the very first ball he faced. That means on ten consecutive balls ten players get out.

Assuming no extras in the match, which batsman will be not out at the end of the innings?  

Know that lucky player!

Source