Not all roles available for this page.
Sign in to view assessments and invite other educators
Sign in using your existing Kendall Hunt account. If you don’t have one, create an educator account.
A sequence is defined by \(f(0) = 3, f(n) = 2 \boldcdot f(n-1)\) for \(n\ge1\). Write a definition for the \(n^{\text{th}}\) term of \(f\).
A geometric sequence, \(g(n)\) starts 20, 60, . . . Define \(g\) recursively and for the \(n^{\text{th}}\) term.
A geometric sequence \(g\) starts at 500 and has a growth factor of 0.6. Sketch a graph of \(g\) showing the first 5 terms.
A piece of paper has an area of 96 square inches.
| \(n\) | \(A(n)\) |
|---|---|
| 0 | 96 |
| 1 | |
| 2 | |
| 3 |
Here is a growing pattern:
A Sierpinski triangle can be created by starting with an equilateral triangle, breaking the triangle into 4 congruent equilateral triangles, and then removing the middle triangle. Starting from a single black equilateral triangle with an area of 256 square inches, here are the first four steps:
| step number |
number of shaded triangles |
area, in square inches, of each shaded triangle |
|---|---|---|
| 0 | 1 | 256 |
| 1 | 3 | |
| 2 | ||
| 3 | ||
| 4 | ||
| 5 |