down 3 unit mean -3 outside root
right 2 unit mean -2 inside root,
so the answer is

Answer:
(1)
Step-by-step explanation:
Data given and notation
n=100 represent the random sample taken
estimated proportion with the survey
is the value that we want to test
represent the significance level
z would represent the statistic (variable of interest)
represent the p value (variable of interest)
Concepts and formulas to use
We need to conduct a hypothesis in order to test the claim that the true proportion is lower than 0.41.:
Null hypothesis:
Alternative hypothesis:
When we conduct a proportion test we need to use the z statistic, and the is given by:
(1)
The One-Sample Proportion Test is used to assess whether a population proportion
is significantly different from a hypothesized value
.
Calculate the statistic
Since we have all the info requires we can replace in formula (1) like this:
Answer:
75
Step-by-step explanation:
f(1) = 7
f(n) = 3f(n-1) + 3
So what you are trying to do here is find the recursive value (that's what it is called) for f(n). Computers love this sort of thing, but we humans have to do it slowly and carefully.
So let's try f(2)
That means that f(2) = 3*f(n-1) + 3
but if f(2) is used it means that you have to know f(2-1) which is just f(1) and we know that.
so f(2) = 3*f(1)+3
f(2) = 3*7 + 3
f(2) = 21 + 3
f(2) = 24
Now do it again. We now know F(2), so we should be able to find f(3)
f(3) = 3*f(3 - 1) + 3
f(3) = 3*f(2) + 3 We know that f(2) = 24
f(3) = 3* 24 + 3
f(3) = 72 + 3
f(3) = 75
The true statement about why the Fibonacci sequence is recursively defined is (c) The Fibonacci sequence is recursively-defined because you must know the values of the two previous terms in order to find the value of the next term
<h3>How to determine the true statement</h3>
With an exception to the first two terms, each term of the Fibonacci sequence is the sum of the two previous terms
This means that,
The Fibonacci sequence cannot be defined explicitly, because the two previous terms can not be determined by a direct formula
Hence, the true statement about why the Fibonacci sequence is recursively defined is (c)
Read more about the Fibonacci sequence at:
brainly.com/question/16934596
Answer:
£978
Step-by-step explanation:
i did use a calculator so i don't know if this is wrong or not, sorry if it is.