Answer:
-6
Step-by-step explanation:
y=-1/3(12)-2
=(-1/3x12/1)-2
=-4-2
y=-6
(f-g)(x) = f(x) - g(x)
= (x^3 -2x+6) - (2x^3+3x^2-4x+2)
= x^3 -2x +6 -2x^3 -3x^2 +4x -2 . . . . distribute the negative sign
= (1-2)x^3 -3x^2 +(-2+4)x +(6-2) . . . . . combine like terms
(f-g)(x) = -x^3 -3x^2 +2x +4
9514 1404 393
Answer:
300
Step-by-step explanation:
There are 25 ways to select the first student. After that student is removed from the selection pool for the second student, there are 24 ways to select the second student. This gives 25·24 = 600 ways to select 2 students <em>in a particular order</em>.
Since we don't care about the order, we can divide this number by the number of ways two students can be ordered: AB or BA, 2 ways.
600/2 = 300
There are 300 ways to pick a combination of two students from 25.
__
<em>Additional comments</em>
This sort of selection (2 out of 25) has a formula for it, and an abbreviation for the formula.
"n choose k" can be written nCk or C(n, k)
The function is a ratio of factorials:
nCk = n!/(k!(n-k)!)
If you can typeset this, it is written ...
This is different from the formula for the number of <em>permutations</em> of n things taken k at a time. That would be written nPk or P(n, k) = n!/(n-k)!.
The function g(x) is a translation to the right of 3 units and up 2 units of f(x), so the correct option is B.
<h3>Which statement is true regarding the vertical and horizontal translations from f(x) to g(x)?</h3>
For a given function f(x), we can write a vertical translation of n units as:
g(x) = f(x) + n
- If n < 0, the translation is downwards.
- if n > 0, the translation is upwards.
And a horizontal translation of n units as:
g(x) = f(x + n).
- if n > 0, the translation is to the left.
- if n < 0, the translation is to the right.
Here we have:
f(x) = (2/3)*x
g(x) = (2/3)*(x - 3) + 2
By comparing it with the general translations, we conclude that we have a traslation of 3 units to the right and 2 units up.
So the correct option is B.
If you want to learn more about translations:
brainly.com/question/24850937
#SPJ1
