body{margin:0;} noscript{z-index: 10000; position: fixed; display: block; height: 100%; width: 100%; background: #fff;} noscript .fa{font-size: 40px; display:block; color: #daa520;} noscript div{margin-top: 6%; padding-left: 20px; padding-right: 20px; text-align: center;} ! You must have JavaScript enabled to use this site.

Big Ideas Math Algebra 2, 2014

BI

Big Ideas Math Algebra 2, 2014 View details

5. Using Recursive Rules with Sequences

Continue to next subchapter

Exercise 5 Page 447

The given rule means that, after the first term of the sequence, every term f(n) is the product of the previous term f(n-1) and 2.

f(0)=4, f(1)=8, f(2)=16, f(3)=32, f(4)=64, f(5)=128

Practice makes perfect

We are asked to write the first 6 terms of a sequence, given a recursive rule.

f(0)&=4 f(n)&=2f(n-1) To do so, we will use a table.

n	f(n)=2f(n-1)	2f(n-1)	f(n)
0	f( 0)=4	-	4
1	f( 1)=2f( 1-1)	2 f(0)=2( 4)	8
2	f( 2)=2f( 2-1)	2 f(1)=2( 8)	16
3	f( 3)=2f( 3-1)	2 f(2)=2( 16)	32
4	f( 4)=2f( 4-1)	2 f(3)=2( 32)	64
5	f( 5)=2f( 5-1)	2 f(4)=2( 64)	128

Therefore, the first 6 terms of the sequence are 4, 8, 16, 32, 64 and 128.

Subchapter links

Communicate Your Answer p.441

Monitoring Progress p.442-446

Exercises p.447-450