The answer is
8x^4-10x^3-3x^2
Y = -2x + 5 y =3x - 2
Since both equations are equal to 'y' you can set them equal to each other to solve.
-2x + 5 = 3x - 2 Subtract 3x from both sides
-5x + 5 = -2 Subtract 5 from both sides
-5x = -7 Divide -5 on both sides
x = 7/5
Plug 7/5 back in for x and solve for y.
y = -2(7/5) + 5
y = (-14/5) + (25/5)
y = 11/5
(7/5, 11/5) OR (1.4, 2.2)
Answer:
The members of the cabinet can be appointed in 121,080,960 different ways.
Step-by-step explanation:
The rank is important(matters), which means that the order in which the candidates are chosen is important. That is, if we exchange the position of two candidates, it is a new outcome. So we use the permutations formula to solve this quesiton.
Permutations formula:
The number of possible permutations of x elements from a set of n elements is given by the following formula:

If there are 14 eligible candidates for these positions (where rank matters), how many different ways can the members of the cabinet be appointed?
Permutations of 8 from a set of 14. So

The members of the cabinet can be appointed in 121,080,960 different ways.
Answer:
The first one is x=2 and the second one is x=2/5 or 0.4
Step-by-step explanation:
Answer:
Property of equality division
Step-by-step explanation:
Given
c = d
b ≠ 0 then c∕b = d∕b
Required
State the property used
From list of options a through d, only option A best fits the description.
This is so because property of equality division is such that
given two variables c and d where c = d

Provided that b ≠ 0
Take for instance;
b = 2; c = 8 and d = 8;
This implies that


Divide both sides by 2 (assumed value of b)

