When must an inequality symbol be reversed?
Reverse the inequality symbol when multiplying or dividing both sides by a negative number.
Study 03/14 3. Inequalities with 12 free online flashcards. Review key terms, definitions, and concepts with this interactive flashcard deck.
When must an inequality symbol be reversed?
Reverse the inequality symbol when multiplying or dividing both sides by a negative number.
Solve 4x−7≤9.
The solution is x≤4, which is (−∞,4] in interval notation.
What happens when simplifying removes the variable?
A true statement after simplification gives all real numbers; a false statement gives no solutions, written ∅.
What does “and” mean in a compound inequality?
An “and” compound inequality represents the intersection of its solution sets: values satisfying both conditions.
What does “or” mean in a compound inequality?
An “or” compound inequality represents the union of its solution sets: values satisfying at least one condition.
Solve ∣2x−3∣=7.
Set the expression equal to both 7 and −7: 2x−3=7 or 2x−3=−7. Thus, x=5 or x=−2.
Solve ∣x−4∣≤3.
Rewrite it as −3≤x−4≤3, then solve: 1≤x≤7, or [1,7].
Solve ∣2x+1∣>5.
Rewrite it as 2x+1<−5 or 2x+1>5. The solution is x<−3 or x>2.
What do brackets and parentheses mean in interval notation?
A bracket means the endpoint is included; a parenthesis means the endpoint is excluded.
Why does infinity always have a parenthesis?
Infinity always uses a parenthesis because infinity is not a real number and cannot be included.
How do inequality symbols determine number-line graphs?
Use an open circle for < or >, and a closed circle for ≤ or ≥. Shade the region containing the solutions.
How many notebooks can cost at most $80 after a $20 fee?
Model the cost with 20+6n≤80. Since n counts notebooks, the meaningful solutions are n∈{0,1,2,…,10}.
A progressive guide to interpreting, calculating, and applying limits, asymptotes, continuity, and the Intermediate Value Theorem.
A medium-difficulty quiz on relations, relation properties, equivalence relations, partial orders, functions, injectivity, surjectivity, bijections, and inverse functions. The questions emphasize applying definitions to examples and interpreting mathematical structure.
A progressive guide to converting, graphing, differentiating, and integrating polar curves, with emphasis on symmetry, intersections, area, and arc length.
A 14-question quiz on mathematical induction, strong induction, well-ordering, recursive definitions, and structural induction. Questions progress from introductory recognition to medium-difficulty application and proof reasoning.
A 14-question quiz on sequences, sequence limits, monotonicity, boundedness, convergence criteria, the Squeeze Theorem, limit laws, and recursive sequences. Questions progress from foundational understanding to applied reasoning.
A structured guide to vector spaces, subspaces, spans, independence, bases, dimension, and coordinates, with definitions, tests, examples, and a unified problem-solving workflow.
A medium-difficulty quiz on advanced counting methods, including binomial coefficients, stars and bars, the binomial theorem, inclusion-exclusion, recurrences, tilings, derangements, and characteristic equations.
A progressive guide to choosing and applying binomial coefficients, the binomial theorem, inclusion-exclusion, and recurrence relations in advanced counting problems.
A progressive guide to identifying eigenvalues and eigenvectors, computing eigenspaces, comparing algebraic and geometric multiplicities, and determining when a matrix can be diagonalized.
A progressive guide to representing functions with power and Taylor series, determining convergence, manipulating series, and controlling approximation error.
A medium-difficulty quiz on sequences, summation techniques, recurrence relations, characteristic roots, generating functions, and recursive algorithms. Questions progress from foundational applications to more involved reasoning.
A structured guide to describing sequences, simplifying sums, modeling and solving recurrence relations, using generating functions, and analyzing recursive algorithms.