The requirement is that every element in the domain must be connected to one - and one only - element in the codomain.
A classic visualization consists of two sets, filled with dots. Each dot in the domain must be the start of an arrow, pointing to a dot in the codomain.
So, the two things can't can't happen is that you don't have any arrow starting from a point in the domain, i.e. the function is not defined for that element, or that multiple arrows start from the same points.
But as long as an arrow start from each element in the domain, you have a function. It may happen that two different arrow point to the same element in the codomain - that's ok, the relation is still a function, but it's not injective; or it can happen that some points in the codomain aren't pointed by any arrow - you still have a function, except it's not surjective.
To get -4 from 1, we must either subtract 5 from 1 or mult. 1 by -4. Unfortunately subtracting 5 from -4 does not result in 9, and mult -4 by -4 does not result in -16. So neither "works" in predicting the next term.
Can you think of any other experiments to do that would help you discover the pattern 1, -4, 9, -16?
N = N (1+0.20)^5
o
Here, that'd be 10000(1.20)^5, or 24883 trees.
Answer:
The answer is (x-6) squared
