Find your next learning step
Choose the question closest to what you need today, or read the guide from the beginning.
“At most six” allows six. “Less than six” does not. The first condition is x ≤ 6, while the second is x < 6. The small horizontal stroke under the inequality sign carries the equality case, so it can change which answer is permitted even when the boundary number stays the same.
For a whole-number count, at most six allows a maximum of six, while less than six allows a maximum of five. For a real-valued measurement, less than six allows values such as 5.9 and 5.99, so there is no greatest allowed real value below six unless further restrictions are given.
This guide turns the wording into clear conditions, then shows how to solve and interpret them through original examples. It is useful across G1, G2 and G3, with algebraic and graphical sections to be chosen according to your school’s current scope. The aim is to preserve the question’s boundary condition through every step.
Contents
Sections 1–5
Sections 6–10
Sections 11–15
Sections 16–20
Sections 21–25
Sections 26–30
Sections 31–33
Use ≤ for at most or no more than. Use ≥ for at least or no less than. Use < for less than and > for more than. If the wording is ambiguous, clarify the intended condition rather than infer it from an attractive calculation.
Suppose a fictional budget is at most $52, with a fixed $10 fee and $6 per item. The condition is 10 + 6n ≤ 52. Solving gives n ≤ 7, so seven items is permitted. If the total must be less than $52, use a strict inequality and obtain n < 7, allowing at most six whole items.
Before reporting a final count, apply the variable’s domain: n may need to be a nonnegative integer. Before reporting a measurement range, keep the endpoint symbols. Finally test the boundary in the original condition to confirm whether equality is accepted. The symbol records meaning, not a stylistic preference.
“At most six” means six is an upper limit that may be reached. Values above six fail, while values equal to six or below it satisfy the numerical comparison. The phrase does not mean exactly six, nor does it require the answer to be as close to six as possible.
For a count of participants, additional context normally rules out negative and fractional counts. The inequality alone x ≤ 6 would include negative real values, but the contextual domain narrows it. Keep the comparison and the domain as two connected pieces of the model.
Try one boundary test before writing a formula. Ask, “Would exactly six satisfy the words at most six?” The answer is yes. That immediately tells you the equality stroke belongs. This small language check can prevent a correct later calculation from answering the wrong condition.
“Less than six” requires a value strictly below six. Exactly six fails. The symbol is x < 6. If x counts whole items and cannot be negative, the permitted values are zero through five. If x is a real measurement, many fractional values below six are also possible.
The boundary number is still six even though six is excluded. A boundary separates allowed and disallowed values; it need not itself be an allowed value. This distinction is also useful in rounding intervals and graph shading, where an excluded endpoint can remain the correct limiting boundary.
Do not replace a strict real condition with x ≤ 5 merely because five is the largest allowed integer. That would discard permitted values such as 5.5. Apply integer restrictions only when the variable genuinely represents a whole-number count or the question explicitly imposes that domain.
“At least six” permits six and anything larger, giving x ≥ 6. “More than six” excludes six and gives x > 6. The equality question is the same as for upper limits, but the permitted direction is now upward rather than downward.
For a whole-number count, at least six has smallest permitted value six, while more than six has smallest permitted value seven. For a real quantity, more than six includes 6.1 and 6.001. It has a lower boundary of six without a smallest allowed real value.
Ask two separate questions: which side of the boundary is allowed, and is the boundary itself included? These decide the inequality symbol completely. A student who remembers only the arrow’s visual direction may still lose the equality case, so both decisions need to remain visible.
“No more than six” means the value does not exceed six, so it is the same upper-inclusive condition as at most six. “No less than six” means it is not below six, so it is the same lower-inclusive condition as at least six.
Words containing a negative can feel harder to read, but a boundary example helps. Exactly six is not more than six and is not less than six. Therefore both phrases allow equality, with the permitted side determined by which comparison is being ruled out.
Avoid relying on one isolated keyword such as more. The phrase “no more than” has a different meaning from “more than”. Read the whole condition before selecting the symbol. Mathematical translation is about preserving the complete sentence rather than matching one word to a memorised sign.
A fictional activity charges a fixed $10 fee and $6 for each identical pack. The total budget is at most $52. Let n be the number of packs, with n a nonnegative integer. The total cost is 10 + 6n dollars, so the condition is 10 + 6n ≤ 52.
Subtract ten from both sides: 6n ≤ 42. Divide by positive six: n ≤ 7. The domain permits whole counts zero through seven, so the maximum number of packs is seven. At n = 7, the cost is exactly $52, which the wording allows.
Check the next integer, eight: the cost would be $58, exceeding the budget. This confirms the practical maximum under the model. The fixed fee is paid once, while the per-pack amount depends on n. Omitting the fixed fee would solve a different spending condition even if the inequality symbol were correct.
The table uses a boundary of six and a whole-number count that must be nonnegative. The real-number inequalities remain valid more broadly; the final column additionally applies the counting domain. This separates translating the words from interpreting what kind of values the variable may take.
| Wording | Inequality | Boundary included? | Consequence for a nonnegative integer count |
|---|---|---|---|
| At most six | n ≤ 6 | Yes | Maximum is 6 |
| Less than six | n < 6 | No | Maximum is 5 |
| At least six | n ≥ 6 | Yes | Minimum is 6 |
| More than six | n > 6 | No | Minimum is 7 |
If you are unsure about a row, test six itself. Then test one value on either side. Those tests clarify the intended direction and membership, while the algebraic statement describes the complete range. The table is a compact reference, not a replacement for reading the variable’s meaning.
Return to the fictional charge 10 + 6n. If the total must be less than $52 rather than at most $52, the condition is 10 + 6n < 52. Subtract ten and divide by six to obtain n < 7. The greatest allowed nonnegative integer is six.
At six packs the cost is $46, which is below $52. At seven packs the cost is exactly $52 and therefore fails the strict condition. The arithmetic boundary did not change, but its inclusion did. A small wording change has a clear practical effect on the permitted count.
This example is useful because every other feature stays fixed. Comparing unrelated questions with different fees and prices can hide the role of the boundary word. A controlled pair makes the mathematical difference visible and gives the learner a reason to preserve the equality stroke carefully.
Suppose the same model instead has a budget boundary of $50. The inclusive condition gives 10 + 6n ≤ 50, so n ≤ 20/3. The strict condition gives n < 20/3. Both allow a maximum whole-number count of six because twenty thirds lies between six and seven.
The conditions are still different for real n. The inclusive version permits exactly twenty thirds, while the strict version does not. Their agreement after restricting to integers does not make the original inequalities equivalent over all real values. The domain can hide a boundary difference in the final count.
Do not conclude that strictness never matters because one example gives the same integer answer. Check whether the algebraic boundary is itself an allowed integer. If it is, including or excluding it can change the maximum or minimum. If it is not, the nearest permitted integer may be unchanged.
For x ≤ 6, mark a filled point at six and show the permitted side extending left. The filled point includes the endpoint. For x < 6, use an open point at six with the same leftward direction. The direction agrees while the boundary marker differs.
For x ≥ 6 or x > 6, extend the permitted side to the right, again choosing a filled or open point according to whether equality is allowed. The number line represents both the range and the boundary membership. An isolated point would describe only one value, not the whole inequality solution set.
If the variable is restricted to integers, a diagram may show permitted discrete points instead of a continuous shaded ray, according to the question. Keep the representation consistent with the domain. A continuous number line and an integer list can describe related conditions without being identical sets.
Suppose solving gives x ≤ 4 from 3x + 2 ≤ 14. Substitute x = 4 into the original left side: 3 × 4 + 2 = 14. Equality holds, and the original symbol permits it, so the boundary belongs. A value of five gives seventeen and fails.
If the original condition were 3x + 2 < 14, the same boundary calculation gives equality, which is now not permitted. Therefore x < 4. The algebraic boundary is found by the equality case, while the original strictness determines whether that boundary is included.
The boundary test is a useful verification, but one or two tested values alone do not prove the complete solution range. The valid inequality transformations establish the whole set. The tests help catch a copied symbol, a reversed direction or an endpoint error in the final interpretation.
From 2x + 5 ≤ 17, subtract five from both sides to obtain 2x ≤ 12. Dividing by positive two gives x ≤ 6. The inclusive symbol remains inclusive throughout. These reversible order-preserving operations do not remove the equality case.
For the strict version 2x + 5 < 17, the same operations give x < 6. The strict symbol remains strict. Do not add an equality stroke simply because division produces a whole-number boundary. The numerical form of the answer does not decide which inputs were allowed by the original comparison.
Keep the inequality symbol aligned on successive working lines if that helps. It is part of the mathematical information being transformed, just like coefficients and constants. A copied change from < to ≤ can alter the solution even when every arithmetic operation is otherwise correct.
SECTION 13 OF 33
12. Negative multiplication reverses direction, not strictness type
Solve −2x ≤ 8. Divide by negative two and reverse the comparison direction, giving x ≥ −4. Equality is still permitted. At x = −4, the original left side is eight, matching the inclusive upper bound. At x = −5, the left side is ten and fails.
For −2x < 8, division gives x > −4. The direction reverses, but the strict inequality remains strict. Reversing order is different from changing whether equality belongs. Both decisions must be preserved correctly when a negative multiplier or divisor is involved.
The series guide on swapping inequality sides develops another nearby distinction. Swapping the written sides also changes the displayed direction so the same comparison is expressed. Adding or subtracting a term, multiplying by a negative and switching notation are different moves; explain the actual operation rather than applying a general sign-flip slogan.
The statement 6 ≥ x means the same as x ≤ 6. Six is at least as large as x, so x is at most six. The variable need not appear on the left for the condition to be meaningful. Read the relationship rather than assuming the opening symbol tells you the allowed direction.
Similarly, 6 > x means x < 6, while 6 ≤ x means x ≥ 6. Rewriting in a familiar variable-left form can make interpretation easier, but the new symbol must express the same order between the same quantities. No value has been negated during this rewrite.
Use a numerical test if uncertain. Let x = 5 in 6 > x: the statement is true. The equivalent variable-left statement must also allow five. That helps reject an accidental rewrite as x > 6, which would describe the opposite side of the boundary.
A fictional collection already contains eighteen tokens and gains four tokens for each completed round. At least fifty tokens are needed for a stated target. Let r be a nonnegative integer number of rounds. The condition is 18 + 4r ≥ 50.
Subtract eighteen to get 4r ≥ 32, then divide by four to obtain r ≥ 8. The smallest permitted count is eight rounds. At eight, the total is exactly fifty, so it meets the inclusive target. At seven, the total is forty-six and fails.
If the condition instead required more than fifty tokens, the solution would be r > 8, so at least nine whole rounds would be needed. The same boundary-value distinction appears in a minimum problem as in the earlier maximum budget problem. Identify the allowed side and equality case before interpreting the integer answer.
Question A: write an inequality for a real value at most nine. Question B: write one for a real value less than nine. Question C: a nonnegative integer count is more than four. State its smallest value. Question D: a count is no less than four. State its smallest value.
Question E: a fictional cost is $7 per item plus a fixed $5 fee. The budget is at most $40. Find the maximum whole-number item count. Question F: repeat E if the total must be less than $40. Question G: solve 3x + 1 ≥ 16 and check the boundary.
Question H: explain why x < 9 cannot be replaced by x ≤ 8 for all real x. Supply one real value that satisfies the first but fails the second. Your example should show how the domain matters, rather than merely repeat the two symbols in words.
For A, x ≤ 9. For B, x < 9. For C, the smallest whole count above four is five. For D, the smallest is four because no less than includes equality. These conclusions concern the stated integer domain; a real value greater than four need not be at least five.
For E, 5 + 7n ≤ 40 gives 7n ≤ 35 and n ≤ 5. Five items costs exactly $40 and is allowed. For F, n < 5, so the maximum whole count is four, costing $33. For G, 3x ≥ 15 gives x ≥ 5; at five, the left side equals sixteen and satisfies the inclusive condition.
For H, x = 8.5 is below nine but not at most eight. The real interval contains values between consecutive integers. A whole-count interpretation may remove them, but that restriction must be stated. Do not impose it merely because the boundary number happens to be an integer.
If a measurement must be at least three and less than eight, both conditions must hold. Write 3 ≤ x < 8. Three is included, eight is excluded, and every permitted real value lies between those boundaries. The mixed endpoint symbols express two different membership decisions.
For an integer count under the same condition, the permitted values are three, four, five, six and seven. The combined notation describes the full interval before the integer domain is applied. A list is useful when the permitted count set is short enough to inspect clearly.
Do not replace “and” with “or”. A value satisfying x ≥ 3 or x < 8 would include every real number, because every real value satisfies at least one of those comparisons. The relationship between conditions matters as much as each individual boundary symbol.
Suppose a real value must be less than two or at least seven. The solution consists of values below two together with values from seven upward. The middle interval from two to seven is not permitted, except that seven itself belongs to the second region.
A compact chained inequality such as 2 < x ≥ 7 would not communicate that union correctly. Use separate inequalities joined by or, or a clearly labelled number-line representation. Chained notation normally describes simultaneous comparisons, so it should not be forced onto a choice between separated regions.
This extension is useful after the basic phrase translations are secure. Begin by checking a few representative values from each region and the gap, then justify the full set from the stated conditions. A clear reading of and versus or prevents a familiar boundary rule from being attached to the wrong logical combination.
For 0 ≤ x < 6 over the real numbers, there is no greatest permitted value. Any proposed x below six can be exceeded by the midpoint between x and six, which is still below six. The boundary is an upper limit without being an attained largest value.
If x is restricted to tenths, the greatest permitted value is 5.9. If x is restricted to hundredths, it is 5.99. These conclusions use extra grid restrictions. They are not answers to the unrestricted real-number maximum question, because 5.999 would exceed both while still being less than six.
This distinction helps interpret wording such as greatest possible value or upper bound. A question may use one term in a particular school convention, but the mathematical membership should remain clear. State the domain and whether the boundary can be attained instead of inventing a final decimal digit where none is specified.
Suppose a model gives n ≥ 17/4, with n a whole-number count. Seventeen quarters is 4.25, so the smallest permitted integer is five. Ordinary rounding to the nearest integer would give four, which fails the inequality. The direction of the condition decides the practical adjustment.
For n ≤ 17/4, the largest permitted integer is four. For n > 4, the smallest integer is five, while n ≥ 4 permits four. Read both the boundary value and its inclusion before selecting a whole count. There is no universal instruction to round every inequality answer upward.
Check the chosen integer in the original model, and test the neighbouring integer when establishing a minimum or maximum. This verifies the contextual decision after the algebra. It connects with capacity problems where fractional calculated resources need whole units, but the permitted direction still comes from the stated condition.
“At most fifty” is incomplete if the quantity is not identified. Fifty dollars, fifty minutes and fifty participants describe different limits. A variable definition such as t is duration in minutes gives the inequality t ≤ 50 a clear meaning and tells you whether fractions are sensible.
If a rate formula uses hours, convert a fifty-minute limit to 5/6 hour before combining it with that rate. Do not place fifty into an hour-based expression without conversion merely because the inequality wording was translated correctly. Boundary language and unit compatibility are separate conditions that must both survive.
Similarly, a percentage limit needs its reference amount. At most twenty per cent of a starting total is a different bound from twenty per cent of a remaining balance. Name the base before forming the numerical expression, then apply the inclusive or strict comparison required by the wording.
In a coordinate graph, y ≤ 2x + 1 permits points on the line y = 2x + 1 and on the appropriate side below it. The inclusive comparison means the boundary line belongs. The strict version y < 2x + 1 excludes the line while allowing the same side.
A solid boundary is commonly used for inclusive inequalities and a dashed boundary for strict ones, following the question’s graphing convention. Test a convenient point off the line to identify the permitted region. The boundary style and the shaded side encode different pieces of the condition.
This is the two-dimensional extension of the number-line decisions: which side is allowed, and does equality belong? Use it only when coordinate inequalities are within your current scope. The underlying logic is already present in at most and less than, even though the permitted objects are now coordinate pairs rather than single numbers.
Suppose a strict model requires x < 6, and a calculated value displays as 6.00 after rounding. The display alone may not tell you whether the underlying value is 5.999, exactly six or slightly above six. The boundary decision needs sufficient precision or exact reasoning.
If the original calculation is exact and gives six, it fails the strict condition. If an exact fraction is below six, keep that relationship rather than replacing it with a rounded equality. A finite display can hide which side of a boundary the value occupies.
This connects to the series guides on rounding and exact answers. Do not let a reporting format decide a membership question when it has discarded the necessary information. Use the exact expression or a justified bound, then round the final reported quantity as the task requests.
If a student translates at most as <, ask whether exactly the stated limit should be allowed. If they choose the correct symbol but report one less than an inclusive integer boundary, test that boundary in the original condition. The algebra may be correct while the final contextual interpretation is incomplete.
If the student replaces a real interval with an integer list, inspect the variable definition. If they reverse direction after adding a positive number, inspect the operation they think requires a reversal. If they lose the equality stroke during negative division, separate direction reversal from strictness.
A useful correction names the exact lost condition: “the budget allows equality”, “n is a whole count”, or “division by a negative reverses order but keeps equality permitted”. Such notes make the next checking action visible and avoid treating every inequality error as one vague difficulty with symbols.
Take one simple expression, such as 5 + 7n, and compare at most forty with less than forty. Then change the boundary to thirty-nine and compare again. Explain when the integer maximum changes and when it stays the same. This isolates the interaction between strictness and an integer boundary.
Next use a real measurement rather than a count. Ask for examples between consecutive integers that satisfy the strict condition. Then switch from an upper limit to a lower limit. The learner must preserve both the permitted direction and the boundary membership rather than memorise one visual sign pattern.
Finally include one negative coefficient and one compound interval. Keep the numbers manageable so that the main challenge remains reading and preserving conditions. A small set with deliberate contrasts often reveals understanding more clearly than a large set in which every question uses the same inequality symbol.
The broader inequality representation guide connects symbols with boundaries and permitted regions. The inequalities mastery guide develops order reasoning. Choose the route matching the first unclear step in your own solution.
Return to the Mathematics learning hub for the series on inequality transformations, simultaneous conditions, capacity rounding and exact-answer interpretation. Those topics share a habit of preserving which values are allowed, even when the calculation changes form or the final answer must be a whole count.
Families considering support can read the Secondary 1 Mathematics Clementi tutorial page for the teaching approach. A useful immediate checkpoint is whether a learner can explain why the boundary belongs in one question and fails in a nearby strict version, then verify the practical answer in context.
Question I: solve −3x ≤ 12. Question J: solve −3x < 12. Question K: list the integers satisfying 2 ≤ n < 7. Question L: a fictional target requires 11 + 5r ≥ 34, with r a nonnegative integer. Find the minimum rounds and check it.
Question M: explain whether a greatest real value exists for x < 4. Question N: find the greatest allowed value if x is additionally restricted to hundredths and is below four. Question O: rewrite 9 ≥ x with the variable on the left.
For I, x ≥ −4. For J, x > −4. For K, the values are two through six. For L, r ≥ 23/5 = 4.6, so five rounds is the minimum; it gives thirty-six, while four gives thirty-one. For M, no greatest real value exists. For N, the greatest permitted hundredth is 3.99. For O, x ≤ 9.
The inequality n ≤ 7 describes many permitted values in its domain. If the question asks for the maximum nonnegative integer n, the final answer is seven. If it asks for all permitted counts, give zero through seven or an equivalent integer-domain statement. The requested object decides how much of the set to report.
Do not stop at one valid value when asked for a maximum. Six may satisfy n ≤ 7, but it is not the greatest permitted count. Conversely, do not report only seven when asked to describe the full real solution set, which contains infinitely many smaller values.
Read the command after solving. Find a possible value, list the integers, state the range and find the maximum are different tasks. The same correctly solved inequality can support all of them, but the final sentence must answer the particular request rather than whichever form is most familiar.
A count of purchased items may allow zero mathematically, but a fictional offer might require at least one item before a fixed fee model applies. If so, the domain is n ≥ 1 rather than n ≥ 0. The upper budget inequality alone does not determine that lower condition.
Likewise, a number of completed rounds can begin at zero, while a positive length cannot equal zero if it is a side of a nondegenerate rectangle. Read the quantity and stated assumptions. Do not add or remove zero from a solution set by habit.
For the worked budget, the nonnegative-integer model was explicitly stated, so zero through seven is a coherent permitted set. A different context could restrict it further without changing the algebraic upper bound. Domain interpretation and inequality solving work together, and neither should silently replace the other.
For the inclusive budget example, say: “The model gives n ≤ 7, and n is a whole-number count, so at most seven packs can be bought; seven costs exactly $52 and is allowed.” The sentence links algebra, domain and boundary membership without repeating the entire solution.
For the strict version, say that seven reaches the excluded boundary, so the maximum whole count is six. For a real-valued strict interval, preserve the open endpoint rather than inventing a greatest decimal. For a lower integer bound, explain why the next whole number is needed when the calculated boundary is fractional.
These explanations are short but make the decisive reasoning visible. They also help you locate a mistake later: was the expression formed incorrectly, was the inequality transformed incorrectly, or was the permitted set interpreted incorrectly? A clear final sentence gives you another way to inspect the answer’s meaning.
Suppose a fictional task allows at most six items in total, divided between two types with counts a and b. The condition is a + b ≤ 6, with the counts also nonnegative integers. Writing a ≤ 6 and b ≤ 6 separately is not sufficient to express the combined limit: a = 6 and b = 6 satisfy those separate bounds but give twelve items altogether.
The boundary word was translated correctly in each separate comparison, yet its scope was changed. The phrase applies to the combined total, not independently to each category. Define that total before attaching the inequality. This is the same grouping habit used when a fixed fee and several item costs form one budget expression.
If the instruction instead permits at most six of each type, the separate conditions are appropriate and the combined count could reach twelve. The two statements describe different rules. A clear variable definition and a short sentence identifying the limited quantity help prevent the difference from disappearing behind familiar symbols. After solving, test a boundary assignment in the original wording, including every category that belongs to the stated total.
These questions collect the small wording differences that can change a valid solution set. After reading the relevant answer, test the boundary and one nearby value in a fresh example. The goal is to connect the symbol with the condition it expresses.
Does at most mean exactly the stated limit?
No. It permits the limit and smaller allowed values. At most six means x ≤ 6, with the contextual domain applied separately. If the task asks for the maximum whole count, six is the maximum, but it is not the only permitted count under a nonnegative-integer model.
Does less than six mean at most five?
Only when the variable is restricted to integers. For real values, 5.5 and 5.99 are also less than six. Do not impose a whole-number restriction on a measurement unless it is given. The strict boundary remains six, even though that value is excluded.
Does a negative division remove equality?
No. Dividing both sides by a negative number reverses the order direction. An inclusive inequality remains inclusive, and a strict one remains strict. For example, −2x ≤ 8 becomes x ≥ −4. The equality case is still permitted because it was permitted in the original condition.
What should I check first?
Read the complete phrase, decide the allowed side and whether equality belongs, then define the variable’s domain and unit. Preserve those conditions through the calculation. Check the final boundary in the original statement and interpret the requested count, range or possible value accordingly.
Try one final paired condition. A fictional task awards three points per completed round, and the target is at least twenty-four points. With r a nonnegative integer, 3r ≥ 24 gives r ≥ 8, so eight rounds meets the target exactly. If the target is more than twenty-four points, the condition becomes 3r > 24 and the minimum whole count is nine rounds.
Now change the target boundary to twenty-five points. Both at least twenty-five and more than twenty-five require nine whole rounds, because eight rounds gives twenty-four and nine gives twenty-seven. The wording still defines different real-number inequalities, even though the integer decision agrees. This comparison is a useful final check: explain why inclusion matters at one boundary and is hidden by the discrete step size at the other. The answer depends on both the original comparison and the available whole-number values.