Answer:it is B
The sequence is recursive and can be represented by the function f(n + 1) = f(n) + f of n plus 1 equals f of n plus StartFraction 3 Over 8 EndFraction.. thats the right answer if anyone needs ir
Step-by-step explanation:
got it right on eggnuity
creds to the guy who posted it on the discussion
Assuming that 10% is the probability of a switch being defective (since left-handedness has nothing to do with the problem):
For a binomial distribution, probability(r out of n) = (nCr) (p)^r (q)^(1-r)
p = 10% = 0.1, q = 1 - p = 0.9
r = 2 switches, n = total of 12 switches
probability = (12C2) (0.1)^2 (0.9)^(12-2)
probability = 66(0.1)^2 (0.9)^10
probability = 0.23
To answer this question we can think Soh Cah Toa. If we are 100 ft from the tree and at an angle of 36 degrees and we want what I call the rise we can us the Toa formula tan(36)=o/100 then manipulate algebraically until we get the following o=tan(36)(100) this give us the height (o) to be 72.65 meters
Note that (a+b)^2 = a^2 + 2ab + b^2.
Therefore,
b^x (b^x )^2
<span>(2a^x +1/2 b^x)^2 becomes (2a^x)^2 + 2(2a^x)(-------- ) + ------------
2 4
LCD is 4. Thus, we have
4 [ (2a^(2x) ] + 8</span>a^x*b^x + b^(2x)
<span> </span>
Answer:
10=+hsh
Step-by-step explanation:
i ahte math
