Advertisements
Advertisements
प्रश्न
Find the negation of 10 + 20 = 30
Advertisements
उत्तर
The negation of 10 + 20 = 30 is 10 + 20 ≠ 30.
APPEARS IN
संबंधित प्रश्न
Using truth table prove that p ↔ q = (p ∧ q) ∨ (~p ∧ ~q).
Using truth table, prove the following logical equivalence:
(p ∧ q) → r ≡ p → (q → r)
Write down the following statements in symbolic form :
(A) A triangle is equilateral if and only if it is equiangular.
(B) Price increases and demand falls
Evaluate: ∫ x . log x dx
Write the following compound statement symbolically.
Nagpur is in Maharashtra and Chennai is in Tamil Nadu.
Write the following compound statement symbolically.
The angle is right angle if and only if it is of measure 90°.
Construct the truth table of the following statement pattern.
(p ∧ q) ↔ (q ∨ r)
Construct the truth table of the following:
∼ (∼p ∧ ∼q) ∨ q
Construct the truth table of the following:
[(∼p ∨ q) ∧ (q → r)] → (p → r)
Express the following statement in symbolic form.
e is a vowel or 2 + 3 = 5
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.
16 is an even number and 8 is a perfect square.
Write the negation of the following statement.
2 + 3 ≠ 5
Write the truth value of the negation of the following statement.
For every x ∈ N, x + 3 < 8.
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 ∨ (r ∧ s)] ∧ ~ [(r ∧ ~ s) ∧ q]
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 not holiday or Ram studies on holiday.
If p : He swims
q : Water is warm
Give the verbal statement for the following symbolic statement.
~ (p ∨ q)
If p : He swims
q : Water is warm
Give the verbal statement for the following symbolic statement.
q ∧ ~ p
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.
3 is prime number if 3 is perfect square number.
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
Rewrite the following statement without using conditional –
(Hint : p → q ≡ ∼ p ∨ q)
If price increases, then demand falls.
Write the negation of the following statement.
7 is prime number and Tajmahal is in Agra.
A biconditional statement is the conjunction of two ______ statements.
The negation of the statement (p ˄ q) `→` (r ˅ ∼ p) is ______.
Write the following compound statements symbolically.
Triangle is equilateral or isosceles
Without using truth table prove that:
~ (p ∨ q) ∨ (~ p ∧ q) ≡ ~ p
Write the following statement in symbolic form:
Milk is white if and only if the sky is not blue.
Without using truth table show that -
(p ˅ q) ˄ (∼p v ∼q) ≡ (p ∧ ∼q) ˄ (∼p ∧ q)
If p, q are true statement and r is false statement, then which of the following statements is a true statement.
The symbolic form of the following circuit is (where p, q represents switches S1 and S2 closed respectively)
Let p : 7 is not greater than 4 and q : Paris is in France by two statements. Then ∼(p ∨ q) is the statement ______
The inverse of the statement "If its quality is good. then it is expensive.", is ______
The negation of ∼s ∨ (∼r ∧ s) is equivalent to ______
The Boolean expression ∼(p ∨ q) ∨ (∼p ∧ q) is equivalent to ______
Write the following statement in symbolic form.
It is not true that `sqrt(2)` is a rational number.
Express the following compound statement symbolically:
Delhi is in India but Dhaka is not in Sri Lanka
Using truth table prove that:
~ (p `leftrightarrow` q) ≡ (p ∧ ~ q) ∨ (q ∧ ~ p)
Construct the truth table for the statement pattern:
[(p → q) ∧ q] → p
