![\begin{cases} 4x+3y=-8\\\\ -8x-6y=16 \end{cases}~\hspace{10em} \begin{array}{|c|ll} \cline{1-1} slope-intercept~form\\ \cline{1-1} \\ y=\underset{y-intercept}{\stackrel{slope\qquad }{\stackrel{\downarrow }{m}x+\underset{\uparrow }{b}}} \\\\ \cline{1-1} \end{array} \\\\[-0.35em] ~\dotfill](https://tex.z-dn.net/?f=%5Cbegin%7Bcases%7D%204x%2B3y%3D-8%5C%5C%5C%5C%20-8x-6y%3D16%20%5Cend%7Bcases%7D~%5Chspace%7B10em%7D%20%5Cbegin%7Barray%7D%7B%7Cc%7Cll%7D%20%5Ccline%7B1-1%7D%20slope-intercept~form%5C%5C%20%5Ccline%7B1-1%7D%20%5C%5C%20y%3D%5Cunderset%7By-intercept%7D%7B%5Cstackrel%7Bslope%5Cqquad%20%7D%7B%5Cstackrel%7B%5Cdownarrow%20%7D%7Bm%7Dx%2B%5Cunderset%7B%5Cuparrow%20%7D%7Bb%7D%7D%7D%20%5C%5C%5C%5C%20%5Ccline%7B1-1%7D%20%5Cend%7Barray%7D%20%5C%5C%5C%5C%5B-0.35em%5D%20~%5Cdotfill)
![4x+3y=-8\implies 3y=-4x-8\implies y=\cfrac{-4x-8}{3}\implies y=\stackrel{\stackrel{m}{\downarrow }}{-\cfrac{4}{3}} x-\cfrac{8}{3} \\\\[-0.35em] ~\dotfill\\\\ -8x-6y=16\implies -6y=8x+16\implies y=\cfrac{8x+16}{-6} \\\\\\ y=\cfrac{8}{-6}x+\cfrac{16}{-6}\implies y=\stackrel{\stackrel{m}{\downarrow }}{-\cfrac{4}{3}} x-\cfrac{8}{3}](https://tex.z-dn.net/?f=4x%2B3y%3D-8%5Cimplies%203y%3D-4x-8%5Cimplies%20y%3D%5Ccfrac%7B-4x-8%7D%7B3%7D%5Cimplies%20y%3D%5Cstackrel%7B%5Cstackrel%7Bm%7D%7B%5Cdownarrow%20%7D%7D%7B-%5Ccfrac%7B4%7D%7B3%7D%7D%20x-%5Ccfrac%7B8%7D%7B3%7D%20%5C%5C%5C%5C%5B-0.35em%5D%20~%5Cdotfill%5C%5C%5C%5C%20-8x-6y%3D16%5Cimplies%20-6y%3D8x%2B16%5Cimplies%20y%3D%5Ccfrac%7B8x%2B16%7D%7B-6%7D%20%5C%5C%5C%5C%5C%5C%20y%3D%5Ccfrac%7B8%7D%7B-6%7Dx%2B%5Ccfrac%7B16%7D%7B-6%7D%5Cimplies%20y%3D%5Cstackrel%7B%5Cstackrel%7Bm%7D%7B%5Cdownarrow%20%7D%7D%7B-%5Ccfrac%7B4%7D%7B3%7D%7D%20x-%5Ccfrac%7B8%7D%7B3%7D)
one simple way to tell if both equations do ever meet or have a solution is by checking their slope, notice in this case the slopes are the same for both, meaning the lines are parallel lines, however, notice both equations are really the same, namely the 2nd equation is really the 1st one in disguise.
since both equations are equal, their graph will be of one line pancaked on top of the other, and the solutions is where they meet, hell, they meet everywhere since one is on top of the other, so infinitely many solutions.
Answer:
(3, 0).
Step-by-step explanation:
dentifying the vertices of the feasible region. Graphing is often a good way to do it, or you can solve the equations pairwise to identify the x- and y-values that are at the limits of the region.
In the attached graph, the solution spaces of the last two constraints are shown in red and blue, and their overlap is shown in purple. Hence the vertices of the feasible region are the vertices of the purple area: (0, 0), (0, 1), (1.5, 1.5), and (3, 0).
The signs of the variables in the contraint function (+ for x, - for y) tell you that to maximize C, you want to make y as small as possible, while making x as large as possible at the same time.
Hence, The Answer is ( 3, 0)
Exact form: 3336711069/389
Decimal form: 8577663.42 (rounded)
Mixed number form: 8577663 & 162/389
Answer:
B.
(3x + 4)(x − 7)
Step-by-step explanation:
If you multiply.
3x2-21x+4x-28
3X2-17x-28
Answer:
Number of large boxes: 55
Number of small boxes:65
Step-by-step explanation:
Let be "l" the number of large boxes and "s" the number of small boxes.
Set up a system of equations:
Use the methof of elimination. Mulitply the first equation by -60 and add both equations. Then solve for "s":
Substitute s=65 into any of the original equations and solve for "l":
