Advertisements
Advertisements
प्रश्न
Find the truth value of the following statement.
Neither 27 is a prime number nor divisible by 4.
उत्तर
Let p : 27 is a prime number.
q : 27 is divisible by 4.
The truth values of p and q are F and F respectively.
The given statement in symbolic form is ~ p ∧ ~ q.
∴ ~ p ∧ ~ q ≡ ~ F ∧ ~ F ≡ T ∧ T ≡ T
∴ Truth value of the given statement is T.
APPEARS IN
संबंधित प्रश्न
Using truth table prove that ∼p ˄ q ≡ (p ˅ q) ˄ ∼p
Write the following compound statement symbolically.
Nagpur is in Maharashtra and Chennai is in Tamil Nadu.
Write the following compound statement symbolically.
Hima Das wins gold medal if and only if she runs fast.
Construct the truth table of the following statement pattern.
(p ∧ ∼q) ↔ (p → q)
Construct the truth table of the following:
p → (q → p)
Determine the truth values of p and q in the following case:
(p ∨ q) is T and (p ∨ q) → q is F
Determine the truth values of p and q in the following case:
(p ∧ q) is F and (p ∧ q) → q is T
Write the following statement in symbolic form.
If triangle is equilateral then it is equiangular.
Write the following statement in symbolic form.
If Kutub-Minar is in Delhi then Taj-Mahal is in Agra.
Find the truth value of the following statement.
Every accountant is free to apply his own accounting rules if and only if machinery is an asset.
If p and q are true and r and s are false, find the truth value of the following compound statement.
(p → q) ∨ (r ∧ s)
If p and q are true and r and s are false, find the truth value of the following compound statement.
(p → q) ↔ ~(p ∨ q)
If p : He swims
q : Water is warm
Give the verbal statement for the following symbolic statement.
~ (p ∨ q)
Fill in the blanks :
Conjunction of two statement p and q is symbolically written as ______.
State whether the following statement is True or False:
The negation of 10 + 20 = 30 is, it is false that 10 + 20 ≠ 30.
Assuming the first statement p and second as q. Write the following statement in symbolic form.
3 is prime number if 3 is perfect square number.
Assuming the first statement p and second as q. Write the following statement in symbolic form.
If Kiran drives the car, then Sameer will walk.
Assuming the first statement p and second as q. Write the following statement in symbolic form.
To be brave is necessary and sufficient condition to climb the Mount Everest.
Assuming the first statement p and second as q. Write the following statement in symbolic form.
It is not true that Ram is tall and handsome.
If p : Proof is lengthy.
q : It is interesting.
Express the following statement in symbolic form.
It is interesting iff the proof is lengthy.
Assuming the following statement.
p : Stock prices are high.
q : Stocks are rising.
to be true, find the truth value of the following.
Stock prices are high or stocks are not rising iff stocks are rising.
Rewrite the following statement without using the connective ‘If ... then’.
If it rains then the principal declares a holiday.
Consider the following statements.
- If D is dog, then D is very good.
- If D is very good, then D is dog.
- If D is not very good, then D is not a dog.
- If D is not a dog, then D is not very good.
Identify the pairs of statements having the same meaning. Justify.
A biconditional statement is the conjunction of two ______ statements.
Write the negation of p → q
Write the following statements in symbolic form.
If Qutub – Minar is in Delhi then Taj-Mahal is in Agra
Given 'p' and 'q' as true and 'r' as false, the truth values of p v (q ∧ ~r) and (p → r) ∧ q are respectively
Which of the following is false?
The negation of ∼s ∨ (∼r ∧ s) is equivalent to ______
The statement, 'If I go to school, then I will get knowledge' is equivalent to ______
Write the following statement in symbolic form.
It is not true that `sqrt(2)` is a rational number.
Write the following statement in symbolic form.
4 is an odd number if 3 is not a prime factor of 6.
The statement ∼(p ↔ ∼q) is ______.
Write the contrapositive of the inverse of the statement:
‘If two numbers are not equal, then their squares are not equal’.
Using truth table prove that:
~ (p `leftrightarrow` q) ≡ (p ∧ ~ q) ∨ (q ∧ ~ p)
