Finite Mathematics Quiz: Logical Statements And Implications
17 questions · exam conditions
0:00
Logical Statements And ImplicationsQuestion 1 of 17

Consider the statement: "If a student studies for at least 6 hours, then they will pass the exam." Given that Maria studied for 8 hours and failed the exam, what can be concluded about the original statement?

The statement is false because the hypothesis was true but the conclusion was false
The statement is true because Maria's case is an exception to the general rule
The statement is indeterminate because we need more information about other students
The statement is true because studying 8 hours satisfies the condition in the hypothesis
← Back to quizzes

Finite Mathematics Quiz

Finite Mathematics Quiz: Logical Statements And Implications

Practice Logical Statements And Implications in Finite Mathematics with focused quiz questions that help you check what you know, review explanations, and build confidence with test-style prompts.

What this quiz covers

This quiz focuses on Logical Statements And Implications, giving you a quick way to practice the rules, question types, and explanations that matter most for Finite Mathematics.

How to use this quiz

Try each quiz question before looking at the correct answer. Use the explanations to review missed ideas, then come back to similar questions until the pattern feels familiar.

All questions

Question 1

Consider the statement: "If a student studies for at least 6 hours, then they will pass the exam." Given that Maria studied for 8 hours and failed the exam, what can be concluded about the original statement?

  1. The statement is false because the hypothesis was true but the conclusion was false (correct answer)
  2. The statement is true because Maria's case is an exception to the general rule
  3. The statement is indeterminate because we need more information about other students
  4. The statement is true because studying 8 hours satisfies the condition in the hypothesis
Explanation: In a conditional statement "If P, then Q," the statement is false when P is true and Q is false. Since Maria studied for 8 hours (P is true: she studied at least 6 hours) but failed the exam (Q is false), this is a counterexample that makes the entire conditional statement false. Choice B is wrong because exceptions don't exist in logical implications. Choice C is wrong because one counterexample is sufficient to disprove a universal conditional. Choice D is wrong because it ignores that the conclusion was false.

Question 2

Given the statement "It is not the case that both the meeting is on Tuesday and the room is available," which logical expression correctly represents this?

  1. p¬qp \land \neg q where pp: "meeting is on Tuesday" and qq: "room is available"
  2. ¬p¬q\neg p \land \neg q where pp: "meeting is on Tuesday" and qq: "room is available"
  3. ¬(pq)\neg (p \land q) where pp: "meeting is on Tuesday" and qq: "room is available" (correct answer)
  4. p¬qp \rightarrow \neg q where pp: "meeting is on Tuesday" and qq: "room is available"
Explanation: When translating English statements into logical expressions, you need to carefully identify the structure of negations and compound statements. The phrase "It is not the case that both..." signals a negation applied to an entire conjunction. Let's break down the given statement: "It is not the case that both the meeting is on Tuesday and the room is available." This has the structure "It is not the case that (A and B)," where A is "meeting is on Tuesday" and B is "room is available." In logical notation, this becomes ¬(pq)\neg (p \land q), which is exactly what option C represents. Option A, p¬qp \land \neg q, translates to "the meeting is on Tuesday AND the room is not available" - this makes a positive claim about both conditions rather than negating their conjunction. Option B, ¬p¬q\neg p \land \neg q, means "the meeting is NOT on Tuesday AND the room is NOT available" - this incorrectly applies negation to each individual statement rather than to their combination. Option D, p¬qp \rightarrow \neg q, represents "if the meeting is on Tuesday, then the room is not available," which creates a conditional relationship that doesn't exist in the original statement. The key difference is that ¬(pq)\neg (p \land q) means at least one of the conditions must be false (maybe the meeting isn't on Tuesday, maybe the room isn't available, or maybe both), while the incorrect options either specify exactly which conditions are false or create relationships not present in the original statement. Study tip: When you see "It is not the case that both..." always look for ¬(pq)\neg (p \land q) - the negation applies to the entire conjunction, not the individual parts.

Question 3

Let pp: "The number is even" and qq: "The number is divisible by 4." Which statement correctly represents the logical relationship between these propositions?

  1. qpq \rightarrow p is true, but pqp \rightarrow q is false (correct answer)
  2. pqp \rightarrow q is true, but qpq \rightarrow p is false
  3. Both pqp \rightarrow q and qpq \rightarrow p are true (biconditional relationship)
  4. Both pqp \rightarrow q and qpq \rightarrow p are false
