StudyFox
कीमतेंब्लॉगएक्सटेंशनमुफ़्त टूल
  • कीमतें
  • ब्लॉग
  • एक्सटेंशन
  • मुफ़्त टूल
  • शुरू करेंसाइन इन
StudyFox

अपने नोट्स, PDF और स्लाइड्स को फ़्लैशकार्ड, क्विज़, नोट्स और माइंड मैप में बदलें।

StudyFox खोलें

स्टडी टूल्स

  • होमवर्क हेल्पर
  • नोट मेकर
  • फ़्लैशकार्ड मेकर
  • क्विज़ मेकर
  • माइंड मैप मेकर

प्रोडक्ट

  • कीमतें
  • Chrome एक्सटेंशन
  • मुफ़्त एक्सटेंशन
  • स्टडी सेट देखें
  • ब्लॉग

सहायता

  • सहायता केंद्र
  • संपर्क करें
  • गोपनीयता नीति
  • सेवा की शर्तें

तुलना करें

  • Chegg का विकल्प
  • Course Hero का विकल्प
  • Coursology का विकल्प
  • Photomath का विकल्प
  • Gauthmath का विकल्प
  • PhotoSolve का विकल्प
  • CollegeTools का विकल्प
  • Transcript का विकल्प
  • SmartSolve का विकल्प
  • Homeworkify का विकल्प
  • AnswersAi का विकल्प
  • StudyX का विकल्प
  • Quizlet का विकल्प
  • Anki का विकल्प
  • Knowt का विकल्प
  • Brainscape का विकल्प
  • सभी तुलनाएँ

© 2026 StudyFox AI. सर्वाधिकार सुरक्षित।

  • X
  • Discord
  • Instagram
ExploreMathDiscrete MathDiscrete Math Quiz: Logical Equivalences, Quantifiers and Proof Methods

Quiz · Medium

Discrete Math Quiz: Logical Equivalences, Quantifiers and Proof Methods

Twenty questions on logical equivalences, quantifier negation, valid and invalid arguments, and choosing a proof technique, for first-year discrete math.

by Kill h.22 questionsCreated Nov 20, 2026, 08:28 PM
Discrete Math· Logic & ProofsTags#logic#quantifiers#proofs#induction

