[Mathematical Logic: Practice Lab ①] 15 Killer Logic Problems & 1:1 Twin Self-Diagnostics (Complete Solutions)



Mathematical Logic · Practice Lab ①

15 Killer Logic Practice Problems & 1:1 Twin Self-Diagnostics

From boundary inclusion inequalities to quantifier parameter tuning, syllogism chains, and suspect deduction

🎯 [Practice Lab ①] Yul's 3 Golden Rules for Conquering Logic Problems
  • Principle 1 (Boundary Inclusion Test): In interval inclusion $P \subset Q$, evaluate boundary endpoints ($\le$ vs $<$) by testing whether the outer container set possesses the boundary point.
  • Principle 2 (Direct Counter-Example Targeting): Disproving $p \to q$ requires pinpointing elements strictly in the difference set ($P - Q$): satisfying the hypothesis, but violating the conclusion.
  • Principle 3 (Contraposition & Contradiction Pairs): Flip complex statements containing $\ne$ or "OR" into positive conjunctions via contraposition, and isolate mutually contradictory pairs ($X, \sim X$) in multi-statement puzzles.

STAGE 1. Truth Set Containment & Inequality Parameters

[Practice Type 01] Set Operation Conditions and Truth Determination Set Synthesis

In universal set $U$, let $P, Q, R$ be the truth sets of conditions $p, q, r$. If $P \cap Q^c = \emptyset$ and $R^c \cup Q^c = U$, select all propositions that are necessarily true:
A. $p \to q$      B. $p \to \sim r$      C. $r \to \sim q$

💡 Yul's Pro-Tip: $P \cap Q^c = P - Q = \emptyset \iff P \subset Q$. Furthermore, by De Morgan's Law, $R^c \cup Q^c = (R \cap Q)^c = U \implies R \cap Q = \emptyset$ (mutually disjoint). Drawing $P$ nestled inside $Q$, and keeping $R$ entirely separate from $Q$, solves the problem in 3 seconds!
👉 Reveal Answer & Step-by-Step Solution
[Answer] A, B, C

[Step-by-Step Solution]
1) $P \cap Q^c = P - Q = \emptyset \implies P \subset Q$. Hence $p \to q$ is true. (A is True)
2) $R^c \cup Q^c = (R \cap Q)^c = U \implies R \cap Q = \emptyset$ (Disjoint). Thus, $Q \subset R^c$ and $R \subset Q^c$.
3) Since $P \subset Q \subset R^c$, we have $P \subset R^c$, meaning $p \to \sim r$ is true. (B is True)
4) Since $R \subset Q^c$, $r \to \sim q$ is unconditionally true. (C is True)
[1:1 Twin Diagnostic 01] In universal set $U$, conditions $p, q$ satisfy $(P^c \cap Q) \cup P = P$. Determine the unconditionally true implication.
Check Answer
Answer: $q \to p$ (Reason: $(Q - P) \cup P = P \cup Q = P \iff Q \subset P \implies q \to p$)
[Practice Type 02] Boundary Endpoint Inclusion in Interval Containment Top Priority Trap

Consider two conditions $p : -2 < x \le 5$ and $q : a - 3 \le x < 2a + 8$. Find the sum of all integer values of $a$ such that $p \to q$ is true.

💡 Yul's Pro-Tip: To satisfy $P \subset Q$, the outer interval $Q$ must engulf inner interval $P$.
• Left boundary: $a - 3 \le -2$ (Outer is closed, inner is open; equality preserves inclusion $\implies \le$ holds).
• Right boundary: $5 < 2a + 8$ (Inner contains $5$ but outer is open; if $2a + 8 = 5$, $Q$ misses $5 \implies$ strict inequality $<$ only!).
👉 Reveal Answer & Step-by-Step Solution
[Answer] 0