Explanation: If a number is divisible by 4, it must be even (qpq \rightarrow p is true). However, if a number is even, it's not necessarily divisible by 4 (counterexample: 6 is even but not divisible by 4, so pqp \rightarrow q is false). Choice B reverses the correct relationship. Choice C is wrong because the relationship is not biconditional. Choice D is wrong because qpq \rightarrow p is indeed true.

Question 4

Let Z\mathbb{Z} be the set of all integers. Which of the following is the negation of the statement: "For every integer xx, there exists an integer yy such that x+y=0x+y=0"?

  1. For every integer xx, there exists an integer yy such that x+y0x+y \neq 0.
  2. There exists an integer xx such that for all integers yy, x+y0x+y \neq 0. (correct answer)
  3. There exists an integer xx such that there exists an integer yy for which x+y0x+y \neq 0.
  4. For all integers yy, there exists an integer xx such that x+y0x+y \neq 0.
Explanation: The original statement is xZ,yZ such that x+y=0\forall x \in \mathbb{Z}, \exists y \in \mathbb{Z} \text{ such that } x+y=0. To negate a statement with quantifiers, we change each quantifier and negate the predicate. The negation of \forall is \exists, and the negation of \exists is \forall. The negation of the predicate x+y=0x+y=0 is x+y0x+y \neq 0. Applying this, the negation of the statement is xZ such that yZ,x+y0\exists x \in \mathbb{Z} \text{ such that } \forall y \in \mathbb{Z}, x+y \neq 0. This translates to 'There exists an integer xx such that for all integers yy, x+y0x+y \neq 0.' The other choices represent common errors in negating quantifiers.

Question 5

A university's policy states: "To be eligible for the Dean's List, a student must be full-time and must have a semester GPA of at least 3.75." Based on this policy, which of the following is a valid conclusion?

  1. Any student who is full-time with a GPA of 3.8 is on the Dean's List.
  2. Being full-time is a sufficient condition for being on the Dean's List.
  3. A student with a GPA of 3.75 is a necessary condition for being on the Dean's List.
  4. A student who is not full-time cannot be on the Dean's List. (correct answer)
Explanation: Let DD be 'on the Dean's List', FF be 'is full-time', and GG be 'has a GPA of at least 3.75'. The policy is D(FG)D \rightarrow (F \wedge G). This means being full-time and having the required GPA are necessary conditions for being on the Dean's List. Let's analyze the contrapositive: ¬(FG)¬D\neg(F \wedge G) \rightarrow \neg D, which is equivalent to (¬F¬G)¬D(\neg F \vee \neg G) \rightarrow \neg D. From this, we can deduce that if a student is not full-time (¬F\neg F is true), then they cannot be on the Dean's List (¬D\neg D is true). Thus, D is a valid conclusion. A is the converse, (FG)D(F \wedge G) \rightarrow D, which is not guaranteed. B is incorrect; being full-time is necessary, not sufficient. C misstates the condition; the condition is having a GPA of at least 3.75, and it is necessary, not the student themselves.

Question 6

A university has the following registration rule: "A student cannot be enrolled in both Advanced Physics and Introduction to Art History in the same semester." Which of the following statements is logically equivalent to this rule?

  1. A student must be enrolled in either Advanced Physics or Introduction to Art History.
  2. A student is not enrolled in Advanced Physics and is also not enrolled in Introduction to Art History.
  3. If a student is enrolled in Advanced Physics, then they are not enrolled in Introduction to Art History. (correct answer)
  4. If a student is not enrolled in Advanced Physics, then they are enrolled in Introduction to Art History.
