In a computer simulation, each player uses an identical pail to pour water repeatedly into his assigned tank, which is initially empty. Two players, Chris and Elliot, participate in this simulation and pour water into their assigned tanks as follows.
- Chris pours 5 litres of water into the tank using the pail for the first time. Subsequently, he pours 0.3 litres less than the preceding volume of water poured.
- Elliot pours 5 litres of water into the tank using the pail for the first time. Subsequently, he pours 85% of the preceding volume of water poured.
The simulation stops when the amount of water that can be poured from the pail by either player is no longer positive.
- (i)
Determine the number of times Chris can pour water into his tank before the simulation stops. Hence find the volume of water in the tank at this instant.
- (ii)
The simulation also stops when any player reaches or exceeds the total target volume of water in their respective tanks. The total target volume of water in each tank is given to be 33.5 litres.
Elliot comments that the target is unfair because he will not reach it. Explain if Elliot's comment is justified.
- (iii)
The total target volume of water in each tank is now changed to 30 litres.
Chris and Elliot start the simulation at the same time. The simulation is designed such that all players pour water into their assigned tanks at the same time each time.
Determine which player reaches or exceeds the total target volume of water in the tank first, showing your workings clearly.
- (iv)
Suppose that Gary is a new player. He pours 5 litres into his assigned tank using the pail the first time. Subsequently, he pours of the preceding volume of water poured. Find the smallest value of such that Gary reaches or exceeds the total target volume of water of 30 litres in the tank after pouring for 7 times. Leave your answer to the nearest integer.
It won't just hand you the answer — it asks where you're stuck.How the checker works
Worked solution
9(i)
1. Set up an inequality to find the number of times Chris can pour a positive volume of water.
Let be the volume poured by Chris on the -th time. The volumes form an arithmetic progression with first term and common difference .
For the volume poured to be positive, we need .
2. Solve the inequality to find the maximum integer value of $n$.
Since must be an integer, the maximum number of times Chris can pour water is .
3. Calculate the total volume of water in the tank after 17 pours using the sum of an arithmetic progression formula.
Let be the total volume after pours.
The volume of water in the tank is .
Chris can pour water times.
Volume of water = litres.
9(ii)
1. Calculate the maximum possible total volume of water Elliot can pour using the sum to infinity of a geometric series.
For Elliot, the volumes of water poured form a geometric progression with first term and common ratio .
The maximum volume of water he can pour is the sum to infinity of this series:
2. Compare the maximum volume with the target volume to evaluate Elliot's comment.
Since the maximum possible volume he can pour ( litres) is strictly less than the target volume of litres, Elliot will never reach the target.
Therefore, Elliot's comment is justified.
Yes, Elliot's comment is justified since his maximum possible volume is litres, which is less than 33.5 litres.
9(iii)
1. Formulate an inequality for the volume of water Chris has poured after $n$ times.
Let be the number of times Chris pours water. The volumes poured form an arithmetic progression with first term and common difference .
We require the sum of terms, , to be at least 30:
2. Solve the inequality to find the minimum number of times Chris needs to pour.
Solving using the quadratic formula:
The inequality holds for . Since must be an integer, the minimum number of pours Chris needs is .
3. Formulate an inequality for the volume of water Elliot has poured after $k$ times.
Let be the number of times Elliot pours water. The volumes poured form a geometric progression with first term and common ratio .
We require the sum of terms, , to be at least 30:
4. Solve the inequality to find the minimum number of times Elliot needs to pour.
Taking the natural logarithm on both sides:
Since is negative, the inequality sign flips:
Since must be an integer, the minimum number of pours Elliot needs is .
5. Compare the number of pours to determine who reaches the target first.
Chris requires 8 pours, while Elliot requires 15 pours. Because both players pour at the same time each time, Chris will reach or exceed the target volume first.
Chris reaches the total target volume first.
9(iv)
1. Set up the inequality for the total volume of water poured after 7 times.
Let . The volume of water poured each time forms a geometric sequence with the first term and common ratio .
The total volume after 7 pours is the sum of the first 7 terms:
We require the total volume to reach or exceed 30 litres:
2. Solve the inequality using a graphing calculator to find the smallest integer value of $r$.
Using a graphing calculator to solve the corresponding equation :
From the GC, we find (rejecting as ).
Since is an increasing function of , we have:
Rounding to the nearest integer, the smallest value of is .
AI analysis — may contain mistakes.
Worked this one out on paper? Snap your steps and Gigle's AI math checker will circle the step where it went wrong.
More questions on this topic
- 1The sum of the first terms of a series is given by . Show that this series follows an arithmetic pr…
- 2The sum of the first terms of a series is given by . Show that this series follows an arithmetic pr…
- 3The sum of the first 100 terms of an arithmetic progression is 10,000. The first, second and fifth terms of this progres…
- 4已知是公差为的等差数列,为的前项和,若,则…
- 5等差数列和的前项和分别为和,且,则…