Every equation so far had one exact answer, the number that makes both sides match. Many questions are not like that. A recipe wants the oven at least degrees, so and work too, and a bridge bars trucks above a posted height, so many heights pass. A statement that compares two amounts instead of setting them equal is an inequality, and its solution is a stretch of the number line. Every balance move from 6.1 through 6.4 works here. Only one rule is new. Multiplying or dividing by a negative flips the sign.
Problem
A solo ride only lets you board if your ticket count is strictly more than , written . The word strictly matters, because holding exactly is not enough, you have to clear the line, not land on it. Five friends hold , , , , and tickets. How many of those counts satisfy ? Type the single number.
Show a hint
- The rule is . Go through the friends one at a time and ask whether each ticket count is bigger than . Watch the friend holding exactly , since does not include itself.
- Mark each value yes or no for . is no, is no because it only ties the line, is yes, is yes, and is yes. Count the yeses.
Show the full solution
Check each count against . is no, is no because it only ties the line, is yes, is yes, and is yes. That is friends. Strict means the boundary is out, so holding exactly tickets fails even though it reaches the number.
Problem
A delivery cart already holds crates, and the running total must stay under , so with more crates the rule is . Solve it the same way as , by subtracting from both sides, with no sign flip for subtraction. The boundary is strict, so a value sitting exactly on it does not count. What is the largest whole number can be?
Show a hint
- Make the first move you would make for an equation. Subtract from both sides to get alone. Adding or subtracting the same amount never flips an inequality, so the sign stays pointing the same way. Then notice the bound is strict, which matters for a whole number answer.
- Subtracting from both sides gives . Since must be strictly less than , the value itself is out. The largest whole number that still fits is the integer just below .
Show the full solution
Subtract from both sides of to get . Subtracting never flips the sign. The bound is strict, so is out and the largest whole number that fits is . Check it, which is under , while is not.
Problem
A diver's gauge reads negatively below the surface. Her reading is , she rises meters to , and the safety check needs the new reading at least , so . Subtract from both sides, and subtracting never flips the sign. Because the sign is , the boundary itself is allowed. What is the smallest value can be?
Show a hint
- Treat the inequality just like an equation for the first move. To get by itself, undo the by subtracting 5 from both sides. You only flip the inequality sign when you multiply or divide both sides by a negative, and subtracting does not do that, so the stays pointing the same way.
- Subtract 5 from both sides of and you get . The sign is , which means itself is allowed, so the gate is closed. The smallest reading that still works is the boundary number .
Show the full solution
Subtract from both sides of to get . Subtracting does not flip the sign. Because the sign is , the boundary is allowed, so the smallest reading she can start from is . The sign only reverses when you multiply or divide both sides by a negative, which never happens here.
Problem
Four identical sandbags sit on a shelf rated for at most kilograms total, so with one bag weighing , the rule is . Solve it like an equation, keeping the inequality sign. Divide both sides by the positive number , which does not flip the sign. The word most means the boundary counts. What is the largest value can be? Give a fraction in lowest terms.
Show a hint
- The bags share the load, so undo the by dividing both sides by . You are dividing by a positive number here, so watch what happens to the inequality sign. When you divide by a positive, the sign keeps pointing the same way, it does not flip.
- Divide both sides of by . The sign stays as , giving . Simplify to lowest terms, and since the bound is "at most" the boundary itself is allowed, so the largest value is that boundary.
Show the full solution
Divide both sides of by , a positive number, so the sign stays put. That gives , which reduces to . At most means the boundary counts, so the heaviest one bag can be is kilograms. If the shelf were rated for under kilograms instead, would be shut out and there would be no largest allowed weight.
Problem
Priya pays a flat booth fee and clears on each eraser she sells, so selling erasers gives a profit of dollars. She wants that profit to be at least , so the goal is . Solve it, dividing by the positive without flipping the sign. What is the fewest whole erasers she must sell to reach her goal?
Show a hint
- Each eraser adds to her profit, but the booth fee gets subtracted once. Start by undoing that subtraction. Add to both sides so the term sits alone, and notice you are only adding and dividing by positive numbers here, so the sign stays pointing the same way the whole time.
- After adding you get . Divide both sides by , a positive number, so no flip, and you land on . Since she cannot sell part of an eraser and is already a whole number that is allowed, the fewest is itself.
Show the full solution
Add to both sides of to get , then divide by , a positive, so no flip. That gives , and is a whole number that is allowed, so she needs erasers. At the profit is dollars, which counts because at least includes hitting the goal exactly.
Problem
Start from a statement nobody would argue with, . Now multiply both sides by , so the becomes and the becomes . On a number line, the one farther left is the smaller, so is now the smaller value. Of the two results and , which one is the larger? Type that value.
Show a hint
- Put and on a number line and remember the rule from earlier chapters. Farther to the left means smaller, farther to the right means larger. Watch what happened to the order. The statement started as , with the left number smaller, but after the move the smaller one is no longer on the left.
- Mark both numbers. is eight steps left of zero, and is only three steps left of zero, so sits to the RIGHT of . The number on the right is the larger one. That is .
Show the full solution
Multiplying by turns the sides into and . On the number line sits farther left, so it is the smaller one, and the larger of the two is . Copying the old direction would give , which is false. That is why multiplying or dividing both sides by a negative flips the sign.
Problem
A freezer alarm trips whenever climbs above , so the danger zone is . To free , divide both sides by , and dividing by a negative flips the to . What is the largest integer can be?
Show a hint
- Get alone by dividing both sides by . The moment you divide by a negative number, something has to happen to the inequality sign. Decide what it becomes before you read off the answer.
- Dividing by flips into , so , which is . The gate at is open, so itself is not allowed. Now name the largest integer that sits strictly to the left of on the number line.
Show the full solution
Divide both sides of by . The divisor is negative, so the sign flips and . The bound is strict, and the largest integer sitting left of is . Check it, is true, while is false.
Problem
This one pulls everything together. The variable appears on both sides and there is a group to clear. Solve by distributing, then gathering the variable, and stay alert because one step divides by a negative and forces the sign to flip. Once you have the range, what is the largest integer can be?
Show a hint
- Start exactly the way you would for an equation. Distribute the across the parentheses to get on the left, then move the variable terms to one side and the numbers to the other. Keep one eye out for a moment where you divide by a negative, since that is the only thing here that behaves differently from an equation.
- After distributing you have . Subtract from both sides to reach , then subtract to get . Now divide both sides by , and because that divisor is negative, FLIP the sign. That gives . The bound is strict, so itself is not allowed. Name the largest whole number that still sits below .
Show the full solution
Distribute the , so becomes . Subtract to get , then subtract to get . Dividing both sides by flips the sign, leaving . The bound is strict, so the largest integer that fits is . At both sides equal , and is false, which is exactly why is shut out.
Problem
Three runners are scored so a bigger number means faster. The sheet gives two facts. Priya beat Quinn, , and Quinn was at least as fast as Rafe, . A teammate scribbles five claims, , , , , and . Using only the two facts and the way inequalities chain when they point the same way, how many of the five claims are forced to be true? Type the single count.
Show a hint
- Line the two facts up so the arrows point the same way, . Anything you can read straight off this chain by following greater-than signs from left to right is forced. Watch the spot where meets , because that link is and not a strict .
- Forced because they read straight off the chain, is given outright, jumps across the whole chain, and is a weaker true statement that already guarantees. Not forced, fails whenever Quinn and Rafe tie since that link is only , and is actually backwards. Count the forced ones.
Show the full solution
Stack the two facts into one chain, . Reading across it, is given outright, follows because the trip across the chain crosses a strict , and follows since it is a weaker claim than . The other two are not forced. fails if Quinn and Rafe tie, since that link is only , and points backwards. That is forced claims. One strict link anywhere makes the whole chain strict, but a chain of all leaves ties possible.
Problem
A compound inequality traps the variable in the middle. Solve . Whatever you do, do it to all three parts at once so the middle stays fenced in on both sides, and remember that dividing by the negative coefficient flips both signs together. Once you have cornered, how many integers make the whole thing true? Type the single count.
Show a hint
- Peel away the constant from all three parts first. Subtract from the left, the middle, and the right, and you should land on . Now you have to divide every part by , and that negative is about to do something to the signs, so stay alert.
- Dividing all three parts by flips BOTH inequality signs, which gives . Read that the tidy way around and it says , closed at and open at . Now just list the integers from up to but not including and count them.
Show the full solution
Subtract from all three parts of to get . Divide every part by , and since is negative both signs flip, giving . Written small to large that is , so the integers are , which is of them. Dividing by a negative also swaps which end is the floor and which is the ceiling, so rewrite the range in increasing order before you count.
Problem
The trickiest one, folding everything together. Solve . The left side has two number pieces sitting apart, so tidy it first, then gather the variables. One move near the end forces the sign to turn around. Once you have the range, what is the largest integer can be?
Show a hint
- Start by combining the two number terms on the left, since is a single value. That turns the left side into . Then gather the variables on one side the same way you did when solving equations. Keep an eye out for the step that might flip the inequality.
- After tidying you have . Add to both sides to get , then add to both sides to get . Now multiply both sides by , and because the multiplier is negative you must reverse the sign, giving . The bound is strict, so itself is not allowed. The largest integer that fits is the whole number just below .
Show the full solution
Combine the numbers on the left, , so the inequality reads . Add to both sides to get , then add to get . Multiplying both sides by flips the sign, leaving . The bound is strict, so the largest integer is . A bare carries a negative coefficient, so clearing it flips the sign just like dividing by would.
Problem
A metal sample starts at degrees Celsius and the cooler pulls it down degrees per minute, so after minutes its temperature is . It freezes only once that drops strictly below , so the condition is . Solve it, remembering that dividing by the negative coefficient flips the sign. What is the fewest whole minutes the lab must wait until it freezes?
Show a hint
- Solve just like a normal equation. Subtract from both sides to get . Now watch closely, because your next move divides both sides by a negative number, and that does something to the inequality sign.
- Divide both sides by . Dividing by a negative flips the sign, so turns into . The bound is strict, so does not count. Check it. At minutes the temperature is exactly , which is not below the line yet, and at minutes it is , which finally is. So the answer is the first whole number bigger than .
Show the full solution
Subtract from both sides of to get . Divide by , and the negative divisor flips the sign, giving . The bound is strict, so the lab waits minutes. At minutes the sample is at exactly , which is not yet below the line, and at minutes it is .
Practice these ideas
Practice
A rewards account stays open as long as its balance satisfies , since a small overdraft is forgiven. Five accounts have balances , , , , and . How many satisfy ?
Show the solution
Check each balance against . fails, passes, and , , and all pass. That is accounts. The equals half of is what saves the account sitting exactly at .
Practice
A scanner keeps a reading only when and tosses anything that hits or passes the threshold, so the strict sign leaves the boundary out. One shift gives , , , , and . How many readings does the scanner keep?
Show the solution
Test each reading against . is kept, is not since is false, is kept, is not, and is kept. That is readings. A strict less-than never lets a value equal the boundary, so the reading of exactly goes out.
Practice
A ferry deck already holds crates, and loading more must keep the total under , so . Solve it. What is the largest integer number of extra crates can be?
Show the solution
Subtract from both sides of to get . Subtracting does not flip the sign. The bound is strict, so the largest whole number of extra crates is . Eleven brings the deck to , while would hit exactly, which the rule does not allow.
Practice
A pilot's dial setting must satisfy . Add to both sides, with no flip for addition. Because the sign is , the boundary is allowed. What is the smallest value can be?
Show the solution
Add to both sides of to get . Adding never flips the sign. The lets equal the boundary, so the smallest setting is .
Practice
A garden permit allows at most liters, and each visit takes liters, so over visits the rule is . Divide both sides by the positive , no flip. The word most means the boundary counts. What is the largest value can be? Give a fraction in lowest terms.
Show the solution
Divide both sides of by , a positive, so no flip. That gives , and at most means the boundary counts, so the largest is . At the water used is exactly liters, right on the permit limit.
Practice
Cookie packs cost each, and Priya wants to spend strictly more than to clear a free-shipping bar, so . Solve it. The strict sign means itself does not count. What is the smallest integer number of packs she can buy?
Show the solution
Divide both sides of by , a positive, so the sign stays put. That gives , about , and the first whole number above it is . Seven packs cost , which does not clear , so rounding down would miss the bar.
Practice
A deep-sea sensor's reading must satisfy . Divide both sides by and flip the sign because the divisor is negative. What is the smallest integer can be?
Show the solution
Divide both sides of by , and the negative divisor flips the sign, giving . The bound is strict, so is out and the smallest integer allowed is . Check it, is true, while is false.
Practice
A frost alarm trips whenever , where is a temperature that runs colder as it drops. Solve it, dividing by and flipping the sign. What is the largest integer value can be?
Show the solution
Divide both sides of by , and the negative divisor flips the sign, giving , which is . Walking left from , the first integer is . It is tempting to grab , but is greater than , so it misses the bound.
Practice
A vending machine credits Mara once it counts more than tokens past a deposit, and cups give such tokens, so she needs . Add , then divide by the positive , no flip. What is the smallest integer number of cups she can buy?
Show the solution
Add to both sides of to get , then divide by , a positive, so no flip. That gives , and since the bound is strict the smallest whole number is . Six cups land on exactly tokens, which is not more than .
Practice
A drone starts at a battery reading of and the lamp drains per minute, so after minutes the reading is , and the pilot keeps it on while . Subtract , then divide by and flip the sign. What is the largest value can be?
Show the solution
Subtract from both sides of to get . Divide by , and the negative divisor flips into , giving . The boundary is included, so the largest value is . At the reading is exactly , which the rule still allows, and at it drops to .
Practice
One battery mode reads and another reads after minutes, and the first beats the second when . Gather the variable, then divide by a negative and flip the sign. What is the largest integer can be?
Show the solution
Subtract from both sides of to get , then subtract to get . Divide by , which flips the sign, leaving . The bound is strict, so the largest integer is . At the two readings tie at , and a tie is not a win.
Practice
A batch of panels uses ounces of grout because the first panels are scrapped, and the bucket holds ounces, so . Distribute, then solve, dividing by the positive with no flip. What is the largest value can be?
Show the solution
Distribute to get , add for , then divide by , a positive, so no flip. That gives , and the bound is closed, so the largest is . At the grout used is ounces, exactly the bucket, and needs .
Practice
A ferry logs every stop that is at least and strictly west of , so . The left end is closed, so counts, and the right end is open, so does not. How many integer positions get logged?
Show the solution
Since is included and is not, the logged integers run . That is positions. Counting is faster as steps plus one for the endpoint you started on.
Practice
A candle stands cm tall and burns down cm each hour, so after hours its height is , and it must stay at least cm tall to sit in its holder, giving . Dividing by flips the sign. What is the most whole hours the candle can burn?
Show the solution
Subtract from both sides of to get . Divide by , and the negative divisor flips into , giving . The boundary counts, so the candle can burn whole hours. At hours it stands exactly cm tall, which still sits in the holder, and at it is down to cm.
QuanticaPrealgebraOpen in the course