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

CIE 9231 2023 November Paper 13 Q1

A Level / CIE / FP1

CIE 9231 2023 Nov Paper 13 Paper · Question 1

题目

Problem

(a) By considering (r+1)2−r2(r+1)^2-r^2, use the method of differences to prove that ∑r=1nr=12n(n+1)\displaystyle\sum_{r=1}^{n}r=\frac12n(n+1).

(4)

(b) Given that ∑r=1n(r+a)=n\displaystyle\sum_{r=1}^{n}(r+a)=n, find aa in terms of nn.

(3)
题目中文翻译

(a) 通过考虑 (r+1)2−r2(r+1)^2-r^2,用差分法证明 ∑r=1nr=12n(n+1)\displaystyle\sum_{r=1}^{n}r=\frac12n(n+1)。

(4)

(b) 已知 ∑r=1n(r+a)=n\displaystyle\sum_{r=1}^{n}(r+a)=n,求 aa,以 nn 表示。

(3)
原卷通用作答要求

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)

解法一

思路

展开

把相邻平方差展开为2r+1,对r求和后,左边首尾相消,右边包含所求自然数和。

答题过程

展开

Since (r+1)2−r2=2r+1(r+1)^2-r^2=2r+1, summing from r=1r=1 to r=nr=n gives

 (22−12)+(32−22)+(42−32)+⋯ +((n−1)2−(n−2)2) +(n2−(n−1)2) +((n+1)2−n2)= 2∑r=1nr+n.\begin{align*} &\,(2^2-1^2)+(3^2-2^2)+(4^2-3^2)+\cdots\\[4mm] &\,\hspace{2pt}+\big((n-1)^2-(n-2)^2\big)\\[4mm] &\,\hspace{4pt}+\big(n^2-(n-1)^2\big)\\[4mm] &\,\hspace{4pt}+\big((n+1)^2-n^2\big)\\[4mm] =&\,2\sum_{r=1}^n r+n. \end{align*}

The left-hand side telescopes to (n+1)2−1=n2+2n(n+1)^2-1=n^2+2n. Thus

2∑r=1nr=n2+n,2\sum_{r=1}^n r=n^2+n,

so

∑r=1nr=12n(n+1).\boxed{\sum_{r=1}^n r=\frac12n(n+1)}.

The expansion illustrates the cancellation for sufficiently large nn; the identity also holds directly for smaller positive integers.

(b)

解法一

思路

展开

常数a加了n次,所以先用上一问的自然数和,再除以正整数n。

答题过程

展开

Using (a),

∑r=1n(r+a)=12n(n+1)+an=n.\sum_{r=1}^n(r+a)=\frac12n(n+1)+an=n.

Since n>0n>0, division by nn gives 12(n+1)+a=1\frac12(n+1)+a=1. Hence

a=1−n2.\boxed{a=\frac{1-n}{2}}.