문제 은행 · 기초 수학 · 대수 · 수열

수열의 귀납적 정의

먼저 혼자 풀어 보고, 풀이로 확인한 다음, 아래 「한 번 더」 문제로 이어서 연습하세요.

Sundstrom, Mathematical Reasoning · 4.3절 · 13a번영어 원문

For the sequence a1,a2,…,an,…a_1 ,a_2 , \ldots ,a_n , \ldots , assume that a1=1a_1 = 1, a2=3a_2 = 3, and that for each n∈Nn \in \mathbb{N}, an+2=3an+1−2ana_{n + 2} = 3a_{n + 1} - 2a_n.

Calculate a3a_3 through a6a_6.

정답·풀이 보기 (영어 원문)

a3=7a_3 = 7, a4=15a_4 =15, a5=31a_5 =31, a6=63a_6 =63

한 번 더 — 비슷한 문제Sundstrom, Mathematical Reasoning · 4.3절 · 18a번영어 원문

The Lucas numbers

are a sequence of natural numbers L1,L2,L3,…,Ln,…L_1, L_2, L_3, \ldots, L_n, \ldots, which are defined recursively as follows:

  • L1=1L_1 = 1 and L2=3L_2 = 3, and - For each natural number nn, Ln+2=Ln+1+LnL_{n+2} = L_{n+1} + L_n.

List the first 10 Lucas numbers and the first ten Fibonacci numbers and then prove each of the following propositions. The Second Principle of Mathematical Induction may be needed to prove some of these propositions.

For each natural number nn, Ln=2fn+1−fnL_n = 2f_{n+1} - f_n.

다 풀었으면 정답 확인

Let P(n)P(n) be, “Ln=2fn+1−fnL_n = 2f_{n+1} - f_n.” First, verify that P(1)P(1) and P(2)P(2) are true. Now let kk be a natural number with k≥2k \geq 2 and assume that P(1)P(1), P(2)P(2), …, P(k)P(k) are all true. Since P(k)P(k) and P(k−1)P(k-1) are both assumed to be true, we can use them to help prove that P(k+1)P(k+1) must then be true as follows:

Lk+1=Lk+Lk−1=(2fk+1−fk)+(2fk−fk−1)=2(fk+1+fk)−(fk+fk−1)=2fk+2−fk+1\begin{aligned}L_{k+1} & = L_k + L_{k-1} \\ & = \left( 2f_{k+1} - f_k \right) + \left( 2f_k - f_{k-1} \right) \\ & = 2 \left( f_{k+1} + f_k \right) - \left( f_k + f_{k-1} \right) \\ & = 2f_{k+2} - f_{k+1}\end{aligned}

.

이 문제로 이어서 풀기
# 수열의 귀납적 정의계산자동 분류

「수열의 귀납적 정의」 문제 목록으로