Busy. Please wait.

show password
Forgot Password?

Don't have an account?  Sign up 

Username is available taken
show password


Make sure to remember your password. If you forget it there is no way for StudyStack to send you a reset link. You would need to create a new account.

By signing up, I agree to StudyStack's Terms of Service and Privacy Policy.

Already a StudyStack user? Log In

Reset Password
Enter the associated with your account, and we'll email you a link to reset your password.

Remove ads
Don't know
remaining cards
To flip the current card, click it or press the Spacebar key.  To move the current card to one of the three colored boxes, click on the box.  You may also press the UP ARROW key to move the card to the "Know" box, the DOWN ARROW key to move the card to the "Don't know" box, or the RIGHT ARROW key to move the card to the Remaining box.  You may also click on the card displayed in any of the three boxes to bring that card back to the center.

Pass complete!

"Know" box contains:
Time elapsed:
restart all cards

Embed Code - If you would like this activity on your web page, copy the script below and paste it into your web page.

  Normal Size     Small Size show me how

c h a p t e r 5


compound sentence A sentence in which two clauses are connected by the word and or by the word or
union the set consisting of those values in either one or both sets.
Addition Property of Inequality If a<b, then a+c < b+c
Multiplication of Properties Inequality If a < b and c > 0, then ac < bc. If a < b and c < 0, then ac > bc.
Linear Combination Method Involves adding multiples of the given equations.
System-Determinant Theorem A 2 X 2 system has exactly one solution if and only if the determinant of the coefficient matrix is NOT zero.
which side is the equation x > 5 shaded It is a dotted line shaded to the right
Feasible Set The set of solutions to a system of linear inequalities
Vertices It is the intersections of the boudaries (lines)
Linear-Programming Theorem The feasible region of every linear-programming problem is convex, and the maximum or minimum quantity is determined at one of the vertices of this feasible region.
Steps to solve a linear-programming problem 1. Identify variables 2. Identify the constraints 3. Graph system; find vertices of feasible set 4. Write a formula or an expression 5. Apply the Linear-Programming Theorem. 6. Interpret the results.
Created by: katelesperance