Consider the first order predicate formula πœ‘: βˆ€π‘₯ [(βˆ€π‘§ 𝑧|π‘₯ β‡’ ((𝑧 = π‘₯) βˆ¨β€¦

GATE Β· 2019 Β· CS Β· Computer Science & IT

Consider the first order predicate formula πœ‘:

βˆ€π‘₯ [(βˆ€π‘§ 𝑧|π‘₯ β‡’ ((𝑧 = π‘₯) ∨ (𝑧 = 1))) β‡’ βˆƒπ‘€ (𝑀 > π‘₯) ∧ (βˆ€π‘§ 𝑧|𝑀 β‡’ ((𝑀 = 𝑧) ∨ (𝑧 = 1)))]

Here β€˜a|b’ denotes that β€˜a divides b’, where a and b are integers. In this question, count only positive divisors a; x, z, and w range over the stated set.

S1. {1,2,3, … , 100}

S2. Set of all positive integers

S3. Set of all integers

Which of the above sets satisfy πœ‘?

  1. A.

    S1 and S2

  2. B.

    S1 and S3

  3. C.

    S2 and S3

  4. D.

    S1, S2 and S3

Attempted by 107 students.

Sign up free to check your answer

Sign up free

Explore the full course: Gate Guidance By Sanchit Sir

Loading lesson…