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:
j(12) = 17
General Formulas and Concepts:
<u>Pre-Algebra</u>
Order of Operations: BPEMDAS
- Brackets
- Parenthesis
- Exponents
- Multiplication
- Division
- Addition
- Subtraction
<u>Algebra I</u>
Step-by-step explanation:
<u>Step 1: Define</u>
j(x) = x + 5
j(12) is x = 12
<u>Step 2: Evaluate</u>
- Substitute in <em>x</em>: j(12) = 12 + 5
- Add: j(12) = 17
Equation in point slope form of a line:
y-y₀=m(x-x₀)
m=slope
(x₀,y₀)=(-4,7)
m=2/3
y-7=(2/3)(x+4)
Answer: y-7=(2/3)(x+4)
