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.

  1. (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.

  2. (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.

  3. (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.

  4. (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 r%r\% of the preceding volume of water poured. Find the smallest value of rr 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.

Work through it with AI →

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 unu_n be the volume poured by Chris on the nn-th time. The volumes form an arithmetic progression with first term a=5a = 5 and common difference d=−0.3d = -0.3.
For the volume poured to be positive, we need un>0u_n > 0.
5+(n−1)(−0.3)>05 + (n-1)(-0.3) > 0

2. Solve the inequality to find the maximum integer value of $n$.

0.3(n−1)<50.3(n-1) < 5
n−1<50.3=1623n-1 < \frac{5}{0.3} = 16\frac{2}{3}
n<1723n < 17\frac{2}{3}
Since nn must be an integer, the maximum number of times Chris can pour water is 1717.

3. Calculate the total volume of water in the tank after 17 pours using the sum of an arithmetic progression formula.

Let S17S_{17} be the total volume after 1717 pours.
S17=172[2(5)+(17−1)(−0.3)]S_{17} = \frac{17}{2} [2(5) + (17-1)(-0.3)]
S17=8.5[10−16(0.3)]S_{17} = 8.5 [10 - 16(0.3)]
S17=8.5[10−4.8]S_{17} = 8.5 [10 - 4.8]
S17=8.5(5.2)=44.2S_{17} = 8.5 (5.2) = 44.2

The volume of water in the tank is 44.2 litres44.2 \text{ litres}.

Answer

Chris can pour water 1717 times.
Volume of water = 44.244.2 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 a=5a = 5 and common ratio r=0.85r = 0.85.
The maximum volume of water he can pour is the sum to infinity of this series:
S∞=a1−rS_\infty = \frac{a}{1 - r}
S∞=51−0.85S_\infty = \frac{5}{1 - 0.85}
S∞=50.15=3313 litresS_\infty = \frac{5}{0.15} = 33\frac{1}{3} \text{ litres}

2. Compare the maximum volume with the target volume to evaluate Elliot's comment.

Since the maximum possible volume he can pour (331333\frac{1}{3} litres) is strictly less than the target volume of 33.533.5 litres, Elliot will never reach the target.
Therefore, Elliot's comment is justified.

Answer

Yes, Elliot's comment is justified since his maximum possible volume is 331333\frac{1}{3} 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 nn be the number of times Chris pours water. The volumes poured form an arithmetic progression with first term a=5a = 5 and common difference d=−0.3d = -0.3.

We require the sum of nn terms, SnS_n, to be at least 30:
Sn=n2[2(5)+(n−1)(−0.3)]≥30S_n = \frac{n}{2}[2(5) + (n-1)(-0.3)] \ge 30
n2(10−0.3n+0.3)≥30\frac{n}{2}(10 - 0.3n + 0.3) \ge 30
10.3n−0.3n2≥6010.3n - 0.3n^2 \ge 60
0.3n2−10.3n+60≤00.3n^2 - 10.3n + 60 \le 0
3n2−103n+600≤03n^2 - 103n + 600 \le 0

2. Solve the inequality to find the minimum number of times Chris needs to pour.

Solving 3n2−103n+600=03n^2 - 103n + 600 = 0 using the quadratic formula:
n=103±(−103)2−4(3)(600)2(3)n = \frac{103 \pm \sqrt{(-103)^2 - 4(3)(600)}}{2(3)}
n≈7.435 or n≈26.898n \approx 7.435 \text{ or } n \approx 26.898

The inequality holds for 7.435≤n≤26.8987.435 \le n \le 26.898. Since nn must be an integer, the minimum number of pours Chris needs is n=8n = 8.

3. Formulate an inequality for the volume of water Elliot has poured after $k$ times.

Let kk be the number of times Elliot pours water. The volumes poured form a geometric progression with first term a=5a = 5 and common ratio r=0.85r = 0.85.

We require the sum of kk terms, SkS_k, to be at least 30:
Sk=5(1−0.85k)1−0.85≥30S_k = \frac{5(1 - 0.85^k)}{1 - 0.85} \ge 30
5(1−0.85k)0.15≥30\frac{5(1 - 0.85^k)}{0.15} \ge 30

4. Solve the inequality to find the minimum number of times Elliot needs to pour.

1−0.85k≥30×0.1551 - 0.85^k \ge 30 \times \frac{0.15}{5}
1−0.85k≥0.91 - 0.85^k \ge 0.9
0.85k≤0.10.85^k \le 0.1
Taking the natural logarithm on both sides:
kln⁡(0.85)≤ln⁡(0.1)k \ln(0.85) \le \ln(0.1)
Since ln⁡(0.85)\ln(0.85) is negative, the inequality sign flips:
k≥ln⁡(0.1)ln⁡(0.85)k \ge \frac{\ln(0.1)}{\ln(0.85)}
k≥14.168k \ge 14.168
Since kk must be an integer, the minimum number of pours Elliot needs is k=15k = 15.

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.

Answer

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 R=r100R = \frac{r}{100}. The volume of water poured each time forms a geometric sequence with the first term a=5a = 5 and common ratio RR.

The total volume after 7 pours is the sum of the first 7 terms:
S7=5(1−R7)1−RS_7 = \frac{5(1 - R^7)}{1 - R}

We require the total volume to reach or exceed 30 litres:
5(1−R7)1−R≥30\frac{5(1 - R^7)}{1 - R} \ge 30

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 5(1−R7)1−R=30\frac{5(1 - R^7)}{1 - R} = 30:
1−R7=6(1−R)1 - R^7 = 6(1 - R)
R7−6R+5=0R^7 - 6R + 5 = 0

From the GC, we find R≈0.9481R \approx 0.9481 (rejecting R=1R=1 as S7=35≠30S_7 = 35 \ne 30).
Since S7S_7 is an increasing function of RR, we have:
R≥0.9481R \ge 0.9481
r100≥0.9481  ⟹  r≥94.81\frac{r}{100} \ge 0.9481 \implies r \ge 94.81

Rounding to the nearest integer, the smallest value of rr is 9595.

Answer

9595

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

  1. 1The sum of the first nn terms of a series is given by Sn=3n(n+2)S_n = 3n(n + 2). Show that this series follows an arithmetic pr…
  2. 2The sum of the first nn terms of a series is given by Sn=3n(n+2)S_n = 3n(n + 2). Show that this series follows an arithmetic pr…
  3. 3The sum of the first 100 terms of an arithmetic progression is 10,000. The first, second and fifth terms of this progres…
  4. 4已知{an}\left\{{a}_{n}\right\}是公差为22的等差数列,Sn{S}_{n}为{an}\left\{{a}_{n}\right\}的前nn项和,若S5=S3S_{5}=S_{3},则a4=()a_{4}=(\quad)…
  5. 5等差数列{an}\{a_{n}\}和{bn}\{b_{n}\}的前nn项和分别为SnS_{n}和TnT_{n},且SnTn=3n2n+3\dfrac{S_{n}}{T_{n}}=\dfrac{3n}{2n+3},则a5b5=()\dfrac{a_{5}}{b_{5}}=(\quad)…