All categories

3 years ago

If f(x)=(1/2)x-3 and g(x)=2x+6 what is f(g(4))+g(f(4))

Mathematics

2 answers:

Elden [556K]3 years ago

6 0

Answer:

see explanation

Step-by-step explanation:

To evaluate f(g(4)) substitute x = 4 into g(x) and then substitute the value obtained into f(x)

g(4) = (2 × 4) + 6 = 8 + 6 = 14, then

f(14) = (0.5 × 14) - 3 = 7 - 3 = 4

Hence f(g(4)) = 4

--------------------------------------------------------

To evaluate g(f(4)) substitute x = 4 into f(x) and then substitute the value obtained into g(x)

f(4) = (0.5 × 4) - 3 = 2 - 3 = - 1, then

g(- 1) = (2 × - 1) + 6 = - 2 + 6 = 4

Hence g(f(4)) = 4

EleoNora [17]3 years ago

5 0

given,

f(x)=(1/2)x-3

g(x)=2x+6

Now,

f(4)=(1/2)×4-3

=2-3=-1

g(4)=2×4+6=14

Then,

f(g(4))=f(14)=(1/2)×14-3=7-3=4

g(f(4))=g(-1)=2×(-1)+6=-2+6=4

You might be interested in

If APORASTU, what is the scale factor of APOR to ASTU? Ο Α. 5 Ο Ο Ο Β. 4 G. D

forsale [732]

Answer:

Step-by-step explanation:

The scale factor is the ratio of corresponding sides, image to original

scale factor = $\frac{TU}{QR}$ = $\frac{4}{20}$ = $\frac{1}{5}$ → C

7 0

3 years ago

Round 8.78911981582 to the nearest millionth

Aliun [14]

Answer:

8.789120

(you have to include the zero, or else the answer would no longer be the nearest millionth! and you would be marked wrong)

8 0

3 years ago

Which of the following scenarios represents the smallest percent change?

mestny [16]

Answer:

A baby that weighed 6 1/4 pounds at birth now weighs 8 pounds.

Step-by-step explanation:

8 0

4 years ago

In how many distinguishable ways can you arrange the letters in the word CONNECTICUT? *

borishaifa [10]

Answer:

The number of distinguishable arrangements are 1,663,200.

Step-by-step explanation:

The word is: CONNECTICUT

The number of ways to arrange a word when no conditions are applied is:

$\frac{n!}{k_{1}!\cdot k_{2}!\cdot k_{3}!...\cdot k_{n}!}$

Here k is the number of times a word is repeated.

In the word CONNECTICUT there are:

3 Cs

2 Ns

2 Ts

And there are a total of n = 11 letters

So, the number of distinguishable arrangements are:

$\frac{n!}{k_{1}!\cdot k_{2}!\cdot k_{3}!...\cdot k_{n}!}=\frac{11!}{3!\times 2!\times 2!}$

$=\frac{39916800}{6\times 2\times 2}\\\\=1663200$

Thus, the number of distinguishable arrangements are 1,663,200.

7 0

3 years ago

For the expression: (− 1/x )× 1−x/1+x × x/x^2−1 Simplify the expression.

Contact [7]

Answer:

The simplified answer is $1/(x+1)^{2}$

Step-by-step explanation:

For the given expression: (− 1/x )× 1−x/1+x × x/x^2−1

we need to simplify it

$x^{2} -1$ = (x+1)×(x-1)

eliminating x and x-1 from the given equation we get

$1/(x+1)^{2}$

The value of x can't be zero

As we can't divide zero by zero

The value of x can't be one

As we can't divide zero by zero

The simplified answer is $1/(x+1)^{2}$

4 0

3 years ago