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

CIE 9231 2024 June Paper 11 Q2

A Level / CIE / FP1

CIE 9231 2024 June Paper 11 Paper · Question 2

题目

Problem

Prove by mathematical induction that 64n+38n−26^{4n}+38^n-2 is divisible by 7474 for all positive integers nn.

(6)
题目中文翻译

用数学归纳法证明:对所有正整数 nn,64n+38n−26^{4n}+38^n-2 都能被 7474 整除。

(6)
原卷通用作答要求

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 位小数。

解答

解法一

思路

展开

先验证n=1。归纳时比较相邻两个表达式,差可提取37;括号内为偶数,才确保差能被74整除。

答题过程

展开

Let Fn=64n+38n−2F_n=6^{4n}+38^n-2. For n=1n=1,

F1=64+38−2=1332=74×18,F_1=6^4+38-2=1332=74\times18,

so the result is true.

Assume that FkF_k is divisible by 7474 for some positive integer kk. Then

Fk+1−Fk= (64−1)64k+(38−1)38k= 1295⋅64k+37⋅38k= 37(35⋅64k+38k).\begin{align*} F_{k+1}-F_k =&\,(6^4-1)6^{4k}+(38-1)38^k\\[4mm] =&\,1295\cdot6^{4k}+37\cdot38^k\\[4mm] =&\,37\big(35\cdot6^{4k}+38^k\big). \end{align*}

Since k⩾1k\geqslant1, both 64k6^{4k} and 38k38^k are even. The bracket is therefore even, so the difference is divisible by 7474.

By the hypothesis FkF_k is divisible by 7474, and thus so is Fk+1F_{k+1}. The result holds for n=1n=1 and truth for n=kn=k implies truth for n=k+1n=k+1. Hence, by induction, 64n+38n−26^{4n}+38^n-2 is divisible by 7474 for every positive integer nn.