22 questions

  1. 1

    To prove 'if is odd then n is odd' the neatest approach is

    • A

      direct proof starting from n^2 = 2k + 1

    • B

      proof by induction on n

    • C

      proof by exhaustion over small n

    • proof by contrapositive: assume n is even

    Assuming n even makes n = 2k and n^2 = 4k^2 even, finishing in one line. The direct route requires taking a square root of an odd number, which is awkward.

  2. 2

    Which statement is logically equivalent to ?

    • A

    • B

    • C

    is false only when p is true and q is false, exactly like . is the converse and is the inverse; both can differ from . is the negation of .

  3. 3

    What is the negation of 'All birds can fly'?

    • Some bird cannot fly

    • B

      No bird can fly

    • C

      All birds cannot fly

    • D

      Some bird can fly

    The negation of a universal statement is an existential one: there exists a bird that cannot fly. 'No bird can fly' is far stronger, and 'All birds cannot fly' says the same as it.

  4. 4

    The shaded Venn diagram shows the sets where p (in A) and q (in B) are combined by which connective?

    • A

      AND

    • B

      OR

    • XOR

    • D

      NAND

    The overlap is left unshaded and the two crescents are shaded: true when exactly one of p, q holds. That is XOR. OR would shade the overlap too.

  5. 5

    Which translation is correct for 'Some student likes pizza' with S(x): x is a student, P(x): x likes pizza?

    • A

    • C

    • D

    Existential statements pair with conjunction. is true if any non-student exists, which says nothing about students.

  6. 6

    Argument: 'If it rains, the match is cancelled. The match is cancelled. Therefore it rained.' This is

    • A

      valid (modus ponens)

    • B

      valid (modus tollens)

    • C

      invalid (denying the antecedent)

    • invalid (affirming the consequent)

    From p -> q and q you cannot infer p: the match might be cancelled for another reason. This is the fallacy of affirming the consequent. Denying the antecedent would start from 'not p'.

  7. 7

    How many rows does the truth table of have?

    • A

      4

    • B

      6

    • 8

    • D

      9

    Three variables p, q, r give 2^3 = 8 rows. The number of operators does not matter, only the number of distinct variables.

  8. 8

    Over the real numbers, which statement is TRUE?

    • B

    • C

    • D

    For each x take y = -x. In the first statement one y would have to cancel every x at once, which is impossible.

  9. 9

    The contrapositive of 'If a number is divisible by 6, then it is divisible by 3' is

    • A

      If a number is divisible by 3, it is divisible by 6

    • If a number is not divisible by 3, it is not divisible by 6

    • C

      If a number is not divisible by 6, it is not divisible by 3

    • D

      A number is divisible by 6 and not divisible by 3

    Contrapositive: swap and negate both parts. Choice A is the converse (false: 9), choice B the inverse (false: 3), choice D the negation.

  10. 10

    Which of these is a tautology?

    • A

    • C

    • D

    This is modus ponens as a statement: if p and p -> q are true then q is true. The others fail: choice A when p is true and q false, C when q true and p false, D when q true and p false.

  11. 11

    In a proof of by contradiction, which assumption is made at the start?

    • in lowest terms with integers a, b

    • B

      is an integer

    • C

      and are both even

    • D

    We assume the opposite of the claim (rational) and write it in lowest terms; the contradiction comes from showing both a and b are even.

  12. 12

    The negation of is

    • A

    • B

    • D

    Flip the quantifier and negate the implication: not(P -> Q) = P and not Q. Choice D is the original statement rewritten, not its negation.

  13. 13

    Which expression is equivalent to (exclusive or)?

    • A

    • B

    • D

    XOR is true exactly when p and q differ, so it is the negation of the biconditional.

  14. 14

    An induction proof that holds for all should use base case

    • A

      n = 0

    • n = 5

    • C

      n = 1

    • D

      n = 4

    The claim starts at n = 5: 32 > 25. It fails at n = 2, 3, 4 (4 = 4, 8 < 9, 16 = 16), so n = 4 would be a false base case, and the step from small n cannot work either.

  15. 15

    True or false: if is true and q is true, then p must be true.

    • A

      True

    • False

    False: when q is true, p -> q is true whatever p is. Concluding p is the fallacy of affirming the consequent.

  16. 16

    Strong induction is most natural to prove which claim?

    • A

      1 + 2 + ... + n = n(n+1)/2

    • B

      n^3 - n is divisible by 3

    • C

      2^n > n

    • Every integer greater than 1 is a product of primes

    The factors of n can be anywhere below n, so you need P(j) for all smaller j. The other three only use P(k) in the step for k + 1.

  17. 17

    In an empty domain, the statement is

    • true (vacuously)

    • B

      false

    • C

      undefined

    • D

      equal to

    A universal claim can only be refuted by an element that fails; with no elements it can't fail. The existential statement is false for an empty domain.

  18. 18

    The argument 'All mammals are warm-blooded. Whales are mammals. So whales are warm-blooded.' uses

    • universal instantiation then modus ponens

    • B

      existential generalization only

    • C

      disjunctive syllogism

    • D

      resolution

    Instantiate 'all mammals are warm-blooded' to whales (mammal(whale) -> warm(whale)), then modus ponens with mammal(whale).

  19. 19

    A statement is a contingency if it is

    • A

      true under every assignment

    • B

      false under every assignment

    • C

      not a proposition

    • true under some assignments and false under others

    Tautologies are always true, contradictions always false. Contingencies depend on the assignment, like p AND q.

  20. 20

    Which connective is functionally complete on its own?

    • A

    • NAND ()

    • C

    • D

    NAND alone can build NOT, AND, OR. AND, OR and implication cannot express negation by themselves.

  21. 21

    Which is an example of a vacuous truth?

    • A

      Every even prime is greater than 2

    • B

      Every prime is odd

    • Every element of the empty set is a prime

    • D

      Some element of the empty set is prime

    With no elements, nothing can violate the universal claim. 'Every prime is odd' is false (2); 'every even prime is greater than 2' is false (2 is the even prime); the last is an existential claim, false for the empty set.

  22. 22

    Treat each circle as the set where p or q is true. Which diagram shades ?

    • B
    • C

    AND is the overlap only (the intersection). The first diagram shades both circles entirely (OR); the third shades both circles except the overlap (XOR).