Explanation: When you encounter logical equivalence problems, you need to identify statements that have identical truth values in all possible scenarios. The original rule states a prohibition: students cannot be enrolled in both courses simultaneously. Let's translate this into logical terms. If we let P = "enrolled in Advanced Physics" and A = "enrolled in Introduction to Art History," the original rule says "not (P and A)" or ¬(PA)\neg(P \land A). Using De Morgan's law, this is equivalent to ¬P¬A\neg P \lor \neg A, meaning "not enrolled in Advanced Physics OR not enrolled in Art History." Choice C correctly captures this logic through a conditional statement: "If enrolled in Advanced Physics, then not enrolled in Art History" (P¬AP \rightarrow \neg A). This is logically equivalent to the original rule because it prohibits the same scenario—being enrolled in both courses. Choice A is wrong because it requires enrollment in at least one course, but the original rule allows students to take neither course. Choice B is incorrect because it prohibits taking either course individually, which is much more restrictive than the original rule that only prohibits taking both together. Choice D creates a false requirement—it forces students who aren't taking Advanced Physics to take Art History, which contradicts the flexibility of the original rule. Study tip: When working with logical equivalences involving prohibitions, look for conditional statements that prevent the forbidden scenario. A rule that says "you can't do both X and Y" is equivalent to "if you do X, then you can't do Y."

Question 7

Given the logical statement (x<5)(y>10)(x < 5) \leftrightarrow (y > 10), which of the following pairs of values for xx and yy makes the statement FALSE?

  1. x=6,y=12x=6, y=12 (correct answer)
  2. x=4,y=11x=4, y=11
  3. x=6,y=9x=6, y=9
  4. x=5,y=10x=5, y=10
Explanation: Let PP be the statement x<5x < 5 and QQ be the statement y>10y > 10. The overall statement is a biconditional, PQP \leftrightarrow Q, which is true if and only if PP and QQ have the same truth value (both true or both false). It is false if they have different truth values. We need to find the pair (x,y)(x, y) that makes PP and QQ have different truth values. For choice A: x=6,y=12x=6, y=12. P:6<5P: 6 < 5 is False. Q:12>10Q: 12 > 10 is True. Since PP is False and QQ is True, PQP \leftrightarrow Q is False. For choice B: x=4,y=11x=4, y=11. P:4<5P: 4 < 5 is True. Q:11>10Q: 11 > 10 is True. TTT \leftrightarrow T is True. For choice C: x=6,y=9x=6, y=9. P:6<5P: 6 < 5 is False. Q:9>10Q: 9 > 10 is False. FFF \leftrightarrow F is True. For choice D: x=5,y=10x=5, y=10. P:5<5P: 5 < 5 is False. Q:10>10Q: 10 > 10 is False. FFF \leftrightarrow F is True.

Question 8

A restaurant advertises: "If you order the special meal, then you get free dessert or a discount." Sarah ordered the special meal but received neither free dessert nor a discount. What can be concluded?

  1. The advertisement is still true because it applies to most customers, not all
  2. Sarah must not have actually ordered the special meal correctly
  3. The restaurant's advertisement is false based on Sarah's experience (correct answer)
  4. More information is needed to determine if the advertisement is true or false
Explanation: This question tests your understanding of logical statements and their truth conditions. In finite mathematics, when we encounter conditional statements like "If P, then Q," we need to understand that the statement is considered false if we can find even one case where P is true but Q is false. The restaurant's advertisement creates a conditional statement: "If you order the special meal, then you get free dessert or a discount." Sarah provides a counterexample—she ordered the special meal (the condition was met) but received neither free dessert nor a discount (the promised outcome failed). In logic, a single counterexample is sufficient to prove that a conditional statement is false. Looking at the wrong answers: Choice A incorrectly suggests that logical statements can be "mostly true"—but in mathematics, a statement is either true or false, and exceptions don't make false statements acceptable. Choice B assumes Sarah made an error, but we have no evidence for this assumption; we must work with the given information. Choice D suggests we need more data, but we already have a clear counterexample that definitively proves the statement false. Choice C correctly identifies that the restaurant's advertisement is false based on Sarah's experience, since she provides a concrete instance where the conditional statement failed. Study tip: Remember that in logic problems, a single counterexample is enough to prove a universal statement false. Don't let answer choices that make excuses or ask for more information distract you when you already have sufficient evidence to reach a conclusion.

Question 9

Consider the following premises:

  1. If the product is defective, the company issues a recall. (DRD \rightarrow R)
  2. If the company does not issue a recall, then its stock price will rise. (¬RS\neg R \rightarrow S)
  3. The product is defective. (DD)

