How do I solve -2(x+5)=4
2 answers:
You might be interested in
(gof)(0) cannot be evaluated
<em><u>Solution:</u></em>
Given that,
A composite function is denoted by (g o f) (x) = g (f(x)).
The notation g o f is read as “g of f”
Therefore, let us find whether (gof)(0) can be evaluated or not
To find (gof)(0):
(g o f) (x) = g (f(x))
Now substitute the given value of f(x)
Now to find (gof)(0), substitute x = 0
Since 1 divided by 0 is undefined, because any number divided by 0 is undefined
(gof)(0) cannot be evaluated
This is a simple problem based on combinatorics which can be easily tackled by using inclusion-exclusion principle.
We are asked to find number of positive integers less than 1,000,000 that are not divisible by 6 or 4.
let n be the number of positive integers.
∴ 1≤n≤999,999
Let c₁ be the set of numbers divisible by 6 and c₂ be the set of numbers divisible by 4.
Let N(c₁) be the number of elements in set c₁ and N(c₂) be the number of elements in set c₂.
∴N(c₁) =
N(c₂) =
∴N(c₁c₂) =
∴ Number of positive integers that are not divisible by 4 or 6,
N(c₁`c₂`) = 999,999 - (166666+250000) + 41667 = 625000
Therefore, 625000 integers are not divisible by 6 or 4
We are asked to find number of positive integers less than 1,000,000 that are not divisible by 6 or 4.
let n be the number of positive integers.
∴ 1≤n≤999,999
Let c₁ be the set of numbers divisible by 6 and c₂ be the set of numbers divisible by 4.
Let N(c₁) be the number of elements in set c₁ and N(c₂) be the number of elements in set c₂.
∴N(c₁) =
N(c₂) =
∴N(c₁c₂) =
∴ Number of positive integers that are not divisible by 4 or 6,
N(c₁`c₂`) = 999,999 - (166666+250000) + 41667 = 625000
Therefore, 625000 integers are not divisible by 6 or 4
5% is 0.05 in decimals. To get 5% of M, multiply it. To convert a percentage into decimals, divide the number by 100. 20/100 is 0.2. 0.2 is the tip. Do the same as 0.05 and add in the actual cost of the meal (M). Check image
