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

CIE 9231 2025 June Paper 13 Q2

A Level / CIE / FP1

CIE 9231 2025 June Paper 13 Paper · Question 2

题目

Problem

Prove by mathematical induction that 2025n+47n−22025^n+47^n-2 is divisible by 4646 for all positive integers nn.

(6)
题目中文翻译

用数学归纳法证明:对所有正整数 nn,2025n+47n−22025^n+47^n-2 能被 4646 整除。

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

解答

解法一

思路

展开

用归纳法,并把2025与47分别写成46的倍数加1。相邻两项之差明显含因子46。

答题过程

展开

Let F(n)=2025n+47n−2F(n)=2025^n+47^n-2. For n=1n=1,

F(1)=2025+47−2=2070=46(45),F(1)=2025+47-2=2070=46(45),

so the result holds.

Assume that F(k)F(k) is divisible by 4646 for some positive integer kk. Then

F(k+1)−F(k)= (2025−1)2025k+(47−1)47k= 2024⋅2025k+46⋅47k= 46(44⋅2025k+47k).\begin{align*} F(k+1)-F(k) =&\,(2025-1)2025^k+(47-1)47^k \\[4mm] =&\,2024\cdot2025^k+46\cdot47^k \\[4mm] =&\,46\big(44\cdot2025^k+47^k\big). \end{align*}

This is a multiple of 4646. Since F(k)F(k) is a multiple of 4646 by the hypothesis, F(k+1)F(k+1) is also divisible by 4646.

Therefore, by mathematical induction, 2025n+47n−2 is divisible by 46\boxed{2025^n+47^n-2\text{ is divisible by }46} for every positive integer nn.