PLEASE HELP ASAP 40 PTS + BRAINLIEST TO RIGHT/BEST ANSWER

Mathematics

1 answer:

Volgvan3 years ago

3 0

Answer:

Step-by-step explanation:

2 || 1 - 4 6 - 4

2 -4 4

==================

1 -2 2

x^2 - 2x + 2 with no remainder.

Looks like the answer is B

Note: Note that the two in x - 2 changes sign. That always happens when using synthetic division as long the number in front of the x is positive.

You might be interested in

maximize P=9x+9y Subject to 2x+y is less than or equal to 30 x+2y is less than or equal to 24 x, y is greater than 0 What is the

Inga [223]

Find the intersection point between the 2 restraint equations:
$30 - 2x = 12 - \frac{1}{2} x \\ \frac{3}{2} x = 18 \\ x = 12$

Substitute back in to find y-value:
$y = 30 - 2(12) = 6$

P is maximized at point (12,6)
$P = 9(12)+9(6) = 162$

3 0

3 years ago

What is the graph of y=-(x-2)^3-5

natulia [17]

When x=0,
y=-(0-2)^3-5
y=3

When y=0,
(x-2)^3=5
x-2= +/- 5^1/3
x= +/- 5^1/3 +2
x= 3.70997 or x=0.29002

To find the turning point at y, substitute the information that you have found above.

y=-(3.70997-2)^3-5
y=-9.99994

Find the mid-point next as mid-point is also the turning point.

(3.70997+0.29002)÷2=1.999995

Hence, Turning point is (1.999995, 9.99994)

Plot a graph using turning point, y value and the 2-x values.

6 0

3 years ago

Solve 15 = 0.5 n check the souution

denis23 [38]

N = 30.

0.5(30) = 15

8 0

3 years ago

If the Math Olympiad Club consists of 11 students, how many different teams of 3 students can be formed for competitions?

vivado [14]

Answer:

165 different teams of 3 students can be formed for competitions

Step-by-step explanation:

Combinations of m elements taken from n in n (m≥n) are called all possible groupings that can be made with the m elements so that:

Not all items fit
No matter the order
Elements are not repeated

That is, a combination is an arrangement of elements where the place or position they occupy within the arrangement does not matter. In a combination it is interesting to form groups and their content.

To calculate the number of combinations, the following expression is applied:

$C=\frac{m!}{n!*(m-n)!}$

It indicates the combinations of m objects taken from among n objects, where the term "n!" is called "factorial of n" and is the multiplication of all the numbers that go from "n" to 1.

In this case: