Long way: try to divide. But we are lazy, so it's no go. Option number one: all rational numbers that could give you a division can be taken from "THE List": you build it by taking the constant term, that is 6, and all its divisors (1,2,3,6), the highest term coefficent, 3 in this case, its divisors (1,3) , and you divide every one in the first list by the second, and adding a in front of them. Our list is: .
Since -3 is part of THE List, it might be a divisor - that system would garantee you that, for example, x-4 would NOT be a factor.
Cheap way. if (x+3) is a factor of g(x), then g(-3) = 0. Let's replace.
Since we didn't get zero, is not a factor of g(x)
Answer:
There are typically 12 decision variables and 7 constraints. ( option A )
Step-by-step explanation:
Given that there are 4 sources and 3 destinations The true statement is :
There are typically 12 decision variables and 7 constraints.
Because : In general linear programming optimization
number of decision variables in transportation = destination * source
= 3 * 4 = 12 variables
number of constraints = destination + sources = 3 + 4 = 7 constraints
Answer:
RT = 23
Step-by-step explanation:
We will have a line that essentially goes like this:
R-----S-----T
The distance from R to S is 12 units.
The distance from S to T is 11 units.
We need to find the distance from R to T.
R is the starting point and T is the ending point.
To find the total distance, we can add both line lengths.
12 + 11 = 23 units
Best of Luck!
I cant help with too much because im 14 and in the 8 th grade but for part c the answer is 200 dollars. If you have 100 bracelets and your selling them for 2 dollars a bracelet the answer will be 200 hundred dollar profit.
hope this helps! :)