Sign In Sign Up Ask an AI advisor
jadabecute5939
jadabecute5939
04.05.2021 • 
Mathematics

Drag the tiles to the correct boxes to complete the pairs. Not all tiles will be used. Match each sequence to its appropriate recursively defined function. Recursively Defined Function Tile One: f(1) = -18 f(n) = 2 · f(n - 1) for n = 2, 3, 4, ... Tile Two: f(1) = 11 f(n) = f(n - 1) + 22 for n = 2, 3, 4, ... Tile Three: f(1) = -18 f(n) = f(n - 1) + 22 for n = 2, 3, 4, ... Tile Four: f(1) = 11 f(n) = 3 · f(n - 1) for n = 2, 3, 4, ... Tile Five: f(1) = -18 f(n) = 6 · f(n - 1) for n = 2, 3, 4, ... Tile Six: f(1) = -18 f(n) = f(n - 1) + 21 for n = 2, 3, 4, ... Sequences: Recursively 11, 33, 55, 77, ... -18, 3, 24, 45, ... -18, -108, -648, -3,888, ...

Solved
Show answers

Ask an AI advisor a question

I want advice