Apple Transporting

Algebra Level 3

You have been given the task of transporting 3,000 apples for 1000 miles from City A to City B. Your truck can carry 1000 apples at a time. Every time you travel a mile towards City B you must pay a tax of 1 apple but you pay nothing when going towards City A. What is highest number of apples you can get to City B?

500 833 586 367

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

2 solutions

Rahul Suresh
Mar 1, 2014

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

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

Step three: Finally, you travel the last 167 miles with one load of 1,000 apples and are left with 833 apples in CITY B.

Tunk-Fey Ariawan
Mar 1, 2014

In order to get maximum number apples when arriving at City B B , the truck must load maximum number of apples towards to City B B . In this case, the truck must load 1000 1000 apples. Due to tax, the truck driver should be clever so the steps he should do are:

  1. Loading the truck with 1000 1000 apples, going to cover x x km towards B B (let's say this spot as point P P ), putting down ( 1000 x ) (1000-x) apples at point P P , and going back to A A to load the other 1000 1000 apples.
  2. Next, he carries the truck with 1000 1000 apples and goes to point P P . When arriving at point P P , the number of apples will be ( 1000 x ) (1000-x) apples. He then takes x x apples at point P P . Now, the number of apples at point P P is ( 1000 2 x ) (1000-2x) apples. He continues traveling with carrying 1000 1000 apples and covers y y km (let's say this spot as point Q Q ). After covering y y km, the number of apples will be ( 1000 y ) (1000-y) apples. He then puts down ( 1000 y ) (1000-y) apples at point Q Q , and goes back to A A to load another 1000 1000 apples.
  3. The last step, he carries the truck with 1000 1000 apples and goes to point P P . When arriving at point P P , the number of apples will be ( 1000 x ) (1000-x) apples. He then takes another x x apples. Now, the number of apples at point P P is ( 1000 3 x ) (1000-3x) apples. He continues traveling with carrying 1000 1000 apples and goes to point Q Q . When arriving at point Q Q , the number of apples will be ( 1000 y ) (1000-y) apples. He then takes all the apples at point Q Q . Now, the number of apples that is carried by the truck is ( 2000 2 y ) (2000-2y) apples. For the final travel, the truck will cover ( 1000 y x ) (1000-y-x) km to reach City B.

The number of apples that is left at point P P should be minimum. We set 1000 3 x = 0 1000-3x=0 . Therefore x = 1000 3 = 333. x=\left\lfloor \frac{1000}{3} \right\rfloor = 333. The number of apples that is carried by the truck at point Q Q should be maximum. We set 2000 2 y = 1000 2000-2y=1000 . Therefore y = 200 1000 2 = 500. y=\left\lfloor \frac{200-1000}{2} \right\rfloor= 500. Thus, the maximum number of apples that is left when arriving at B B is 2000 2 y ( 1000 y x ) = 1000 y + x = 1000 500 + 333 = 833 2000-2y-(1000-y-x)=1000-y+x=1000-500+333=\boxed{833} Anyway, during the process, the truck driver will leave an apple at point P P . If I were the truck driver, I would eat that apple instead of leaving it offhand. LOL. # Q . E . D . # \text{\# }\mathbb{Q.E.D.}\text{ \#}

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...