Answer:
<h2>d(4) = 64</h2>
Step-by-step explanation:
d(1) = 13
d(n) = d(n - 1) + 17
where
n is the nth term
To find the 4th term we must first find the second term use it to find the 3rd term and use the 3rd term to find the 4th term
So we have
<u>For the 2nd term</u>
That's d(2)
We have
d(2) = d(2-1) + 17
d(2) = d(1) + 17
But d(1) = 13
d(2) = 13 + 17 = 30
<u>For the 3rd term d(3)</u>
That's
d(3) = d(3 - 1) + 17
d(3) = d(2) + 17
d(3) = 30 + 17 = 47
<u>For the 4th term that's d(4)</u>
We have
d(4) = d(4 - 1) + 17
d(4) = d(3) + 17
d(4) = 47 + 17
We have the final answer as
<h3>d(4) = 64</h3>
Hope this helps you
Answer:
6
Step-by-step explanation:
3n=3(n)
ur replcing n with 2
3(2)=3x2
3x2=6
Answer:
f is not defined at x = 3 ⇒ answer (b)
Step-by-step explanation:
∵ f(x) = x² - x - 6/x² - 9 is a rational function
∴ It will be undefined at the values of x of the denominator
∵ The denominator is x² - 9
∵ x² - 9 = 0 ⇒ x² = 9 ⇒ x = ±√9
∴ x = ± 3
∴ f(x) can not be defined at x = 3
∴ The f(x) can not be continuous at x = 3
∴ The answer is (b)
Answer:
Mariam went to the store 5 times, while Sana went 3 times.
Step-by-step explanation:
Since Mariam and Sana are excited that a new store just opened in town, and they go together the first day it opens, and each time Mariam goes to the store she plans to spend Rs. 30, and each time Sana goes to the store she plans to spend Rs. 50, and a few weeks from now, Mariam and Sana are surprised to find out that they have spent the exact same total amount of money at the store, to determine what is the least possible number of times that Mariam has been to the store the following mathematical reasoning has to be done:
To know how many times Mariam went and how many times Sana went to the store, since she spends Rs. 30 and the other Rs. 50, and they have spent the same after a few weeks, it is through the search for the lower common multiple of both numbers.
Thus, the common multiple less than 30 and 50 is 150 (30 x 5 or 50 x 3). Therefore, Mariam went to the store 5 times, while Sana went 3 times.
Answer:
decomposer
Step-by-step explanation:
