For the sequence , assume that , and that for each natural number ,
.
Compute for the first 10 natural numbers.
문제 은행 · 기초 수학 · 대수 · 수열
점화식으로 수열을 정의하고 일반항을 구한다
유형·난이도는 우리말 풀이가 붙은 문제는 선생님이 정했고, 나머지는 자동 분류라 다를 수 있어요. 난이도가 정해지지 않은 문제는 난이도로 거를 때 빠집니다.
86문제 · 5 / 5쪽
For the sequence , assume that , and that for each natural number ,
.
Compute for the first 10 natural numbers.
For the sequence , assume that , and that for each natural number ,
.
Make a conjecture about a formula for in terms of that does not involve a summation or a recursion.
원본 교재에 이 문제의 정답은 실려 있지 않습니다.
한 번 더 — 비슷한 문제 풀기Sundstrom, Mathematical Reasoning · 4.3절 · 12b번For the sequence , assume that , , and for each , . Determine which terms in this sequence are divisible by 4 and prove that your answer is correct.
원본 교재에 이 문제의 정답은 실려 있지 않습니다.
한 번 더 — 비슷한 문제 풀기OpenStax Algebra and Trigonometry · 13장 복습 · 9번The Lucas numbers
are a sequence of natural numbers , which are defined recursively as follows:
- and , and - For each natural number , .
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 , .
Let be, “.” First, verify that and are true. Now let be a natural number with and assume that , , …, are all true. Since and are both assumed to be true, we can use them to help prove that must then be true as follows:
.
The Lucas numbers
are a sequence of natural numbers , which are defined recursively as follows:
- and , and - For each natural number , .
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 with , .
원본 교재에 이 문제의 정답은 실려 있지 않습니다.
한 번 더 — 비슷한 문제 풀기OpenStax Algebra and Trigonometry · 13.3절 · 27번The Lucas numbers
are a sequence of natural numbers , which are defined recursively as follows:
- and , and - For each natural number , .
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 with , .
원본 교재에 이 문제의 정답은 실려 있지 않습니다.
한 번 더 — 비슷한 문제 풀기OpenStax Algebra and Trigonometry · 13장 연습 시험 · 9번