Middle option.
<span>(x + 1 ≤ 1) ∩ (x + 1 ≥ 1)
If you work both sides separately you get
</span>(x ≤ 0) ∩ (x ≥ 0)
<span>
which reduces nicely to
</span><span>{x | x = 0}</span>
Answer:
154 percent
Step-by-step explanation:
Answer: ln ( 40) *100
Step-by-step explanation:
Substituting 140 in the equation,
140 = 100 + e^(.01q)
40 = e^(.01q)
Take the natural log of bot hsides
ln ( 40) = .01q
q= ln ( 40 ) * 100
I think its the promise to not share it with anyone idk
Answer:
Step-by-step explanation:
This is a Combination (as in permutation vs combination) question the symbol (n r) refers to "n choose r". This is sometimes written as nCr
i.e the question is asking you to find how many combinations each will yield when you chose r items from n item without repetition and order does not matter.
I will only do the first question for you and you can just follow the same steps to solve the rest of the questions.
Recall that

Consider question a) we are given (5 1) or ₅C₁
we can see that n = 5 and r = 1
If we substitute this into the formula:
₅C₁ = (5!) / [ (1!)(5- 1)!]
= (5!) / [ (5- 1)!]
= (5!) / (4!)
= (5·4·3·2·1) / (4·3·2·1)
= 5
hence ₅C₁ = 5