[Step-by-Step Solution]
1) Left endpoint: $a - 3 \le -2 \implies a \le 1$.
2) Right endpoint: $5 < 2a + 8 \implies 2a > -3 \implies a > -1.5$.
3) Combining both: $-1.5 < a \le 1$. The possible integers are $a = -1, 0, 1$.
$\therefore \text{Sum} = (-1) + 0 + 1 = \mathbf{0}$.
[1:1 Twin Diagnostic 02] For $p : -1 \le x < 4$ and $q : k - 2 \le x \le 2k + 6$, find the number of integers $k$ such that $p \to q$ is true.
Check Answer
Answer: 3 (Solution: $k - 2 \le -1 \implies k \le 1$, and $4 \le 2k + 6 \implies k \ge -1$. Integers are $-1, 0, 1$, totaling 3)
[Practice Type 03] Identifying Elements in the Counter-Example Habitat Counter-Example Zone

In $U = \{x \mid x \in \mathbb{N}, x \le 20\}$, let $P$ be multiples of $3$, $Q$ be multiples of $2$, and $R$ be positive divisors of $12$. Find the sum of all counter-examples proving that $(p \wedge \sim q) \to r$ is false.

💡 Yul's Pro-Tip: Counter-examples to $A \to B$ exist exclusively in $A - B$ (Hypothesis True, Conclusion False)! Compute $(P \cap Q^c) - R = (P - Q) - R$ directly.
👉 Reveal Answer & Step-by-Step Solution
[Answer] 24

[Step-by-Step Solution]
1) Hypothesis truth set $P \cap Q^c = P - Q$ (Multiples of 3 that are odd): $P - Q = \{3, 9, 15\}$.
2) Conclusion truth set $R = \{1, 2, 3, 4, 6, 12\}$.
3) Counter-example region: $(P - Q) - R = \{3, 9, 15\} - \{1, 2, 3, 4, 6, 12\} = \{9, 15\}$.
$\therefore \text{Sum} = 9 + 15 = \mathbf{24}$.
[1:1 Twin Diagnostic 03] For $U = \{1, 2, \dots, 8\}$, $p : \text{divisor of 8}$, $q : \text{prime number}$, find the product of all counter-examples proving $p \to q$ false.
Check Answer
Answer: 32 (Solution: $P = \{1, 2, 4, 8\}$, $Q = \{2, 3, 5, 7\} \implies P - Q = \{1, 4, 8\}$. Product $= 1 \times 4 \times 8 = 32$)
[Practice Type 04] Universal Quadratic Inequality and Discriminant Synthesis Discriminant Linking

Find the minimum integer $k$ such that "For all real $x$, $kx^2 + 2(k - 1)x + (k + 2) > 0$" is true.

💡 Yul's Pro-Tip: When an inequality is not explicitly called "quadratic," you must evaluate the case where the leading coefficient is zero ($k = 0$) separately! For $k \ne 0$, require positive concavity ($k > 0$) and a strictly negative discriminant ($D/4 < 0$).
👉 Reveal Answer & Step-by-Step Solution
[Answer] 1

[Step-by-Step Solution]
1) If $k = 0$: $-2x + 2 > 0$, which fails for all real $x$.
2) If $k \ne 0$: Parabola must open upward ($k > 0$) with no real roots ($D/4 < 0$):
$D/4 = (k - 1)^2 - k(k + 2) = -4k + 1 < 0 \implies k > \frac{1}{4}$.
3) Intersection: $k > \frac{1}{4}$. The smallest integer is $\mathbf{1}$.
[1:1 Twin Diagnostic 04] Find the number of integers $a$ such that "For all real $x$, $x^2 - 2ax + 3a + 4 \ge 0$" is true.
Check Answer
Answer: 6 (Solution: $D/4 = a^2 - 3a - 4 \le 0 \implies -1 \le a \le 4$, totaling 6 integers)
[Practice Type 05] Negation Conversion of False Existential Statements Negation Strategy

Find the number of integers $a$ such that the proposition "There exists a real number $x$ such that $x^2 - 2(a - 2)x + 9 \le 0$" is FALSE.

💡 Yul's Pro-Tip: Stating that "There exists $x$ such that $p(x)$" is false is logically equivalent to asserting that its negation "For all $x$, $\sim p(x)$" is TRUE! Formulate the strictly positive inequality $x^2 - 2(a-2)x + 9 > 0$ and apply $D/4 < 0$.
👉 Reveal Answer & Step-by-Step Solution
[Answer] 5

