Chapter 8: Problem 16
, write a rule for the nth term of the sequence. Then fi nd a20. \(86,79,72,65, \ldots\)
Short Answer
Step by step solution
Key Concepts
These are the key concepts you need to understand to accurately answer the question.
/*! This file is auto-generated */ .wp-block-button__link{color:#fff;background-color:#32373c;border-radius:9999px;box-shadow:none;text-decoration:none;padding:calc(.667em + 2px) calc(1.333em + 2px);font-size:1.125em}.wp-block-file__button{background:#32373c;color:#fff;text-decoration:none}
Learning Materials
Features
Discover
Chapter 8: Problem 16
, write a rule for the nth term of the sequence. Then fi nd a20. \(86,79,72,65, \ldots\)
These are the key concepts you need to understand to accurately answer the question.
All the tools & learning materials you need for study success - in one app.
Get started for free
In Exercises 33-40, write a rule for the \(n\)th term of the geometric sequence. $$ a_1=1, a_2=49 $$
REASONING Find the sum of the positive odd integers less than 300 . Explain your reasoning.
Write an explicit rule for the sequence. $$ a_1=13, a_n=4 a_{n-1} $$
What is the 873rd term of the sequence whose first term is \(a_1=0.01\) and whose \(n\)th term is \(a_n=1.01 a_{n-1}\) ? Justify your answer. (A) \(58.65\) (B) \(8.73\) (C) \(1.08\) (D) \(586,459.38\)
In the puzzle called the Tower of Hanoi, the object is to use a series of moves to take the rings from one peg and stack them in order on another peg. A move consists of moving exactly one ring, and no ring may be placed on top of a smaller ring. The minimum number \(a_n\) of moves required to move \(n\) rings is 1 for 1 ring, 3 for 2 rings, 7 for 3 rings, 15 for 4 rings, and 31 for 5 rings. a. Write a rule for the sequence. b. What is the minimum number of moves required to move 6 rings? 7 rings? 8 rings?
What do you think about this solution?
We value your feedback to improve our textbook solutions.