All Exams  >   Commerce  >   Applied Mathematics for Class 11  >   All Questions

All questions of Unit 3 - Mathematical Reasoning for Commerce Exam

In order to prove the statement “p if and only if q” we need to show:
  • a)
    If p is false, then q is false.
  • b)
    If p is true, then q is false
  • c)
    If p is false, then q is true
  • d)
    If p is true, then q is true
Correct answer is option 'D'. Can you explain this answer?

It is necessary to provide evidence or logical reasoning that supports the truth of the statement. This can be done through various means, such as conducting experiments, analyzing data, presenting empirical evidence, or providing logical arguments based on facts and principles. The proof should be objective and verifiable, so that it can be accepted by others as valid and reliable. Additionally, it is important to consider counterarguments and address any potential objections or alternative explanations to strengthen the proof.

A compound statement with an ‘Or’ is false when both the component statements are ……
  • a)
    Same
  • b)
    True
  • c)
    Different
  • d)
    False
Correct answer is option 'D'. Can you explain this answer?

Dinesh Kotha answered
Any compound statement which has And as the connecting word is said to be false if all its component statements are false. A compound statement which has Or as the connecting word is said to be true if one of its component statement orboth the component statements is true.

Negation of the statement p→(q ∨ r) is
  • a)
    ∼p→∼(q ∨ r)
  • b)
    ∼p→∼(q ∧ r)
  • c)
    (q ∨ r)→ p
  • d)
    p ∧ (∼q ∧∼r )
Correct answer is option 'D'. Can you explain this answer?

The correct option is D p ∧ (∼q ∧∼r)
We know that, ∼(p → q)≡ p ∧ (∼q)
Also, negation of (q ∨ r) is (∼q∧∼r)
So, ∼(p→(q ∨ r))≡ p ∧(∼q∧∼r)

Let p and q be two propositions. Then the implication p↔∼q is true ,when
  • a)
    p is true and q is true
  • b)
    p is true and q is false
  • c)
    p is false and q is true
  • d)
    both p and q are false
Correct answer is option 'C'. Can you explain this answer?

Notation: Negation is denoted by the symbol ~
Bi-conditional:
Let, p and q are two simple propositions. If p and q both the propositions are either True or False then Bi-conditional gives the output as True otherwise if anyone is False then the output is False.
Notation: Bi-conditional is denoted by the symbol ⇔
Step-2: Truth Table:
The truth table is used to perform logical operations on given propositions. It is used to check whether the given propositional statement is either True or False. Using some of the logical operations like AND, OR, NOR, Conditional, and Bi-conditional.
Given p and q are both simple propositions
The truth table for p⇔~q is given below
pq~qp⇔~q
TT F  F
TFT   T
FTF   T
FFT   F
Where T is True and F is False.
From the above table, we can conclude p⇔~q is True if p is False and q is True.
Hence option 'C' is the correct answer.

The contra positive of a statement p ⇒ q, is the statement
  • a)
    ~q ⇒ ~p
  • b)
    ~ q ⇒ p
  • c)
    q ⇒ p
  • d)
    q⇒ ~ p
Correct answer is option 'A'. Can you explain this answer?

Rajat Patel answered
The contrapositive of a conditional statement of the form "If p then q" is "If ~q then ~p". . A conditional statement is not logically equivalent to its converse. Inverse: Suppose a conditional statement of the form "If p then q" is given.

For any three propositions p, q, and r, the proposition (p∧q)∧(q∧r) is true, when
  • a)
    p is true and q, r are false
  • b)
    p, q, r are all true
  • c)
    p, q are true and r is false
  • d)
    p, q, r are all false
Correct answer is option 'B'. Can you explain this answer?

Priyanka Basak answered
Q) ∨ (p ∧ r) is logically equivalent to the proposition (p ∨ r) ∧ (q ∨ r).

To show this, we can use a truth table:

| p | q | r | p ∨ q | p ∧ r | (p ∨ q) ∨ (p ∧ r) | (p ∨ r) ∧ (q ∨ r) |
|---|---|---|-------|-------|-------------------|-------------------|
| T | T | T | T | T | T | T |
| T | T | F | T | F | T | T |
| T | F | T | T | T | T | T |
| T | F | F | T | F | T | T |
| F | T | T | T | F | T | T |
| F | T | F | T | F | T | T |
| F | F | T | T | F | F | F |
| F | F | F | F | F | F | F |

As we can see from the truth table, the two propositions have the same truth values for all possible truth values of p, q, and r. Therefore, they are logically equivalent.