[Step-by-Step Solution]
1) The negation must be true: "For all real $x$, $x^2 - 2(a - 2)x + 9 > 0$".
2) Since leading coefficient is $1 > 0$, apply $D/4 < 0$:
$D/4 = (a - 2)^2 - 9 < 0 \implies (a + 1)(a - 5) < 0 \implies -1 < a < 5$.
3) Satisfying integers: $a \in \{0, 1, 2, 3, 4\}$, totaling 5.
[1:1 Twin Diagnostic 05] Find the range of real numbers $k$ such that "There exists real $x$ such that $x^2 + 4kx + 3k + 1 < 0$" is false.
Check Answer
Answer: $-\frac{1}{4} \le k \le 1$ (Negation $\ge 0$ is true $\implies D/4 = 4k^2 - 3k - 1 \le 0$)

STAGE 2. Contraposition Chains & Logical De Morgan Operations

[Practice Type 06] Proof by Contraposition on Negative Statements Contrapositive Protocol

For real numbers $x, y$, state the contrapositive of "If $x + y \ne 4$, then $x \ne 1$ or $y \ne 3$", and prove its validity.

💡 Yul's Pro-Tip: Proving disjunctions with $\ne$ signs directly is tedious. Negating the conclusion turns "or" into "and", yielding $x = 1$ AND $y = 3$, which simplifies the proof to basic addition!
👉 Reveal Answer & Step-by-Step Solution
[Step-by-Step Proof]
1) The negation of $(x \ne 1) \vee (y \ne 3)$ is $(x = 1) \wedge (y = 3)$.
The negation of $x + y \ne 4$ is $x + y = 4$.
Contrapositive: "If $x = 1$ and $y = 3$, then $x + y = 4$."
2) Since $1 + 3 = 4$, the contrapositive is unquestionably true. Therefore, the original statement is true.
[1:1 Twin Diagnostic 06] Prove by contraposition: "For natural numbers $a, b$, if $ab$ is odd, then both $a$ and $b$ are odd."
Check Answer
Answer: Contrapositive: "If $a$ or $b$ is even, then $ab$ is even." If at least one factor is divisible by 2, the product contains a factor of 2, making $ab$ even. True!
[Practice Type 07] Multi-Variable Syllogism Chain Deduction Deduction Chain

For conditions $p, q, r, s$, assume $p \to \sim q$, $\sim r \to \sim s$, and $q \to r$ are all true. Which of the following cannot be deduced as necessarily true?
① $p \to \sim r$      ② $s \to r$      ③ $s \to \sim p$      ④ $p \to \sim s$      ⑤ $\sim r \to \sim p$

💡 Yul's Pro-Tip: Write each given statement alongside its contrapositive: $q \to \sim p$, $s \to r$, $\sim r \to \sim q$. The transitive chain $\sim r \to \sim q \to \sim p$ implies $p \to r$. Never confuse $p \to r$ with $p \to \sim r$!
👉 Reveal Answer & Step-by-Step Solution
[Answer] ① ($p \to \sim r$)

[Step-by-Step Solution]
1) Valid implications and contrapositives: $p \to \sim q \iff q \to \sim p$, $s \to r \iff \sim r \to \sim s$, $q \to r \iff \sim r \to \sim q$.
2) Transitive chains: $\sim r \to \sim q \to \sim p \implies \sim r \to \sim p \iff p \to r$.
3) $p \to r$ is valid, but $p \to \sim r$ cannot be proven true.
[1:1 Twin Diagnostic 07] If $p \to q$, $\sim r \to \sim q$, and $s \to \sim r$ are all true, which proposition is guaranteed true?
① $p \to s$      ② $s \to \sim p$      ③ $p \to r$
Check Answer
Answer: ③ $p \to r$ (Contrapositive of $\sim r \to \sim q$ is $q \to r$. Chain: $p \to q \to r$)
[Practice Type 08] Negating Disjunction Inequalities and Solution Counting De Morgan Synthesis

