Answer:
composite
prime
composite
composite
composite
Step-by-step explanation:
prime numbers only have two factors
composite numbers have three or more
The assignment problem is some of the significant combinatorial
optimization difficulties in the division of operations research in mathematics.
It contains of looking for a supreme weight matching in a weighted bipartite
graph. The assignment problem constraint means that agent 3 can be assigned
to no more than two tasks.
First, multiply 1/4 by x+3 ⇒(1/4x+3/4). Next, multiply 3 by 1+x ⇒(3+3x). The equation should now look like this: 1/4x+3/4-4x≤3+3x. The next thing you have to do is get all of the x's on one side of the symbol. Subtract 1/4x from both sides, and the equation then looks like this: 3/4-4x≤3+2 3/4x. Add the -4x to both sides, and the equation should look like this: 3/4≤3+6 3/4x. Next, you have to move the 3 to the left side. To do that, subtract it from both sides. The equation then look like this: -2 1/4≤6 3/4x. Then, to get the x alone, you need to divide the coefficient (6 3/4) by -2 1/4, which equals -1/3 or -0.3 repeating. So, -1/3≤x
Answer:
9 in
Step-by-step explanation: