English

If a = {2, 3, 4, 5, 6}, Then Which of the Following is Not True?

Advertisements
Advertisements

Question

If A = {2, 3, 4, 5, 6}, then which of the following is not true?

(A) ∃ x ∈ A such that x + 3 = 8

(B) ∃ x ∈ A such that x + 2 < 5

(C) ∃ x ∈ A such that x + 2 < 9

(D) ∀ x ∈ A such that x + 6 ≥ 9

Advertisements

Solution

Since, x = 2 ∈ A does not satisfy x + 6 ≥ 9.

∴ option (D) is not true

shaalaa.com
  Is there an error in this question or solution?
2012-2013 (October)

APPEARS IN

RELATED QUESTIONS

The negation of p ∧ (q → r) is ______________.


Write the truth value of the negation of the following statement : 

cos2 θ + sin2 θ = 1, for all θ ∈ R 


Rewrite the following statement without using if ...... then.

It 2 is a rational number then `sqrt2` is irrational number.


Rewrite the following statement without using if ...... then.

It f(2) = 0 then f(x) is divisible by (x – 2).


Without using truth table prove that:

(p ∧ q) ∨ (∼ p ∧ q) ∨ (p ∧ ∼ q) ≡ p ∨ q


Using rules in logic, prove the following:

∼p ∧ q ≡ (p ∨ q) ∧ ∼p


Using the rules in logic, write the negation of the following:

(p ∨ q) ∧ (q ∨ ∼r)


Using the rules in logic, write the negation of the following:

(p → q) ∧ r


Without using truth table, show that

p ∧ [(~ p ∨ q) ∨ ~ q] ≡ p


Without using truth table, show that

~ [(p ∧ q) → ~ q] ≡ p ∧ q


Without using truth table, show that

~r → ~ (p ∧ q) ≡ [~ (q → r)] → ~ p


Using the algebra of statement, prove that

[p ∧ (q ∨ r)] ∨ [~ r ∧ ~ q ∧ p] ≡ p


Using the algebra of statement, prove that

(p ∧ q) ∨ (p ∧ ~ q) ∨ (~ p ∧ ~ q) ≡ (p ∨ ~ q)


The statement pattern p ∧ ( q v ~ p) is equivalent to ______.


For any two statements p and q, the negation of the expression (p ∧ ∼q) ∧ ∼p is ______ 


The negation of p → (~p ∨ q) is ______ 


(p ∧ ∼q) ∧ (∼p ∧ q) is a ______.


The logical statement [∼(q ∨ ∼r) ∨ (p ∧ r)] ∧ (q ∨ p) is equivalent to: ______ 


If p ∨ q is true, then the truth value of ∼ p ∧ ∼ q is ______.


Negation of the Boolean expression `p Leftrightarrow (q \implies p)` is ______. 


Without using truth table, prove that:

[p ∧ (q ∨ r)] ∨ [∼r ∧ ∼q ∧ p] ≡ p


Without using truth table, prove that : [(p ∨ q) ∧ ∼p] →q is a tautology.


The simplified form of [(~ p v q) ∧ r] v [(p ∧ ~ q) ∧ r] is ______.


The statement p → (q → p) is equivalent to ______.


The logically equivalent statement of \[\left(\sim p\wedge q\right)\vee\left(\sim p\wedge\sim q\right)\] \[\vee\left(\ p\wedge\sim q\right)\] is


Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×