For $p : (x < -2 \text{ or } x \ge 5)$ and $q : -4 \le x < 8$, find the number of integers satisfying $\sim p \wedge q$.

💡 Yul's Pro-Tip: Negating $x < -2 \vee x \ge 5$ converts the unbounded split intervals into a single bounded interval: $-2 \le x < 5$!
👉 Reveal Answer & Step-by-Step Solution
[Answer] 7

[Step-by-Step Solution]
1) $\sim p \iff x \ge -2 \text{ and } x < 5 \implies [-2, 5)$.
2) $[-2, 5) \cap [-4, 8) = [-2, 5)$.
3) Integers: $\{-2, -1, 0, 1, 2, 3, 4\}$, totaling $5 - (-2) = \mathbf{7}$.
[1:1 Twin Diagnostic 08] For $p : (x \le 1 \text{ or } x > 6)$, find the sum of natural numbers satisfying $\sim p$.
Check Answer
Answer: 20 ($\sim p : 1 < x \le 6 \implies 2 + 3 + 4 + 5 + 6 = 20$)
[Practice Type 09] Comprehensive Truth Evaluation of Converse and Contrapositive Standard Exam Multi-Choice

For real numbers $x, y$, find the proposition where the converse is TRUE but the contrapositive is FALSE:
A. If $x > 0$ and $y > 0$, then $xy > 0$.
B. If $x + y > 2$, then $x > 1$ or $y > 1$.
C. If $x = 0$ and $y = 0$, then $x^2 + y^2 = 0$.
D. If $xy = 0$, then $x = 0$.

💡 Yul's Pro-Tip: "Contrapositive is false" means original $p \to q$ is false ($P \not\subset Q$), while "converse is true" means $q \to p$ is true ($Q \subset P$). Thus, search for a strict proper subset relationship $Q \subsetneq P$!
👉 Reveal Answer & Step-by-Step Solution
[Answer] D

[Step-by-Step Solution]
• A, B, C: Original statements are true (so contrapositives are true). Disqualified.
• D: Original $xy = 0 \implies x = 0$ is false (counter-example: $x = 1, y = 0$), so contrapositive is FALSE.
Converse: $x = 0 \implies xy = 0$ is TRUE.
$\therefore \mathbf{D}$.
[1:1 Twin Diagnostic 09] Evaluate the converse and contrapositive of $x^2 = 4 \implies x = 2$.
Check Answer
Answer: Converse is True ($x = 2 \implies x^2 = 4$). Contrapositive is False (Original has counter-example $x = -2$).
[Practice Type 10] Negation Implications with Absolute Value Inequalities Inequality Linking

For $p : |x - 2| \le 3$ and $q : x \ge a$, find the maximum real number $a$ such that $\sim q \to \sim p$ is true.

💡 Yul's Pro-Tip: Directly handling double negations invites sign mistakes. Convert to the contrapositive $p \to q \iff P \subset Q$ immediately: $[-1, 5] \subset [a, \infty) \implies a \le -1$.
👉 Reveal Answer & Step-by-Step Solution
[Answer] -1

[Step-by-Step Solution]
1) Equivalent contrapositive: $p \to q \iff P \subset Q$.
2) $P : -3 \le x - 2 \le 3 \implies [-1, 5]$.
3) $Q : [a, \infty)$. Containment requires $a \le -1$. Max $a = \mathbf{-1}$.
[1:1 Twin Diagnostic 10] For $p : |x - 1| \le 4$ and $q : x \le k$, find the minimum $k$ such that $\sim q \to \sim p$ is true.
Check Answer
Answer: 5 (Contrapositive: $[-3, 5] \subset (-\infty, k] \implies k \ge 5$)

STAGE 3. Contradiction Logic Puzzles, Reductio ad Absurdum & Advanced Synthesis

[Practice Type 11] Suspect Interrogation Logic Puzzle via Contradiction Pairs Deductive Puzzle

Four suspects $A, B, C, D$ gave the following testimonies. There is exactly one culprit, and only one person tells the truth while the other three lie. Identify the truth-teller and the culprit:

