3 years ago

G(x) = (x + 2) d(x) = (x + 2) - 3 Describe the transformation preformed on each function

Mathematics

2 answers:

valkas [14]3 years ago

7 0

Answer:

from g(x) to d(x) we go down by 3

Step-by-step explanation:

Pani-rosa [81]3 years ago

5 0

Answer: A

Step-by-step explanation: Took it on edge goodluck!

You might be interested in

How to Solve -6x+3>21

charle [14.2K]

This is the correct answer

5 0

3 years ago

Read 2 more answers

Which number property supports your answer

lys-0071 [83]

What is the question

5 0

2 years ago

<img src="https://tex.z-dn.net/?f=%5Clarge%5Csf%5Cfbox%5Cred%7BQuestion%3A-%7D" id="TexFormula1" title="\large\sf\fbox\red{Quest

tamaranim1 [39]

Answer:

The function is injective but nor surjective

Step-by-step explanation:

We see that:

f(x) = x³

For any x₁ and x₂ ∈ N,

f(x) = x₁³ = x₂³ ⇒ x₁ = x₂, both are natural numbers

It it confirmed one-to-one, hence it is injective

Check the surjectivity:

f(x) = y ∈ N

x³ = y
y = ∛x

Let y = 2, then:

2 = x³
x = ∛2 ∉ N

Since x is not natural, the function is not surjective

6 0

2 years ago

Read 2 more answers

In how many ways can a quality-control engineer select a sample of3 transistors for testing frm a batch of 100 transistors?

Advocard [28]

Answer:

161700 ways.

Step-by-step explanation:

The order in which the transistors are chosen is not important. This means that we use the combinations formula to solve this question.

Combinations formula:

$C_{n,x}$ is the number of different combinations of x objects from a set of n elements, given by the following formula.

$C_{n,x} = \frac{n!}{x!(n-x)!}$

In this question:

3 transistors from a set of 100. So

$C_{100,3} = \frac{100!}{3!(100-3)!} = 161700$

So 161700 ways.

6 0

3 years ago

Graph the equation by plotting three

tangare [24]

Graph the equation in a graphing calculator or in the table in a regular calculator and look for the zero on the x axis and the y axis

8 0

3 years ago