Assuming these premises are true, which conclusion logically follows?

  1. The company's stock price will rise.
  2. The company issues a recall. (correct answer)
  3. The company's stock price will not rise.
  4. The argument is a fallacy of the converse.
Explanation: This is an application of rules of inference. From premise 1 (DRD \rightarrow R) and premise 3 (DD), we can use modus ponens to conclude RR (The company issues a recall). This makes choice B the correct conclusion. We cannot conclude anything about the stock price. The condition for the stock price to rise is ¬R\neg R (no recall). Since we concluded RR (there is a recall), the premise ¬RS\neg R \rightarrow S does not allow us to conclude SS or ¬S\neg S. Concluding ¬S\neg S would be the fallacy of denying the antecedent. Therefore, A and C are not supported. The argument form is valid, not a fallacy.

Question 10

Let PP be the statement "55 is an odd number," QQ be the statement "88 is a prime number," and RR be the statement "A square has four equal sides." What is the truth value of the compound statement (P¬Q)(¬RQ)(P \rightarrow \neg Q) \leftrightarrow (\neg R \vee Q)?

  1. True, because both sides of the biconditional are true.
  2. False, because the left side is true and the right side is false. (correct answer)
  3. False, because the left side is false and the right side is true.
  4. Undefined, because one of the component statements is false.
Explanation: First, determine the truth values of the simple statements: PP is True (T), QQ is False (F), and RR is True (T). Now, evaluate the compound statement in parts. Left side: (P¬Q)(P \rightarrow \neg Q). ¬Q\neg Q is T. So, we have (TT)(T \rightarrow T), which is T. Right side: (¬RQ)(\neg R \vee Q). ¬R\neg R is F. So, we have (FF)(F \vee F), which is F. Finally, evaluate the biconditional: (T)(F)(T) \leftrightarrow (F), which is False. Therefore, the compound statement is false because the left side is true and the right side is false.

Question 11

Consider the compound statement: (pq)r(p \land q) \rightarrow r. If this statement is false, which of the following must be true?

  1. pp is true, qq is false, and rr is false
  2. pp is false, qq is false, and rr is false
  3. Either pp is false or qq is false, and rr is true
  4. pp is true, qq is true, and rr is false (correct answer)
Explanation: When you encounter questions about conditional statements being false, you need to recall that an implication pqp \rightarrow q is only false in one specific scenario: when the antecedent (pp) is true but the consequent (qq) is false. For the statement (pq)r(p \land q) \rightarrow r to be false, the antecedent (pq)(p \land q) must be true while the consequent rr must be false. For (pq)(p \land q) to be true, both pp and qq must individually be true. Therefore, when (pq)r(p \land q) \rightarrow r is false, we must have: pp is true, qq is true, and rr is false. This confirms answer choice D. Let's examine why the other options fail. Choice A states pp is true, qq is false, and rr is false. However, if qq is false, then (pq)(p \land q) is false, making the entire implication true regardless of rr's value. Choice B claims pp is false, qq is false, and rr is false. Again, if either pp or qq is false, then (pq)(p \land q) is false, making the implication true. Choice C suggests either pp or qq is false while rr is true. This also makes (pq)(p \land q) false, resulting in a true implication. Remember this key principle: a conditional statement is false only when you have a true antecedent leading to a false consequent. In complex antecedents involving "and" (\land), all components must be true for the antecedent to be true.

Question 12

In a logic puzzle, you're told: "If the treasure is in the cave, then the dragon is sleeping. The dragon is not sleeping." Using valid logical reasoning, what can you conclude?

  1. The treasure might or might not be in the cave
  2. The treasure is not in the cave (correct answer)
  3. The dragon is awake, but this tells us nothing about the treasure
  4. The treasure is definitely in the cave, but the dragon woke up