The contrapositive of (p∨q)→ r is
  • a)
    ∼r→(p∧q)
  • b)
    ∼r→∼(p∨q)
  • c)
    p→(p∧q)
  • d)
    ∼r→(∼p∧∼q)
Correct answer is option 'D'. Can you explain this answer?

Nishanth Gupta answered
Contrapositive of p→q is ∼q→∼p.
∴ Contrapositive of (p∨q)⇒r  is ∼r⇒∼(p∨q) i.e. ∼r⇒(∼p∧∼q).

p∧(q∧r) is logically equivalent to
  • a)
    (p∨q)∧r
  • b)
    (p∧q)∧r
  • c)
    p→(q∧r)
  • d)
    (p∨q)∨r
Correct answer is option 'B'. Can you explain this answer?

Maulik Verma answered
There are many words that begin with the letter "p." Here are a few examples:

1. Pizza
2. Penguin
3. Pencil
4. Party
5. Paint
6. Phone
7. Park
8. Puppy
9. Peach
10. Potato

The contrapositive of the inverse of p⇒ ~q is
  • a)
    p ⇒ q 
  • b)
    ~q ⇒ ~p 
  • c)
    ~q ⇒ p
  • d)
    ~p ⇒ ~q
Correct answer is option 'C'. Can you explain this answer?

Neha Sharma answered
The inverse of p ⇒ ∼q is ∼p ⇒ q 
The contrapositive of ∼p ⇒ q is ∼q ⇒ p. [∴ Contrapositive of p ⇒ q is∼q ⇒ p.]

The contrapositive of 2x + 3 = 9 ⇒ x ≠ 4 is
  • a)
    x ≠ 4, 2x+3 ≠ 9
  • b)
    x = 4, 2x+3 ≠ 9
  • c)
    x = 4, 2x+3 = 9
  • d)
    x ≠ 4, 2x+3 = 9
Correct answer is option 'B'. Can you explain this answer?

Bhavana Gupta answered
Explanation:

Contrapositive:
The contrapositive of a statement is formed by negating both the hypothesis and conclusion of the original statement and switching their order.

Given Statement:
2x + 3 = 9 → x ≠ 4

Contrapositive:
x = 4 → 2x + 3 ≠ 9

Explanation:
- The original statement states that if 2x + 3 = 9, then x is not equal to 4.
- The contrapositive of this statement states that if x is equal to 4, then 2x + 3 is not equal to 9.
- Therefore, the correct contrapositive of the given statement is option B: x = 4, 2x + 3 ≠ 9.

Conclusion:
The contrapositive of the given statement is correctly represented in option B.

Which of the following pairs is logically equivalent ?
  • a)
    Contrapositive, Converse
  • b)
    Conditional, Inverse
  • c)
    Inverse, Contrapositive
  • d)
    Conditional, Contrapositive
Correct answer is option 'D'. Can you explain this answer?

Akanksha Nair answered
Understanding Logical Equivalence
In logic, understanding the relationships between different forms of statements is crucial. The terms involved are:
- Conditional Statement: If P, then Q (P → Q)
- Contrapositive: If not Q, then not P (¬Q → ¬P)
- Converse: If Q, then P (Q → P)
- Inverse: If not P, then not Q (¬P → ¬Q)
Logically Equivalent Statements
Two statements are logically equivalent if they always yield the same truth value.
Relationship Between Conditional and Contrapositive
- The contrapositive of a conditional statement is always logically equivalent to the original conditional.
- This means that if the conditional statement (P → Q) is true, then its contrapositive (¬Q → ¬P) is also true, and vice versa.
Why Option D is Correct
- Conditional (P → Q): This asserts that if P is true, Q must also be true.
- Contrapositive (¬Q → ¬P): This asserts that if Q is false, P must also be false.
Both statements convey the same logical relationship, thus confirming their logical equivalence.
Other Options Explained
- Option A (Contrapositive, Converse): Not equivalent. The converse (Q → P) does not logically follow from the contrapositive.
- Option B (Conditional, Inverse): Not equivalent. The inverse (¬P → ¬Q) is not necessarily true if the conditional is true.
- Option C (Inverse, Contrapositive): Not equivalent. The inverse does not share the same truth value as the contrapositive.
Conclusion
Thus, option D, which pairs the Conditional and the Contrapositive, is the only correct answer as they are logically equivalent. Understanding these relationships is essential for mastering logical reasoning in mathematics and related fields.

Logical equivalent proposition to the proposition ∼(p∨q) is
  • a)
    ∼p↔∼q
  • b)
    ∼p∧∼q
  • c)
    ∼p∨∼q
  • d)
    ∼p→∼q
Correct answer is option 'B'. Can you explain this answer?

