Answer:
See definition below
Step-by-step explanation:
Since we have to give a recursive definition, we must give a initial value f(0). Additionally, the value of f(n) must depend on the value of f(n-1) for all n≥1.
The required value of f(0) is (0+1)!=1!=1.
Now, the factorial itself is a recursive function, because (n+1)!=(n+1)n!. In terms of f, this means that f(n)=(n+1)f(n-1) for all n≥1.
Then, our definition is: f:N→N is defined by
- f(0)=1.
- For n≥1, f(n)=(n+1)f(n-1).
Answer:
Based on the linear relation shown above, when the y coordinate is 3, the x coordinate is 8.
Step-by-step explanation:
This is because every time you add an input of 2, you subtract an output of 4.
Basically in the x value you add 2 while in the why value you subtract 4.
(2, 13) (4, 9) (6, 5) (8, 1)
Answer:
Step-by-step explanation:
1=34
2=21
3=27
4=16
5=51
6=21
7=17
8=72
9=80
10=13
