Negate a Compound Statement? Invoke De Morgan — ¬(p ∧ q) = ¬p ∨ ¬q

The problem asks you to find the negation of "you passed the exam and you got a scholarship", or algebraically, \lnot(p \land q). A student without the reflex starts rewriting, guessing, or (worst) answering \lnot p \land \lnot q — which is wrong. A student with the reflex writes one line:

\lnot(p \land q) \equiv \lnot p \lor \lnot q.

And for the sibling case:

\lnot(p \lor q) \equiv \lnot p \land \lnot q.

That is De Morgan's laws — two equivalences that handle every negation of a compound propositional expression. Nothing else, no other rules, no creative rewriting. See \lnot wrapped around \land or \lor: invoke De Morgan.

The recognition cue

Any of these patterns triggers the reflex:

\lnot(p \land q) or \lnot(p \lor q) in a logic exercise.
A sentence that says "it is not the case that A and B" — same thing in English.
A JEE question asking "what is the negation of: it is raining and I have an umbrella?" — translate to \lnot(p \land q), apply De Morgan.
Nested negations: \lnot(\lnot p \lor q) — still De Morgan, just applied once, then simplified with double negation.

Whenever the outer operator underneath a negation is \land or \lor, the distribution rule applies.

The two-rule template

Rule 1 — negation over AND:

\lnot(p \land q) \equiv \lnot p \lor \lnot q

Flip the connective from \land to \lor, and push the negation onto each part.

Rule 2 — negation over OR:

\lnot(p \lor q) \equiv \lnot p \land \lnot q

Flip the connective from \lor to \land, and push the negation onto each part.

The "flip and push" pattern is symmetric. \land becomes \lor; \lor becomes \land. Each component gets negated individually. No other changes.

Why "flip": for \lnot(p \land q) to be true, the conjunction p \land q must be false. A conjunction is false whenever at least one part is false — which is the \lor of the two negations. That is the whole argument, and it is exactly what the truth tables confirm. See Logic and Propositions for the side-by-side proof.

A walked mini example

Problem: Find the negation of "x > 0 and x < 10" (i.e., x \in (0, 10)).

Let p = "x > 0" and q = "x < 10." The statement is p \land q. Its negation is

\lnot(p \land q) \equiv \lnot p \lor \lnot q \equiv (x \le 0) \lor (x \ge 10).

In plain English: "x is \le 0 or x is \ge 10" — i.e., x is outside the interval. That is the correct negation.

Notice the common wrong answer: "x \le 0 and x \ge 10." That is simultaneously impossible (no single number is both), and it should have been your first alarm bell. The correct negation uses or, not and, because leaving an interval means failing at least one bound, not both.

A second walked example — negating an "or"

Problem: Negate "Rohan will study maths or physics tonight."

Let p = "studies maths", q = "studies physics." The statement is p \lor q. Its negation is

\lnot(p \lor q) \equiv \lnot p \land \lnot q.

In English: "Rohan will not study maths and will not study physics." Both must fail for the disjunction to fail. That is De Morgan's second law in action.

Nested De Morgan

What if the statement has two layers — for example, \lnot((p \land q) \lor r)? Apply De Morgan outside-in.

Step 1 — outer OR: \lnot((p \land q) \lor r) \equiv \lnot(p \land q) \land \lnot r.

Step 2 — inner AND: \lnot(p \land q) \equiv \lnot p \lor \lnot q. Substitute in:

(\lnot p \lor \lnot q) \land \lnot r.

Two applications; no surprises. The rule is mechanical, which is exactly what you want under exam pressure.

Extending to three or more operands

De Morgan works for any number of inputs:

\lnot(p_1 \land p_2 \land p_3) \equiv \lnot p_1 \lor \lnot p_2 \lor \lnot p_3

\lnot(p_1 \lor p_2 \lor p_3) \equiv \lnot p_1 \land \lnot p_2 \land \lnot p_3

Flip every connective; negate every component. Same rule, scaled up.

Common errors to avoid

Forgetting to flip. Writing \lnot(p \land q) = \lnot p \land \lnot q keeps the connective the same, which is a pure mistake — the two sides disagree in most rows of the truth table.
Negating only one side. Writing \lnot(p \land q) = \lnot p \lor q leaves q unnegated. The negation distributes to every component.
Mixing De Morgan with other operators. De Morgan applies to \land and \lor only. For \lnot(p \Rightarrow q), first rewrite the implication: p \Rightarrow q \equiv \lnot p \lor q, so \lnot(p \Rightarrow q) \equiv \lnot(\lnot p \lor q) \equiv p \land \lnot q — now De Morgan applies, and the result is p \land \lnot q. See Logic and Propositions for the implication rewrite.

The exam reflex

Spot \lnot over a compound of \land or \lor.
Flip the connective.
Negate each operand.
If nested, repeat outside-in.
If an implication is involved, first rewrite p \Rightarrow q as \lnot p \lor q, then apply De Morgan.

Three seconds of reflex; one line of algebra. De Morgan is not a trick you optionally remember — it is the single most frequent operation in logic problems on Indian school and competitive exams. The recognition is worth overtraining.