Unfortunately, limitations of the browser used by Answers.com means that we cannot see most symbols. It is therefore impossible to give a proper answer to your question. Please resubmit your question spelling out the symbols as "plus", "minus", "times", "equals", etc. There are no inequalities shown in the question.
Chat with our AI personalities
y > 5x - 2 y < 5x + 3 A.(4, 20) B.(-5, 25) C.(5, 28) D.(4, 23)
Each linear equation is a line that divides the coordinate plane into three regions: one "above" the line, one "below" and the line itself. For a linear inequality, the corresponding equality divides the plane into two, with the line itself belonging to one or the other region depending on the nature of the inequality. A system of linear inequalities may define a polygonal region (a simplex) that satisfies ALL the inequalities. This area, if it exists, is called the feasible region and comprises all possible solutions of the linear inequalities. In linear programming, there will be an objective function which will restrict the feasible region to a vertex or an edge of simplex. There may also be a further constraint - integer programming - where the solution must comprise integers. In this case, the feasible region will comprise all the integer grid-ponits with the simplex.
Infinitely many
Although there is no graph, the number of solutions is 0.
There are infinitely many solutions to 11x - 99 = 11(x - 9)