Which recursive formula can be used to generate the sequence shown, where f(1) = 9.6 and n > 1? 9.6, –4.8, 2.4, –1.2, 0.6, ..
2 answers:
Answer:
Recursive formula will be
Step-by-step explanation:
The given sequence is 9.6, -4.8, 2.4, -1.2, 0.6......
In this sequence we find that there is a common ratio which makes this sequence a geometric sequence.
For a geometric sequence explicit formula is given by
if n > 1
So by putting values of a = 9.6
and common ratio r = =
Therefore, the recursive formula will be
You might be interested in
Answer:
Step-by-step explanation:
For the random variable we define the possible values for this variable on this case
. We know that we have 2 defective transistors so then we have 5C2 (where C means combinatory) ways to select or permute the transistors in order to detect the first defective:
We want the first detective transistor on the ath place, so then the first a-1 places are non defective transistors, so then we can define the probability for the random variable like this:
For the distribution of we need to take in count that we are finding a conditional distribution.
given
, for this case we see that
, so then exist
ways to reorder the remaining transistors. And if we want b additional steps to obtain a second defective transistor we have the following probability defined:
And if we want to find the joint probability we just need to do this:
And if we multiply the probabilities founded we got: