GATE CS 2019 (Forenoon) — Question 45

Discrete MathematicsPropositional and First-Order Quantifier LogicMCQ2 marks · −2/3 if wrongHard

Consider the first order predicate formula: \( \forall x[(\forall z \; z|x \Rightarrow ((z = x) \lor (z = 1))) \Rightarrow \exists w (w > x) \land (\forall z \; z|w \Rightarrow ((w = z) \lor (z = 1)))] \) Here ‘\( a|b \)’ denotes that ‘\( a \) divides \( b \)’, where \( a \) and \( b \) are integers. Consider the following sets: \( S_1 \): \( \{1, 2, 3, ..., 100\} \) \( S_2 \): Set of all positive integers \( S_3 \): Set of all integers Which of the above sets satisfy \( \phi \)?
  1. A
    \( S_1 \) and \( S_2 \)
  2. B
    \( S_1 \) and \( S_3 \)
  3. C
    \( S_2 \) and \( S_3 \)
  4. D
    \( S_1 \), \( S_2 \) and \( S_3 \)
Practise the full 2019-FN paper
Challenge a friend: WhatsApp Telegram
Recommended book · affiliate linkDiscrete Mathematics and Its Applications (Rosen)Logic, sets, relations, combinatorics and graph theory, with worked examples.
Practise more on Propositional and First-Order Quantifier LogicTimed, in the real exam interface · free to start

A GATE question every morning

One real past-paper question every morning for your branch, answer hidden until you tap. Free on Telegram.

Join
Stuck? Ask in the student group