• $A$: "$C$ is the culprit."
• $B$: "I am not the culprit."
• $C$: "$D$ is the culprit."
• $D$: "$C$ is lying."

💡 Yul's Pro-Tip: Notice $C$ and $D$! $C$ claims "$D$ did it", and $D$ claims "$C$ is lying." They form an exclusive contradiction pair ($X, \sim X$). One of them must tell the truth, meaning both $A$ and $B$ are automatically lying. Since $B$ lies when saying "I'm innocent," the culprit is $B$!
👉 Reveal Answer & Step-by-Step Solution
[Answer] Truth-teller: $D$, Culprit: $B$

[Step-by-Step Solution]
1) $C$ and $D$ are contradictory statements; exactly one is True, one is False.
2) Since only one truth-teller exists, statements by $A$ and $B$ must be False.
3) $B$'s statement ("I am not the culprit") is False $\implies$ $B$ is the culprit.
4) Verification: If $B$ is culprit, $A(\text{F}), B(\text{F}), C(\text{F}), D(\text{T})$. Fully consistent!
[1:1 Twin Diagnostic 11] Out of 3 suspects, 1 is the culprit and exactly 1 tells the truth. $A$: "$B$ is culprit", $B$: "I am culprit", $C$: "$B$ is lying." Find the culprit.
Check Answer
Answer: $C$ ($B$ and $C$ are contradictory $\implies A$ is lying $\implies B$ not culprit. $B$ is also lying. Hence $C$ is the culprit)
[Practice Type 12] Multi-Interval Containment and Boundary Optimization Interval System

Let $P = \{x \mid -2 \le x \le 3\}$, $Q = \{x \mid x < a \text{ or } x > b\}$, and $R = \{x \mid x \ge c\}$. If both $p \to \sim q$ and $p \to r$ are true, find the minimum value of $b - a + c$ at boundary limits. (where $a < b$)

💡 Yul's Pro-Tip: $p \to \sim q \iff P \subset Q^c$. Note $Q^c = [a, b]$. Thus $[-2, 3] \subset [a, b] \implies a \le -2, b \ge 3$, yielding $\min(b - a) = 3 - (-2) = 5$.
👉 Reveal Answer & Step-by-Step Solution
[Answer] 3

[Step-by-Step Solution]
1) $P \subset Q^c \implies [-2, 3] \subset [a, b] \implies a \le -2, b \ge 3$. Min $(b - a) = 3 - (-2) = 5$.
2) $P \subset R \implies [-2, 3] \subset [c, \infty) \implies c \le -2$. Boundary value is $c = -2$.
3) $5 + (-2) = \mathbf{3}$.
[1:1 Twin Diagnostic 12] For $P = [1, 4]$ and $Q = (-\infty, a) \cup (b, \infty)$, if $p \to \sim q$ is true, find the minimum value of $b - a$.
Check Answer
Answer: 3 ($Q^c = [a, b] \implies a \le 1, b \ge 4 \implies b - a \ge 3$)
[Practice Type 13] Proof by Contradiction (Reductio ad Absurdum) Fill-in Classic Proof

Complete blanks (A), (B), (C) in proving that "$\sqrt{2}$ is irrational" via proof by contradiction:

[Proof]
Assume $\sqrt{2}$ is rational, so $\sqrt{2} = \frac{n}{m}$ where $m, n \in \mathbb{N}$ are (A).
Squaring yields $2m^2 = n^2$. Since $n^2$ is even, $n$ is even. Let $n = 2k$.
Then $2m^2 = 4k^2 \implies m^2 = 2k^2$, which implies $m$ is also even.
This contradicts the initial assumption that $m$ and $n$ are (B), producing a (C).
Therefore, $\sqrt{2}$ is irrational.

💡 Yul's Pro-Tip: The pivot of the $\sqrt{2}$ proof is assuming a reduced fraction where $m, n$ share no common factors (coprime / relatively prime). Proving both are even breaks this initial coprime condition.
👉 Reveal Answer & Step-by-Step Solution
[Answer] (A) coprime (relatively prime), (B) coprime, (C) contradiction

