00:01
In this question, we are given two statements that is px equal to x is prime number and q x comma y equal to x divides y.
00:09
And we are also given that domain of the following predicates is all integer that is greater than one.
00:16
So, for the statement, for every x that is not prime, there is some prime y that divides it.
00:24
Now, there are four parts of this question.
00:27
So in part a, we have to write the statement.
00:31
Predicate logic so this logic can be for every x that is not prime so this is not prime sign there is some prime y that means there is some prime y will be written like this that divides it so this is q y x so this is our answer of part a now in part b we are asked that in symbols write the negation of the symbolic statement written in part a.
01:04
So, negation will be like this of whole, that is for every x, there is this is not prime, there is some prime y, there is every y that divides it...