Explanation: When you encounter conditional logic problems, you're dealing with "if-then" statements and their logical consequences. The key is recognizing when you can use modus tollens, a valid form of logical reasoning. You're given two premises: "If the treasure is in the cave, then the dragon is sleeping" and "The dragon is not sleeping." In logical form, this is: If P, then Q; not Q. From this structure, you can definitively conclude "not P" – meaning the treasure is not in the cave. Here's why: If the treasure were in the cave, the dragon would have to be sleeping (according to the first statement). But since the dragon is not sleeping, the treasure cannot be in the cave. This is modus tollens in action – when the consequence of a conditional statement is false, the condition itself must be false. Choice A is incorrect because there's no uncertainty here – the logic gives us a definitive conclusion. Choice C makes a common error by assuming we can't determine anything about the treasure; in fact, we can make a strong conclusion about it. Choice D contradicts the logical structure entirely by claiming the treasure is in the cave, which would require the dragon to be sleeping. Study tip: Remember the modus tollens pattern: "If P then Q; not Q; therefore not P." This is one of the most reliable forms of logical reasoning and appears frequently in finite mathematics logic problems. When you see a conditional statement paired with the negation of its consequence, you can confidently negate the original condition.

Question 13

Which of the following is the negation of the statement "The value of zz is such that 2<z10-2 < z \le 10"?

  1. z<2z < -2 or z>10z > 10
  2. z2z \le -2 and z>10z > 10
  3. z>2z > -2 or z<10z < 10
  4. z2z \le -2 or z>10z > 10 (correct answer)
Explanation: The original statement, 2<z10-2 < z \le 10, is a compound statement equivalent to (2<z)(z10)(-2 < z) \wedge (z \le 10). Let PP be 2<z-2 < z and QQ be z10z \le 10. We want to find the negation ¬(PQ)\neg(P \wedge Q). By De Morgan's laws, this is equivalent to ¬P¬Q\neg P \vee \neg Q. The negation of PP (2<z-2 < z) is z2z \le -2. The negation of QQ (z10z \le 10) is z>10z > 10. Combining these with 'or' gives the final negated statement: z2z>10z \le -2 \vee z > 10. Choice B incorrectly uses 'and' instead of 'or'. Choice A has incorrect inequality signs (e.g., uses << instead of \le). Choice C incorrectly negates the inequalities.

Question 14

The statement "All mathematics majors are logical thinkers" is logically equivalent to which of the following?

  1. If someone is not a mathematics major, then they are not a logical thinker
  2. If someone is a logical thinker, then they are a mathematics major
  3. All logical thinkers are mathematics majors
  4. If someone is not a logical thinker, then they are not a mathematics major (correct answer)
Explanation: When you encounter logical statements like "All X are Y," you're dealing with conditional logic that can be rewritten in if-then form. The statement "All mathematics majors are logical thinkers" means: "If someone is a mathematics major, then they are a logical thinker." The contrapositive of any conditional statement is always logically equivalent to the original. To form the contrapositive, you negate both parts and reverse their order. Starting with "If mathematics major, then logical thinker," the contrapositive becomes "If not a logical thinker, then not a mathematics major." This matches answer choice D perfectly. Let's examine why the other options fail. Choice A gives you the inverse ("If not mathematics major, then not logical thinker"), which reverses the order without negating both parts—this is a common logical fallacy. Choice B presents the converse ("If logical thinker, then mathematics major"), which just flips the original statement without negation. Choice C ("All logical thinkers are mathematics majors") is simply the converse written in "all" form rather than if-then form. Both the inverse and converse are logical errors that students frequently make. The key insight is that saying all math majors are logical doesn't mean all logical people are math majors—there could be logical thinkers in other fields. However, if someone lacks logical thinking, they definitely can't be a math major. Remember: only the contrapositive preserves logical equivalence. When you see "All X are Y," immediately think "If not Y, then not X" to find the equivalent statement.

Question 15

The manager states a policy: "The project deadline will be extended unless the client approves the prototype by Friday." Which of the following situations would be a violation of this policy?

  1. The client approves the prototype on Thursday and the deadline is extended.
  2. The client does not approve the prototype by Friday and the deadline is extended.
  3. The client does not approve the prototype by Friday and the deadline is not extended. (correct answer)
  4. The client approves the prototype on Thursday and the deadline is not extended.
