在一项电脑模拟中,每位玩家使用一个完全相同的水桶,重复向各自指定的、初始为空的水箱中倒水。两位玩家 Chris 和 Elliot 参与了这项模拟,并按以下方式向各自的水箱中倒水:
- Chris 第一次用水桶向水箱中倒入 5 升水。随后,他每次倒入的水量都比前一次少 0.3 升。
- Elliot 第一次用水桶向水箱中倒入 5 升水。随后,他每次倒入的水量都是前一次的 85%。
当任意一位玩家可倒入的水量不再为正数时,模拟停止。
- (i)
确定在模拟停止前,克里斯(Chris)可以向其水箱中倒水的次数。由此求出此时水箱中水的体积。
- (ii)
当任何一位玩家各自水箱中的总水量达到或超过目标总水量时,模拟也会停止。已知每个水箱的目标总水量为 33.5 升。
埃利奥特(Elliot)评论说这个目标是不公平的,因为他将无法达到该目标。解释埃利奥特的说法是否合理。
- (iii)
现在,每个水箱的总目标水量更改为 30 升。
Chris 和 Elliot 同时开始模拟。模拟的设计使得所有玩家每次都在同一时间向他们分配的水箱中倒水。
确定哪位玩家最先达到或超过水箱中的总目标水量,并清晰地写出你的计算过程。
- (iv)
假设 Gary 是一名新玩家。他第一次用桶向分配给他的水箱中倒入 5 升水。随后,他每次倒入上一次倒入水量的 。求 的最小值,使得 Gary 在倒水 7 次后,水箱中的总目标水量达到或超过 30 升。答案保留到最接近的整数。
它不会直接告诉你答案,而是问你卡在哪一步看看 AI 是怎么陪你一步步弄懂这道题的
完整解法
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 分析,可能出错
用 AI 批改,圈出写错的那一步,并自动将你的薄弱点存入错题本,形成你的错因库。