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:
A∩B=∅
Step-by-step explanation:
A intersect B have no elements in common - so we have the empty set.
Answer:
![a^{3} \sqrt[]{a}](https://tex.z-dn.net/?f=a%5E%7B3%7D%20%5Csqrt%5B%5D%7Ba%7D)
Step-by-step explanation:
Answer:
1) Subtracting one from the other
2) x = 0.375 and y = 0.125
Step-by-step explanation:
Equation 1 :

Equation 2:

To solve these equations by the Elimination method we multiply equation 1 with 6 and multiply equation 2 with 2 so now,

Now for the second equation:

Now subtracting equation 2 from equation 1

now insert this value of y into any equation
lets insert it into equation 1
