Answer:
recursive rule for the given sequence:
for n > 2
Step-by-step explanation:
Given the sequence:
7, 6, 13, 19, 32, ......
then;
First term = 7
Second term =6
third term = 13 and so on..
You can see that:
similarly for:
and so on..
The recursive rule for this sequence is:
for n > 2
Answer:
0% probability that it would take exactly 3.7 hours to construct a soapbox derby car
Step-by-step explanation:
Problems of normally distributed samples are solved using the z-score formula.
In a set with mean and standard deviation
, the zscore of a measure X is given by:
The Z-score measures how many standard deviations the measure is from the mean. After finding the Z-score, we look at the z-score table and find the p-value associated with this z-score. This p-value is the probability that the value of the measure is smaller than X, that is, the percentile of X. Subtracting 1 by the pvalue, we get the probability that the value of the measure is greater than X.
Also, the probability of finding an exact value in the normal probability distribution is 0.
So
0% probability that it would take exactly 3.7 hours to construct a soapbox derby car