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).
im not sure but its 80 or 65
You wouldn't receive no particular amount.
15 + 7 + 9 + 7 + 4 + 4 + 3 + 3 = 52
The answer is four because there's one line that is placed on the origin which makes it no solution because there's not supposed to be a line on the origin and number 1 is a solution because there are neither lines plotted on the origin and has parallel lines