Explanation: When you encounter logical statements in finite mathematics, you need to understand conditional statements and their truth conditions. The policy "The project deadline will be extended unless the client approves the prototype by Friday" can be rewritten as: "If the client does not approve the prototype by Friday, then the deadline will be extended." A conditional statement is violated only when the condition is true but the consequence is false. Here, the condition is "client does not approve by Friday" and the consequence is "deadline will be extended." Looking at option C: The client doesn't approve by Friday (condition is true) AND the deadline is not extended (consequence is false). This directly violates the policy because the manager promised to extend the deadline when approval doesn't come by Friday. Option A is not a violation because even though the client approved on Thursday, the manager can still choose to extend the deadline - the policy doesn't forbid this. Option B follows the policy correctly: no approval by Friday triggers the promised deadline extension. Option D also follows the policy: when the client approves by Thursday, there's no obligation to extend the deadline, so not extending it is perfectly acceptable. The key insight is that "unless" creates a conditional promise. The manager must extend the deadline when the client fails to approve by Friday, but has discretion in all other scenarios. Study tip: For "unless" statements, convert them to "if-then" format to clearly identify when the policy would be violated. A policy violation occurs only when the required action isn't taken.

Question 16

Consider the statement: "If the company's profits increase by at least 10%, then all employees will receive a bonus." Which of the following statements is logically equivalent to this statement?

  1. If at least one employee does not receive a bonus, then the company's profits increased by less than 10%. (correct answer)
  2. If all employees receive a bonus, then the company's profits increased by at least 10%.
  3. If the company's profits increase by less than 10%, then no employees will receive a bonus.
  4. The company's profits increase by at least 10% and some employees do not receive a bonus.
Explanation: Let PP be 'the company's profits increase by at least 10%' and QQ be 'all employees will receive a bonus'. The original statement is an implication PQP \rightarrow Q. A statement is logically equivalent to its contrapositive, which is ¬Q¬P\neg Q \rightarrow \neg P. The negation of QQ, ¬Q\neg Q, is 'at least one employee does not receive a bonus'. The negation of PP, ¬P\neg P, is 'the company's profits increased by less than 10%'. Thus, the contrapositive is 'If at least one employee does not receive a bonus, then the company's profits increased by less than 10%'. Choice B is the converse (QPQ \rightarrow P). Choice C is the inverse (¬P¬Q\neg P \rightarrow \neg Q), with an incorrectly negated consequent. Choice D represents the condition that makes the original statement false (P¬QP \wedge \neg Q), not an equivalent statement.

Question 17

A computer program uses the logical condition: "(x>5)((y<3)(z=7))(x > 5) \land ((y < 3) \lor (z = 7))". For which set of values will this condition evaluate to TRUE?

  1. x=4x = 4, y=1y = 1, z=7z = 7
  2. x=6x = 6, y=2y = 2, z=5z = 5 (correct answer)
  3. x=7x = 7, y=4y = 4, z=6z = 6
  4. x=8x = 8, y=5y = 5, z=9z = 9
Explanation: When you encounter logical expressions with AND (\land) and OR (\lor) operators, you need to evaluate each component systematically. The expression (x>5)((y<3)(z=7))(x > 5) \land ((y < 3) \lor (z = 7)) requires two conditions: first, xx must be greater than 5, AND second, either yy must be less than 3 OR zz must equal 7 (or both). Let's work through the logic. For the entire expression to be TRUE, we need x>5x > 5 to be true AND at least one part of (y<3)(z=7)(y < 3) \lor (z = 7) to be true. Testing option B: x=6x = 6, y=2y = 2, z=5z = 5. First, x=6>5x = 6 > 5 ✓. Second, y=2<3y = 2 < 3 ✓, so (y<3)(z=7)(y < 3) \lor (z = 7) is true regardless of zz. Since both main conditions are satisfied, the entire expression evaluates to TRUE. Option A fails because x=4x = 4 is not greater than 5, making the first condition false. Even though z=7z = 7 satisfies the second part, the AND operator requires both conditions to be true. Option C fails the second condition: y=4y = 4 is not less than 3, and z=6z = 6 does not equal 7, making (y<3)(z=7)(y < 3) \lor (z = 7) false. Option D also fails the second condition: y=5y = 5 is not less than 3, and z=9z = 9 does not equal 7. Remember: with AND operations, all conditions must be satisfied; with OR operations, only one condition needs to be satisfied. Always check each component systematically.