मराठी
महाराष्ट्र राज्य शिक्षण मंडळएचएससी विज्ञान (सामान्य) इयत्ता १२ वी

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

Advertisements
Advertisements

प्रश्न

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

उत्तर

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

∴ option (D) is not true

shaalaa.com
  या प्रश्नात किंवा उत्तरात काही त्रुटी आहे का?
2012-2013 (October)

APPEARS IN

संबंधित प्रश्‍न

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


Without using truth tabic show that ~(p v q)v(~p ∧ q) = ~p


Without using the truth table show that P ↔ q ≡ (p ∧ q) ∨ (~ p ∧ ~ q)


Write the Truth Value of the Negation of the Following Statement :

The Sun sets in the East. 


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


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)


Let p ∧ (q ∨ r) ≡ (p ∧ q) ∨ (p ∧ r). Then, this law is known as ______.


Without using truth table, show that

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


Without using truth table, show that

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


Without using truth table, show that

(p ∨ q) → r ≡ (p → r) ∧ (q → r)


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)


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


The logically equivalent statement of (p ∨ q) ∧ (p ∨ r) is ______ 


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


The statement pattern p ∧ (∼p ∧ q) is ______.


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


The negation of the Boolean expression (r ∧ ∼s) ∨ s is equivalent to: ______ 


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


Without using truth table prove that (p ∧ q) ∨ (∼ p ∧ q) v (p∧ ∼ q) ≡ p ∨ q


∼ ((∼ p) ∧ q) is equal to ______.


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


Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×