standard_description: Recognize that sequences are functions, sometimes defined recursively, whose domain is a subset of the integers. For example, the Fibonacci sequence is defined recursively by f(0) = f(1) = 1, f(n+1) = f(n) + f(n-1) for n ³ 1.
problem_activity: Task
The first three steps of three visual patterns are shown below.
[IMG]
[IMG]
[IMG]
Here are functions that define how many tiles are in step $n$, in no particular order: $$f(n)=3n^2$$ $$g(n)=n^2+4$$ $$h(n)=n^2-1$$
Decide which function defines which pattern.
One of these patterns has a step with $432$ tiles in it, one has a step with $195$ tiles in it, and one of these patterns has a step with $404$ tiles in it. Decide which is which, find the step that contains that number of tiles, and explain how you know.
Describe and justify the steps to solve this equation for $x$. $$ax^2+c=d$$


aligns: no