Apply verbal logic and numeric constraints to both parts of a paired decision.
GMAT35 min study guide8 indexed sections
BY THE END, YOU CAN
Explain must versus could versus cannot
Explain necessary characteristics
Explain either and neither cases
Explain scheduling constraints
Explain trade-offs
Explain conditional logic
Explain mixed verbal-quantitative data
Explain avoiding one-column-only solutions
BEFORE YOU START
Necessary and sufficient conditions
Comparisons, simple sums and time limits
Original educational lesson. Work through the examples before revealing the practice answers. This original lesson supports current GMAT study through an editorial skill map. It does not reproduce official questions, predict exam content or guarantee a score.
LEARN THROUGH ORIGINAL PRACTICE
Original GMAT-style worked examples and practice
All passages, examples and exercises here are original. No official GMAC questions, choices or explanations are reproduced. This independent preparation resource is not affiliated with or endorsed by GMAC. GMAT is a trademark of the Graduate Management Admission Council.
01 / UNDERSTAND & APPLY
Must, could and cannot quantify over possibilities
A must claim holds in every feasible case. A could claim holds in at least one. A cannot claim holds in none. “Not must” does not mean “cannot”: a statement can hold in some cases and fail in others.
In this lesson each Two-Part exercise requires exactly one selection per named column from its shared pool. Unless stated otherwise the same option can be used in both columns, but a request for distinct people or items overrides that permission.
Scheduling set: Three tasks A, B and C occupy positions 1,2,3 exactly once each. A must occur before B. No other restrictions apply. The feasible orders are ABC, ACB and CAB.
ORIGINAL WORKED EXAMPLE
Classify with all feasible orders
Scheduling set: From {A before B; C first; B before A}, select one statement for Must be true and one for Cannot be true.
A precedes B in all three feasible orders, so it must be true.
C is first in CAB but not ABC, so it could be true but need not be.
B before A violates the governing rule in every order.
Answer Must: A before B; Cannot: B before A
02 / UNDERSTAND & APPLY
Necessary characteristics are not complete guarantees
If selection requires both a certificate and availability, each is necessary but neither alone is sufficient. A candidate missing a necessary condition is ruled out immediately. A candidate having one required condition still needs the others checked.
Conditional reasoning is directional: if a project is approved then it has a sponsor, approval implies sponsorship. Sponsorship alone does not establish approval. The contrapositive, no sponsor implies not approved, is valid.
ORIGINAL WORKED EXAMPLE
Necessary versus sufficient
Rule: an application is accepted if and only if it is complete and timely. From {complete; complete and timely; incomplete}, choose a Necessary but not sufficient condition and a Sufficient condition.
Acceptance requires completeness, so complete is necessary; a complete but late application fails, so it is not sufficient.
Complete and timely guarantees acceptance by the if-and-only-if rule.
Incomplete rules out acceptance. Complete and timely is necessary as well as sufficient, but it does not meet the first column’s requirement of being insufficient on its own.
Answer Necessary but not sufficient: complete; Sufficient: complete and timely
03 / UNDERSTAND & APPLY
Use two-property classifications explicitly
For two properties P and Q, classify a candidate as both, P only, Q only or neither. Inclusive “either P or Q” allows both unless the wording says “exactly one.” Neither means not P and not Q.
The original service set is U: $4, 4 days; V: $6, 2 days; W: $8, 1 day; X: $9, 5 days. Define affordable as price at most $6 and quick as delivery at most 2 days. Inclusive boundaries matter for V.
Full-size scientific diagram. Swipe or scroll horizontally; keyboard users can focus the diagram and use arrow keys.
Original fictional services. Equality is included in each threshold.
ORIGINAL WORKED EXAMPLE
Both and neither
Service set: From {U,V,W,X}, select one option for Both affordable and quick and one for Neither affordable nor quick.
U is affordable but not quick; V meets both inclusive thresholds.
W is quick but not affordable. X exceeds both limits.
Classify all four before assigning the columns.
Answer Both: V; Neither: X
ORIGINAL PRACTICE · 1
Service set: Select Affordable only and Quick only from {U,V,W,X}.
Reveal answer & reasoning
Affordable only: U; Quick only: W
U costs $4 but takes 4 days. W takes 1 day but costs $8. V has both properties and X has neither.
ORIGINAL PRACTICE · 2
Service set: From {U,V,W,X}, select Highest price and Longest delivery time. Reuse is allowed.
Reveal answer & reasoning
Highest price: X; Longest time: X
X has the highest price, $9, and longest delivery, 5 days. Both column targets legitimately select the same option.
04 / UNDERSTAND & APPLY
Propagate ordering constraints without inventing adjacency
“Before” need not mean “immediately before.” Represent ordering as a relation and enumerate only the remaining feasible positions. A fixed first or last item can greatly reduce the cases.
Use complete schedules as witnesses for could claims, and counterexamples for must claims. A partial arrangement may conceal a later conflict, so verify all tasks fit.
ORIGINAL WORKED EXAMPLE
A unique four-task schedule
Jo, Kai, Lia and Sam occupy Monday through Thursday exactly once. Jo is Monday, Lia is Thursday, and Sam is before Kai. From {Monday,Tuesday,Wednesday,Thursday}, select Sam’s day and Kai’s day.
Tuesday and Wednesday remain after placing Jo and Lia.
Sam must precede Kai, so Sam takes Tuesday and Kai Wednesday.
This pair fills every day exactly once and satisfies all stated constraints.
Answer Sam: Tuesday; Kai: Wednesday
ORIGINAL PRACTICE · 1
Scheduling set: From {1,2,3}, select A’s latest possible position and B’s earliest possible position.
Reveal answer & reasoning
A latest: 2; B earliest: 2
CAB places A second; A cannot be third because B must follow. ABC places B second; B cannot be first because A must precede it.
ORIGINAL PRACTICE · 2
Scheduling set: From {ABC, ACB, CAB, BAC}, select the feasible order with C last and the feasible order with C first.
Reveal answer & reasoning
C last: ABC; C first: CAB
Both satisfy A before B and the requested C position. BAC violates the ordering rule; ACB places C second.
05 / UNDERSTAND & APPLY
Filter hard constraints before comparing preferences
Project-team set: Choose two distinct specialists, one for the R role and one for the S role. Cedar: R, $400, 3 days; Dune: R, $600, 2 days; Elm: S, $500, 1 day; Fern: S, $300, 4 days. Each role must be filled by its named skill. Work begins simultaneously, so completion time is the larger of the two durations. Total fee must be at most $900 and completion at most 3 days. These are fictional, exact quotes with no additional charges.
This set combines categorical skill requirements, total cost and completion time. A cheap specialist may miss the deadline, and two individually affordable specialists may exceed the joint budget. The whole pair must be checked.
Full-size scientific diagram. Swipe or scroll horizontally; keyboard users can focus the diagram and use arrow keys.
Original quotes. Budget ≤ $900; simultaneous completion = maximum duration ≤ 3 days.
ORIGINAL WORKED EXAMPLE
One pair meets every condition
Project-team set: Select R specialist and S specialist from {Cedar,Dune,Elm,Fern}, one per column.
For S, Fern takes 4 days, exceeding the 3-day limit; therefore Elm is required.
With Elm’s $500 fee, only $400 remains. Cedar fits; Dune’s $600 would yield $1,100.
Cedar+Elm costs $900 and completes in max(3,1)=3 days.
Answer R: Cedar; S: Elm
ORIGINAL PRACTICE · 1
Project-team set, except budget is $1,100 and deadline 2 days: Select R and S specialists from {Cedar,Dune,Elm,Fern}.
Reveal answer & reasoning
R: Dune; S: Elm
Cedar and Fern miss the tighter deadline. Dune+Elm costs $1,100 and finishes in 2 days, meeting both inclusive limits.
ORIGINAL PRACTICE · 2
Project-team set, except deadline is 4 days: Select the least-cost feasible R and S pair from {Cedar,Dune,Elm,Fern}.
Reveal answer & reasoning
R: Cedar; S: Fern
Cedar+Fern costs $700 and finishes in 4 days. Other skill-valid pairs cost $900, $900 or $1,100, so $700 is the minimum under the $900 budget.
06 / UNDERSTAND & APPLY
Translate if, only if and unless with care
“P only if Q” means P implies Q. “P if Q” means Q implies P. For “P unless Q,” a standard inclusive logical reading is not Q implies P; the full wording may add exclusivity, so read it rather than importing an extra rule.
A chain can establish consequences: launch implies testing, and testing implies approval; therefore launch implies approval. Approval does not by itself imply launch.
ORIGINAL PRACTICE · 1
Rules: launch implies testing, testing implies approval. No information is given about publicity. From {approval; no approval; publicity}, select a condition that must hold when launch occurs and a condition that makes launch impossible.
Reveal answer & reasoning
Must hold: approval; Makes impossible: no approval
The forward chain proves launch→approval. Its contrapositive proves no approval→no launch. Approval alone does not force launch.
07 / UNDERSTAND & APPLY
Quantitative and verbal requirements share one feasible set
Keep exact words attached to numbers. “At most $900” includes $900; “under $900” excludes it. “Simultaneously” makes joint completion the maximum duration, while consecutive work would require a sum. Changing one of these words changes feasibility.
A one-column-only approach can pick Cedar because it is cheap without noticing that the S specialist needs enough budget and time. Solve the coupled task, then assign the people to the correct roles.
ORIGINAL PRACTICE · 1
Project-team set with original fees: From {1,2,3,4,5}, select simultaneous completion time and consecutive completion time for Cedar followed by Elm. Durations are in days.
Reveal answer & reasoning
Simultaneous: 3; Consecutive: 4
Simultaneous work finishes when the slower specialist finishes: max(3,1)=3. Consecutive work takes 3+1=4. The two models must not be mixed.
08 / UNDERSTAND & APPLY
Check the complete response and the force of each claim
Write the two selected options as a sentence, then test it against every constraint. If a target says “must,” try to construct a legal counterexample; if it says “could,” exhibit a complete legal case.
Do not strengthen an answer simply because it is reasonable. The exercise asks what follows from its stated conditions, not which story you would expect in real life. A coherent pair with both response parts verified completes one question.
KEEP THE BIG IDEAS
Quick revision
Must means every feasible case; could means at least one.
Necessary conditions need not be sufficient.
Either, both and neither require distinct truth conditions.
Verify categorical rules, costs, time and both column roles together.
The teaching notes, passages, worked explanations and practice are original. Official references identify the assessment framework and skill scope; they do not endorse this lesson or license official question reproduction.
Assessment-format context only. Independent original teaching; no official questions, endorsement, score claim or exam-frequency claim. All organizations and datasets used in exercises are fictional.
GMAT analytics distinguish current structure from incomplete reviewed public-sample observations. Questions, response parts and shared stimuli have separate counts. Unreviewed items are excluded; zero reviewed observations do not imply exam absence.