Answer:
see attached
Step-by-step explanation:
In the attached, the feasible region is white, and all excluded regions are shaded. When there are so many inequalities, it is easier to see the solution (feasible region) this way. The boundary lines are dashed because they are not excluded. That is, each boundary line is part of the feasible region.
The vertices of the feasible region are shown to aid in any optimization you might want to do. We have shown the values that would apply if there were a constraint y ≥ 0, which is not on your list. (We assume pounds of Brussels sprouts will not be negative.)
__
If you actually do the shading required by the problem statement, you will be shading on the opposite side of each of the lines shown, and you would draw the lines as solid.
Hi,
The two numbers should be 12 and 30. 12=2x2x3 while 30=2x3x5.
Their HCF is 2x3=6 and their LCM is 2x3x2x5. Because of their HFC, we know that they are both multiple of 6. Also, the question says they both are GREATER than 6, so they can’t be 6 but are 6 times “something”. Thanks to the LCM, we know that “something” is equal to 2 for the first number and to 5 for the second one, the numbers hence being 12 and 30.
I hope this helps. If I was not clear enough or if you’d like further explanation please let me know. Also, English is not my first language, so I’m sorry for any mistakes.
Answer:
It will take 30 minutes!
Hope this helps! :D
Step-by-step explanation:
This is false for example, the GCF of 13 and 26 is 13, an odd number.
Answer:
The answer is C
Step-by-step explanation:
table with a 10 in radius
