Giving brainlist to whoever answers
2 answers:
You might be interested in
Given:
g(x) = (1/3)x + 2
Part (a)
To find the inverse:
Set y = g(x) = (1/3)x + 2
Swap x and y.
x = (1/3)y + 2.
Solve for y.
(1/3)y = x - 2
y = 3(x - 2).
Set g⁻¹(x) to y.
Answer: g⁻¹(x) = 3(x - 2)
Part (b)
Create the table shown below to graph g(x) and g⁻¹(x).
x g(x) g⁻¹(x)
---- --------- ---------
-8 - 2/3 - 30
-6 0 - 24
-4 2/3 - 18
-2 4/3 - 12
0 2 - 6
2 8/3 0
4 4/3 6
6 4 12
8 14/3 18
Note that when x = -6, g(x) = 0, so that (-6, 0) lies on he black liine.
Therefore the inverse function should yield (0, -6) to be correct. This is so, so g⁻¹ is correct.
Both g(x) and g⁻¹(x)satisfy the vertical line test, so both are functions.
Part (c)
Algebraically, we know that g⁻¹(x) is correct if g(g⁻¹(x)) = x
Use function composition to obtain
g(g⁻¹(x)) = (1/3)*(3x - 6) + 2
= x - 2 + 2
= x
Therefore g⁻¹(x) is correct.
g(x) = (1/3)x + 2
Part (a)
To find the inverse:
Set y = g(x) = (1/3)x + 2
Swap x and y.
x = (1/3)y + 2.
Solve for y.
(1/3)y = x - 2
y = 3(x - 2).
Set g⁻¹(x) to y.
Answer: g⁻¹(x) = 3(x - 2)
Part (b)
Create the table shown below to graph g(x) and g⁻¹(x).
x g(x) g⁻¹(x)
---- --------- ---------
-8 - 2/3 - 30
-6 0 - 24
-4 2/3 - 18
-2 4/3 - 12
0 2 - 6
2 8/3 0
4 4/3 6
6 4 12
8 14/3 18
Note that when x = -6, g(x) = 0, so that (-6, 0) lies on he black liine.
Therefore the inverse function should yield (0, -6) to be correct. This is so, so g⁻¹ is correct.
Both g(x) and g⁻¹(x)satisfy the vertical line test, so both are functions.
Part (c)
Algebraically, we know that g⁻¹(x) is correct if g(g⁻¹(x)) = x
Use function composition to obtain
g(g⁻¹(x)) = (1/3)*(3x - 6) + 2
= x - 2 + 2
= x
Therefore g⁻¹(x) is correct.
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