Answer:
218
Step-by-step explanation:
Because we need f(n) to calculate f(n+1), we have to calculate our values one step at a time. Starting with f(1) = 1,
f(2) = 5(f(1)) + 3 = 5(1) + 3 = 5+3 = 8
f(3) = 5(8) + 3 = 40 + 3 = 43
f(4) = 5(43) + 3 = 215 + 3 = 218
Answer: 6,000.
Step-by-step explanation:
A suitable calculator can row-reduce the augmented matrix.
first number: 3
second number: 1
third number: 8
Answer:
B) 15/(9+(-9))
Step-by-step explanation:
Be careful of the parentheses because if you just write out 15/9+(-9),
it's technically, saying that 15/9+(-9)=5/3+(-9)=5/3-9, and that's different from what you want to express, mathematically.
We will use demonstration of recurrences<span>1) for n=1, 10= 5*1(1+1)=5*2=10, it is just
2) assume that the equation </span>10 + 30 + 60 + ... + 10n = 5n(n + 1) is true, <span>for all positive integers n>=1
</span>3) let's show that the equation<span> is also true for n+1, n>=1
</span><span>10 + 30 + 60 + ... + 10(n+1) = 5(n+1)(n + 2)
</span>let be N=n+1, N is integer because of n+1, so we have
<span>10 + 30 + 60 + ... + 10N = 5N(N+1), it is true according 2)
</span>so the equation<span> is also true for n+1,
</span>finally, 10 + 30 + 60 + ... + 10n = 5n(n + 1) is always true for all positive integers n.
<span>
</span>