Nisha Banerjee answered
The logical equivalent proposition to a given proposition depends on the specific proposition in question. Please provide the proposition for which you would like to find the logical equivalent.

Which of the following is logically equivalent to ∼(p↔q) ?
  • a)
    (p∨q)∨(q∧p)
  • b)
    (p∨q)∨(q∧∼p)
  • c)
    (p∨∼q)∨(q∧∼p)
  • d)
    none of these
Correct answer is option 'C'. Can you explain this answer?

Sanaya Patel answered


Logical Equivalence Explanation:

Logical equivalence means two statements have the same truth values in all possible scenarios. In this case, we are looking for a statement that is logically equivalent to ∼(p↔q).

Option Analysis:

a) (p∨q)∨(q∧p)
This statement is not logically equivalent to ∼(p↔q) as it involves both OR and AND operations.

b) (p∨q)∨(q∧¬p)
This statement is not logically equivalent to ∼(p↔q) as it has a negation on p which is not present in the original statement.

c) (p∨¬q)∨(q∧¬p)
This statement is logically equivalent to ∼(p↔q) as it represents the exclusive OR operation. The exclusive OR (XOR) operation is true when the inputs are different, which is the same as the biconditional statement.

d) none of these
This option is incorrect as we have found a logically equivalent statement in option c.

Therefore, the correct answer is option c) (p∨¬q)∨(q∧¬p).

Which of the following is a proposition ?
  • a)
    Logic is an interesting subject
  • b)
    I am a lion
  • c)
    A half open door is half closed
  • d)
    A triangle is a circle and 10 is a prime number
Correct answer is option 'D'. Can you explain this answer?

Kritika Khanna answered
Proposition in Logic

Definition of Proposition:
A proposition is a statement that is either true or false.

Examples of Statements:
- Logic is an interesting subject.
- I am a lion.
- A half-open door is half closed.
- A triangle is a circle and 10 is a prime number.

Explanation:
Out of the four given statements, only option 'D' is a proposition because it can be evaluated as either true or false. A triangle cannot be a circle and 10 is not a prime number, so the statement is false.

Option 'A' is not a proposition because it is a subjective statement and cannot be evaluated as true or false. It may be interesting to some people and not to others.

Option 'B' is not a proposition because it is a false statement. The speaker is not actually a lion.

Option 'C' is not a proposition because it is an ambiguous statement. The meaning of "half-open" can vary depending on the context, so it cannot be evaluated as true or false.

Therefore, the only proposition in the given options is option 'D'.

Which of the following sentences is a statement ?
  • a)
    2 is the smallest prime number
  • b)
    Aarushi is a pretty girl
  • c)
    What are you doing 
  • d)
    Oh ! It is amazing
Correct answer is option 'A'. Can you explain this answer?

Explanation:

A statement is a declarative sentence that can be either true or false. It gives some information or makes some assertion about the subject. The subject can be a person, place, thing, or idea. Let's analyze the given options to identify which one is a statement.

a) 2 is the smallest prime number - This is a declarative sentence that gives some information about the number 2. It is a statement.

b) Aarushi is a pretty girl - This is also a declarative sentence that makes an assertion about a person named Aarushi. It is a statement.

c) What are you doing? - This is an interrogative sentence that asks a question. It is not a statement.

d) Oh! It is amazing - This is an exclamatory sentence that expresses a strong emotion. It is not a statement.

Therefore, the correct answer is option 'A' - 2 is the smallest prime number, which is a statement.

Consider the proposition: “If we control population growth, we prosper “. Negative of this proposition is
  • a)
    If we do not control population growth but we prosper
  • b)
    We control population but we do not prosper
  • c)
    If we control population, we do not prosper
  • d)
    We do not control population but we prosper
Correct answer is option 'B'. Can you explain this answer?

"Everyone loves pizza."
This proposition is a general statement that claims that every person loves pizza. However, it is not necessarily true as not everyone may love pizza. People have different preferences when it comes to food, and there may be individuals who do not enjoy or love pizza. Therefore, this proposition is not accurate.

Chapter doubts & questions for Unit 3 - Mathematical Reasoning - Applied Mathematics for Class 11 2025 is part of Commerce exam preparation. The chapters have been prepared according to the Commerce exam syllabus. The Chapter doubts & questions, notes, tests & MCQs are made for Commerce 2025 Exam. Find important definitions, questions, notes, meanings, examples, exercises, MCQs and online tests here.

Chapter doubts & questions of Unit 3 - Mathematical Reasoning - Applied Mathematics for Class 11 in English & Hindi are available as part of Commerce exam. Download more important topics, notes, lectures and mock test series for Commerce Exam by signing up for free.

Top Courses Commerce