Eight men can complete a work in 13 days. Eight men started the work and next day four men join them. In this way, if every day four men join them, on which day would the work be completed?
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.
The work takes 8 × 13 = 104 man-days (which means, that e.g. it would take 104 days for 1 man to finish it or would require 104 men to complete the work in one day.)
Let the required number of days be k ∈ N !
Now, we can set up the following inequality:
8 + 12 + ... + (8 + 4 × (k - 1)) ≥ 104
After applying the formula regarding the sum of the arithmetic sequence:
k × 2 8 + ( 8 + 4 × ( k − 1 ) ) ≥ 1 0 4
k ( 8 + 2 ( k − 1 ) ) ≥ 1 0 4
2 k 2 + 6 k − 1 0 4 ≥ 0
k 2 + 3 k − 5 2 ≥ 0
After solving this quadratic inequality for k > 0, we get:
k ≥ 2 − 3 + 2 1 7
k ≥ 5 . 8 6 5 5
Therefore, our answer should be:
6th day
Problem Loading...
Note Loading...
Set Loading...
Since the work takes 8 men 13 days to complete, the work W = 8 × 1 3 = 1 0 4 man-days. The actual work done by the increasing number of men in n days is given by:
W n = n terms 8 n + 4 ( n − 1 ) + 4 ( n − 2 ) + . . . + 4 ( 3 ) + 4 ( 2 ) + 4 ( 1 ) = 8 n + 4 ( n − 1 ) n − 4 k = 1 ∑ n − 1 k = 4 n 2 + 4 n − 4 × 2 ( n − 1 ) n = 4 n 2 + 4 n − 2 n 2 + 2 n = 2 n 2 + 6 n
For the work to end on the n th day, W n ≥ W . That is 2 n 2 + 6 n ≥ 1 0 4 ⟹ n 2 + 3 n ≥ 5 2 . We note that n = 6 is the solution.