Answer:
125.66
Step-by-step explanation:
i don't get the one decimal place part but there your answer
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:
3
Step-by-step explanation:
Answer:
67
Step-by-step explanation:
I don car e dry because I debt
Answer:
Step-by-step explanation:
Use FOIL method
1) (x +4 )(3x +2) = x*3x + x*2 + 4*3x + 4*2
= 3x² + 2x + 12x + 8
= 3x² + 14x + 8
4) (4x - 1) (2x + 7) = 4x*2x + 4x*7 + (-1)*2x + (-1) * 7
= 8x² + 28x - 2x - 7
= 8x² + 26x - 7
