Skip to content
CalcGospel 國際數學圖譜
返回

CIE 9709 2024 June Paper 31 Q6

A Level / CIE / P3

CIE 9709 2024 June Paper 31 Paper · Question 6

题目

Problem

(a) By sketching a suitable pair of graphs, show that the equation cosec⁡12x=ex−3\operatorname{cosec}\frac12x=\mathrm{e}^x-3 has exactly one root, denoted by α\alpha, in the interval 0<x<π0<x<\pi.

(2)

(b) Verify by calculation that α\alpha lies between 11 and 22.

(2)

(c) Show that if a sequence of values in the interval 0<x<π0<x<\pi given by the iterative formula

xn+1=ln⁡(cosec⁡12xn+3)x_{n+1}=\ln\big(\operatorname{cosec}\tfrac12x_n+3\big)

converges, then it converges to α\alpha.

(1)

(d) Use this iterative formula with an initial value of 1.41.4 to determine α\alpha correct to 22 decimal places. Give the result of each iteration to 44 decimal places.

(3)

(e) State the minimum number of calculated iterations needed with this initial value to determine α\alpha correct to 22 decimal places.

(1)
题目中文翻译

(a) 通过画出一对合适的图像的草图,证明方程 cosec⁡12x=ex−3\operatorname{cosec}\frac12x=\mathrm{e}^x-3 在区间 0<x<π0<x<\pi 内恰有一个根,记为 α\alpha。

(2)

(b) 通过计算验证 α\alpha 位于 11 与 22 之间。

(2)

(c) 证明:如果由迭代公式

xn+1=ln⁡(cosec⁡12xn+3)x_{n+1}=\ln\big(\operatorname{cosec}\tfrac12x_n+3\big)

给出的、取值在区间 0<x<π0<x<\pi 内的数列收敛,那么它收敛于 α\alpha。

(1)

(d) 使用此迭代公式,以 1.41.4 为初始值,求 α\alpha,结果保留 22 位小数。每次迭代的结果保留 44 位小数。

(3)

(e) 写出使用此初始值求得精确到 22 位小数的 α\alpha 所需计算的最少迭代次数。

(1)
原卷通用作答要求

Answer all questions. You should use a calculator where appropriate.

You must show all necessary working clearly; no marks will be given for unsupported answers from a calculator.

Give non-exact numerical answers correct to 3 significant figures, or 1 decimal place for angles in degrees, unless a different level of accuracy is specified in the question.

请回答所有题目。适当时应使用计算器。必须清楚展示所有必要的计算过程;仅给出计算器答案而没有过程,不予评分。除非题目另有精度要求,非精确数值答案保留 3 位有效数字,以度为单位的角度保留 1 位小数。

解答

(a)

解法一

思路

展开

在整个给定区间,余割曲线递减而指数曲线递增。两端的相对高低交换,故有且只有一个交点。

答题过程

展开

Sketch y=cosec⁡(x/2)y=\operatorname{cosec}(x/2) and y=ex−3y=e^x-3 for 0<x<π0<x<\pi.

The cosecant curve decreases from +∞+\infty towards (π,1)(\pi,1). The exponential curve increases, passing through (0,−2)(0,-2) and tending towards (π,eπ−3)(\pi,e^\pi-3).

Near x=0x=0 the cosecant curve is above the exponential curve. Near x=πx=\pi, it is below it since eπ−3>1e^\pi-3>1.

Continuity gives an intersection, and opposite strict monotonicity gives exactly one. Mark that intersection on the sketch. Hence there is exactly one root α\boxed{\text{exactly one root }\alpha}.

(b)

解法一

思路

展开

用两边之差计算端点值,弧度制下的变号确定区间。

答题过程

展开

Let f(x)=cosec⁡(x/2)−(ex−3)f(x)=\operatorname{cosec}(x/2)-(e^x-3). Using radians,

f(1)= 2.367547…>0,f(2)= −3.200660…<0.\begin{align*} f(1)=&\,2.367547\ldots>0,\\[4mm] f(2)=&\,-3.200660\ldots<0. \end{align*}

Since ff is continuous on [1,2][1,2], the sign change proves that 1<α<2\boxed{1<\alpha<2}.

(c)

解法一

思路

展开

收敛的极限满足不动点方程,指数化后即为原方程。

答题过程

展开

Suppose xn→Lx_n\to L. Since 0<xn<π0<x_n<\pi, the recurrence gives xn+1⩾ln⁡4x_{n+1}\geqslant\ln4, so ln⁡4⩽L⩽π\ln4\leqslant L\leqslant\pi. The iteration function is continuous throughout this closed interval. Taking limits gives

L=ln⁡(cosec⁡(L/2)+3).L=\ln\big(\operatorname{cosec}(L/2)+3\big).

Exponentiating and rearranging,

eL=cosec⁡(L/2)+3⟹cosec⁡(L/2)=eL−3.e^L=\operatorname{cosec}(L/2)+3 \quad\Longrightarrow\quad \operatorname{cosec}(L/2)=e^L-3.

If L=πL=\pi, the fixed-point equation would give π=ln⁡4\pi=\ln4, which is false. Thus 0<L<π0<L<\pi, and by the uniqueness in (a), L=α\boxed{L=\alpha}.

(d)

解法一

思路

展开

使用指定初值,逐步计算四位小数。为回答(e),保留从第一次迭代开始的编号。

答题过程

展开

Starting with x0=1.4x_0=1.4, apply

xn+1=ln⁡(cosec⁡(xn/2)+3)x_{n+1}=\ln\big(\operatorname{cosec}(x_n/2)+3\big)

in radians, keeping full internal precision:

nnxnx_n to 4 decimal places
01.4000
11.5156
21.4940
31.4978
41.4971

The last two values agree to 2 decimal places. Hence α=1.50\boxed{\alpha=1.50}.

(e)

解法一

思路

展开

第三次与第四次迭代第一次连续给出相同的两位小数,因此需要算到第四次。

答题过程

展开

The third and fourth calculated iterates are the first consecutive pair which both round to 1.501.50.

Therefore the minimum number of calculated iterations is 4\boxed{4}.