Advertisements
Advertisements
प्रश्न
Assuming the first statement p and second as q. Write the following statement in symbolic form.
x3 + y3 = (x + y)3 if xy = 0.
उत्तर
Let p : x3 + y3 = (x + y)3
q : xy = 0
∴ p ↔ q is the symbolic form of the given statement.
APPEARS IN
संबंधित प्रश्न
Using truth table prove that p ↔ q = (p ∧ q) ∨ (~p ∧ ~q).
Write the following compound statement symbolically.
x is not irrational number but is a square of an integer.
Construct the truth table of the following:
p → (q → p)
Construct the truth table of the following:
(∼p ∨ ∼q) ↔ [∼(p ∧ q)]
Express the following statement in symbolic form.
Milk is white or grass is green.
Express the following statement in symbolic form.
Even though it is cloudy, it is still raining.
Write the truth value of the following statement.
The Himalayas are the highest mountains but they are part of India in the North East.
Write the negation of the following statement.
All men are animals.
Write the truth value of the negation of the following statement.
London is in England.
Write the following statement in symbolic form.
It is not true that “i” is a real number.
Write the following statement in symbolic form.
Milk is white if and only if the sky is not blue.
Find the truth value of the following statement.
It is not true that 3 − 7i is a real number.
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)
Assuming that the following statement is true,
p : Sunday is holiday,
q : Ram does not study on holiday,
find the truth values of the following statements.
If Sunday is not holiday then Ram studies on holiday.
Assuming that the following statement is true,
p : Sunday is holiday,
q : Ram does not study on holiday,
find the truth values of the following statements.
Sunday is a holiday and Ram studies on holiday.
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 ______.
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.
Let p : Sachin wins the match.
q : Sachin is a member of Rajya Sabha.
r : Sachin is happy.
Write the verbal statement of the following.
p → r
Let p : Sachin wins the match.
q : Sachin is a member of Rajya Sabha.
r : Sachin is happy.
Write the verbal statement of the following.
∼ p ∨ q
Let p : Sachin wins the match.
q : Sachin is a member of Rajya Sabha.
r : Sachin is happy.
Write the verbal statement of the following.
p→(q ∨ r)
Let p : Sachin wins the match.
q : Sachin is a member of Rajya Sabha.
r : Sachin is happy.
Write the verbal statement of the following.
∼ (p ∨ q) ∧ r
Write the negation of the following.
An angle is a right angle if and only if it is of measure 90°.
Write the negation of the following.
If x ∈ A ∩ B, then x ∈ A and x ∈ B.
If p → q is an implication, then the implication ∼ q → ∼ p is called its
Without using truth table prove that:
~ (p ∨ q) ∨ (~ p ∧ q) ≡ ~ p
Write the negation of the statement “An angle is a right angle if and only if it is of measure 90°”
Without using truth table show that -
(p ˅ q) ˄ (∼p v ∼q) ≡ (p ∧ ∼q) ˄ (∼p ∧ q)
Write the negation of the statement “An angle is a right angle if and only if it is of measure 90°”
If c denotes the contradiction then the dual of the compound statement ∼p ∧ (q ∨ c) is ______
If p and q are true and rands are false statements, then which of the following is true?
The negation of ∼s ∨ (∼r ∧ s) is equivalent to ______
The statement, 'If I go to school, then I will get knowledge' is equivalent to ______
Conditional of p → q is equivalent to p → ∼ q.
Let p, q and r be any three logical statements. Which of the following is true?
From the following set of statements, select two statements which have similar meaning.
- If a man is judge, then he is honest.
- If a man is not a judge, then he is not honest.
- If a man is honest, then he is a judge.
- If a man is not honest, then he is not a judge.
Using truth table prove that:
~ (p `leftrightarrow` q) ≡ (p ∧ ~ q) ∨ (q ∧ ~ p)
