Two everyday words carry the whole idea. A condition is sufficient when having it is enough — once p is true, q is guaranteed, no exceptions. A condition is necessary when you cannot do without it — q can never hold unless p holds too. The first is the arrow p ⇒ q; the second is the arrow q ⇒ p; when both arrows fire at once we say p is necessary and sufficient, written p ⇔ q. The cleanest way to see all of this is to read each condition as the set of things that satisfy it and ask which set sits inside which — the tool we built back in Stage 19 · Sets.

35.2.1 Sufficient: having it is enough

Start with a sentence that is plainly true: “if a number is a multiple of 6, then it is even.” Let p be “n is a multiple of 6” and q be “n is even.” Whenever p is true, q follows automatically — there is no multiple of 6 that is odd. So the implication p ⇒ q holds, and we say p is a sufficient condition for q: having p is enough to be sure of q.

35.2.2 Necessary: you can't do without it

Now flip the relationship. Take “to enrol in the calculus course you must have passed algebra.” Let p be “passed algebra” and q be “enrolled in calculus.” Here passing algebra does not by itself put you in calculus (you still have to register, meet other rules…). But you certainly cannot be in calculus without it: q ⇒ p. When p is forced by q like this, we call p a necessary condition for q: q cannot hold unless p holds.

35.2.3 Both at once: necessary and sufficient

Sometimes the two arrows both fire. Take p = “n is divisible by 6” and q = “n is divisible by both 2 and 3.” Every multiple of 6 is divisible by 2 and 3 (p ⇒ q), and every number divisible by 2 and 3 is a multiple of 6 (q ⇒ p). Each forces the other, so p is necessary and sufficient for q — they are completely equivalent, written p ⇔ q. Equivalent conditions are interchangeable: anywhere one is true, so is the other.

35.2.4 Conditions as sets — the small one is sufficient

Every condition quietly describes a set: let P = {x : p(x)} be all the x that make p true, and Q = {x : q(x)} all that make q true. Saying “whenever p, then q” is exactly saying every element of P is also in Q — that is P ⊆ Q. So we get one clean translation:

Picture P ⊆ Q as a small circle inside a big one. The small set is sufficient: land anywhere in P and you are automatically in Q. The big set is necessary: to be in P you had no choice but to already be in Q. The slogan is worth memorising — small = sufficient, big = necessary.

35.2.5 Identifying the type — check each direction once

You never have to guess. Given p and q, ask two questions and read off the answer:

Run the two checks on a concrete pair of shapes below. “A quadrilateral is a square” is the tight, special condition; “it is a rectangle” is the loose, general one. Every square is a rectangle, but most rectangles are not squares — so we expect square to be sufficient for rectangle, and never the other way.

★ What to carry forward

One sentence to keep: check each direction once, then name it — and remember small = sufficient, big = necessary. In 35.3 we widen the lens from single conditions to whole collections with the quantifiers ∀ and ∃.

✎ Exercises

1. Let p = “n is a multiple of 10” and q = “n is even.” Is p sufficient, necessary, both, or neither for q?
   Show answer

   p ⇒ q: every multiple of 10 is even — true. q ⇒ p: is every even number a multiple of 10? No, 4 breaks it — false. So p is sufficient but not necessary.

2. For real x, let p = “x > 5” and q = “x > 2.” Which set is inside which, and what is the role of p?
   Show answer

   P = {x : x > 5} ⊆ Q = {x : x > 2}, so p ⇒ q is true; but 3 is in Q and not in P, so q ⇒ p is false. The small set P is sufficient for q; it is not necessary.

3. Let p = “a triangle is equilateral” and q = “a triangle is isosceles.” Classify p.
   Show answer

   Every equilateral triangle is isosceles, so p ⇒ q is true. But an isosceles triangle with a different base need not be equilateral, so q ⇒ p is false. Hence equilateral is a sufficient (not necessary) condition for isosceles — equivalently, set equilateral ⊆ set isosceles.

4. Let p = “a whole number ends in 0” and q = “the number is divisible by 5.” Is p necessary for q?
   Show answer

   Necessary means q ⇒ p: does every multiple of 5 end in 0? No — 15 is divisible by 5 and ends in 5, a counterexample. So ending in 0 is not necessary for divisibility by 5. (It is sufficient: anything ending in 0 is divisible by 5.)

5. Let p = “a number is divisible by 4” and q = “the number is divisible by 2 and the quotient n/2 is even.” Classify p.
   Show answer

   “n is divisible by 4” means n = 4k = 2·(2k), and 2k is even — so p ⇒ q is true. Conversely, if n is even with n/2 even, then n/2 = 2m so n = 4m — so q ⇒ p is true too. Both arrows hold: p is necessary and sufficient (⇔), and the two sets are equal.

6. A student writes: “Rain is sufficient for the ground being wet, therefore wet ground proves it rained.” Where is the error?
   Show answer

   They assumed the converse. “Rain ⇒ wet” (sufficient) does not give “wet ⇒ rain.” The ground could be wet from a sprinkler — a counterexample. Rain is sufficient for wet ground but not necessary; sufficient never automatically means necessary.

🎯 Quick check

Six questions to lock it in. Tap the answer you think is right.

§ For teachers and parents