[Step-by-Step Solution]
Rational numbers can be expressed as irreducible fractions $\frac{n}{m}$ with $\gcd(m, n) = 1$ (coprime). Deriving that both are even violates this foundation, yielding a logical contradiction.
[1:1 Twin Diagnostic 13] To prove "The sum of a rational and an irrational number is irrational" by contradiction, write the opening assumption.
Check Answer
Answer: "Assume that the sum of a rational number and an irrational number is rational."
[Practice Type 14] Dual Quadratic Quantifier Simultaneous Solvability Simultaneous Quantifiers

Find all integers $a$ such that both propositions are simultaneously true:
(i) For all real $x$, $x^2 - ax + a + 3 > 0$.
(ii) There exists real $x$ such that $x^2 + 2x - a + 2 \le 0$.

💡 Yul's Pro-Tip: "For all $x$, $> 0$" requires no real roots ($D_1 < 0$). In contrast, "There exists $x$, $\le 0$" means the graph must touch or dip below the $x$-axis ($D_2 \ge 0$). Notice the opposite inequality directions!
👉 Reveal Answer & Step-by-Step Solution
[Answer] 1, 2, 3, 4, 5

[Step-by-Step Solution]
1) Condition (i): $D_1 = a^2 - 4(a + 3) < 0 \implies (a - 6)(a + 2) < 0 \implies -2 < a < 6$.
2) Condition (ii): $D_2/4 = 1 - (-a + 2) \ge 0 \implies a - 1 \ge 0 \implies a \ge 1$.
3) Intersection: $1 \le a < 6$. The integers are $\mathbf{1, 2, 3, 4, 5}$.
[1:1 Twin Diagnostic 14] Find the minimum natural number $k$ such that "There exists real $x$ such that $x^2 - 2kx + 9 \le 0$" is true.
Check Answer
Answer: 3 ($D/4 = k^2 - 9 \ge 0 \implies k \ge 3$)
[Practice Type 15] Counting Provably True Propositions via Syllogism Top-Tier Synthesis

Given that $p \to \sim q$ and $q \to r$ are true, select all propositions from the list below that are guaranteed to be true:
A. $\sim r \to \sim q$      B. $q \to \sim p$      C. $p \to \sim r$      D. $\sim r \to \sim p$

💡 Yul's Pro-Tip: The contrapositives of the two given statements are $q \to \sim p$ and $\sim r \to \sim q$. Always remember: forward chaining is valid, but reverse implications without equivalence cannot be proven true!
👉 Reveal Answer & Step-by-Step Solution
[Answer] A, B

[Step-by-Step Solution]
1) $q \to r \implies$ Contrapositive $\sim r \to \sim q$ (A is True).
2) $p \to \sim q \implies$ Contrapositive $q \to \sim p$ (B is True).
3) We cannot chain $\sim r \to \sim q$ and $q \to \sim p$ directly because the middle term is negated ($\sim q \ne q$).
$\therefore \mathbf{A, B}$.
[1:1 Twin Diagnostic 15] If $p \to \sim q$ and $r \to q$ are both true, determine the definitive proposition relating $p$ and $r$.
Check Answer
Answer: $r \to \sim p$ (or $p \to \sim r$) (Chain: $r \to q \to \sim p$)
🌿 Words from Yul
"Killer logic problems are not verbal riddles—they are rigorous blueprint designs of boundary endpoints and contradiction pairs."

Many students mistake mathematical logic for trivial grammar tricks, repeatedly losing points on subtle edge cases.
Top 1% problem-solvers coldly test whether the outer set strictly contains the boundary endpoints on the real line, and isolate mutually contradictory statement pairs ($X$ and $\sim X$) to eliminate false branches in seconds.
Take the 15 killer problem types and twin diagnostics mastered today, sketch them directly onto blank paper, and solidify a lifelong logical foundation that spans all of advanced mathematics.

Comments

Popular posts from this blog

Authentic Reference Models Beyond Basic Rulers

[Math Column]Studying Alongside Dedicated Peers: Becoming Each Other’s Lifelong Catalyst

[High School Math] Coordinate Geometry: 15 Essential Practice Problems on Section Formulas (Internal & External Division)