Which function rule would help you find the values in the table

Mathematics

1 answer:

Svetllana [295]2 years ago

8 0

It would be K = -6j . I hope this helped you!

You might be interested in

In a class of 40 students, the number of girls is 10 more than the number of boys. We have to find the number of girls and the n

Nadusha1986 [10]

Answer:

b=15 g=25

Step-by-step explanation:

lets translate that story problem to mathematics equations

the problem told that no. of girls are 10 more than no of boys so this will =

g=b+10

then in class there are 40 students that means

g+b=40

now we have to equations with two variables then we should substitute

(b+10)+b=40

lets remove the brackets

2b+10=40 subtract 10 from both sides

2b=30 now divide both by 2

b=15 so g=25 after you write the equation once again with the new proof or number

6 0

2 years ago

What point in the feasible region maximizes the objective function, 3x + y ≤ 12, x+y ≤5, x ≥0,y ≥0

forsale [732]

Step-by-step explanation:

We have to find the point in the feasible region which maximizes the objective function. To find that point first we need to graph the given inequalities to find the feasible region.

Steps to graph 3x + y ≤ 12:

First we graph 3x + y = 12 then shade the graph for ≤.

plug any value of x say x=0 and x=2 into 3x + y = 12 to find points.

plug x=0

3x + y = 12

3(0) + y = 12

0 + y = 12

y = 12

Hence first point is (0,12)

Similarly plugging x=2 will give y=6

Hence second point is (2,6)

Now graph both points and joint them by a straight line.

test for shading.

plug any test point which is not on the graph of line like (0,0) into original inequality 3x + y ≤ 12:

3(0) + (0) ≤ 12

0 + 0 ≤ 12

0 ≤ 12

Which is true so shading will be in the direction of test point (0,0)

We can repeat same procedure to graph other inequalities.

From graph we see that ABCD is feasible region whose corner points will result into maximum or minimu for objective function.

Since objective function is not given in the question so i will explain the process.

To find the maximum value of objective function we plug each corner point of feasible region into objective function. Whichever point gives maximum value will be the answer