# Lesson 6

Representing Sequences

- Let’s look at different ways to represent a sequence.

### Problem 1

An arithmetic sequence \(a\) starts 2, 5, . . .

- Write a recursive definition for this sequence using function notation.
- Use your definition to make a table of values for \(a(n)\) and find \(a(6)\).

### Problem 2

A geometric sequence \(g\) starts 1, 3, . . .

- Write a recursive definition for this sequence using function notation.
- Sketch a graph of the first 5 terms of \(g\).
- Explain how to use the recursive definition to determine \(g(30)\). (Don’t actually determine the value.)

### Problem 3

Match each sequence with one of the recursive definitions. Note that only the part of the definition showing the relationship between the current term and the previous term is given so as not to give away the solutions.

### Problem 4

Write the first five terms of each sequence.

- \(a(1)=1, a(n)=3 \boldcdot a(n-1), n\ge2\)
- \(b(1)=1, b(n)=\text-2 + b(n-1), n\ge2\)
- \(c(1)=1, c(n)=2 \boldcdot c(n-1) + 1, n\ge2\)
- \(d(1)=1, d(n)=d(n-1)^2+1, n\ge2\)
- \(f(1)=1, f(n)=f(n-1)+2n-2, n\ge2\)

### Problem 5

A sequence has \(f(1) = 120, f(2) = 60\).

- Determine the next 2 terms if it is an arithmetic sequence, then write a recursive definition that matches the sequence in the form \(f(1)=120, f(n)=f(n-1)+\underline{\hspace{.25in}}\) for \(n\ge2\).
- Determine the next 2 terms if it is a geometric sequence, then write a recursive definition that matches the sequence in the form \(f(1)=120, f(n)=\underline{\hspace{.25in}} \boldcdot f(n-1)\) for \(n\ge2\).

### Problem 6

One hour after an antibiotic is administered, a bacteria population is 1,000,000. Each following hour, it decreases by a factor of \(\frac{1}{2}\).

- Complete the table with the bacteria population at the given times.
- Do the bacteria populations make a geometric sequence? Explain how you know.

number of hours | population |
---|---|

1 | 1,000,000 |

2 | |

3 | |

4 | |

5 | |

6 |