Answer:
Step-by-step explanation:
Problem A
t(1) = 2(1) + 5
t(2) = 2*2 + 5 = 9
t(3) = 2*3 + 5 = 11
t(4) = 2*4 + 5 = 13
So this is the explicit result. Now try it recursively.
t_3 = t_2 + 2
t_3 = 9 + 2
t_3 = 11 which is just what it should do.
t_n = t_(n - 1) + 2
Problem B
t(1) = 3 * 1/2
t(1) = 3/2
t(2) = 3*(1/2)^2
t(2) = 3 * 1/4
t(2) = 3/4
t(3) = 3*(1/2)^3
t(3) = 3 * 1/8
t(3) = 3/8
t(4) = 3 (1/2)^4
t(4) = 3 (1/16)
t(4) = 3/16
So in general
t_n = t_n-1 * 1/2
For example t(5)
t_5 = t_4 * 1/2
t_5 = 3 /16 * 1/2 = 3/32
Answer: -3
Step-by-step explanation: hope this help
Answer:
1. x=0
2. m=5
3. x=8
4. x=-8
5. x=49
6. x=-133
Step-by-step explanation:
1. 9x=0
2. -20=-4m, 20=4m
3. 2x=16
4. x/8=-1, x=-1x8
5. x/7=7
6. After simplifying: −1/19(x)=7
Hope this helped, I just simplified all the steps for the step by step explanation. Have a great day and stay safe, happy, and healthy!
<span>$2376
880+880+616(70% of 880)= $2376</span><span>
</span>
Answer: "If there are not seven days in a week, then Halloween is not on October 31st.", and it is false because the inverse of a true conditional statement is false. Hope this helps and have a great day!