Scribd
Upload
19 views2 pages

Q2

The document discusses different types of logical statements associated with a theorem including the converse, inverse, and contrapositive. It then provides examples of each and discusses four main types of proofs used in mathematics: direct proof, proof by contrapositive, proof by contradiction, and proof by induction.

Uploaded by

Anup Talukdar
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
19 views2 pages

Q2

The document discusses different types of logical statements associated with a theorem including the converse, inverse, and contrapositive. It then provides examples of each and discusses four main types of proofs used in mathematics: direct proof, proof by contrapositive, proof by contradiction, and proof by induction.

Uploaded by

Anup Talukdar
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

Q2-a mathematic theoram -converse,inverse and contra positive ,proof and its types

ANS- In mathematics, logical statements often come with associated statements such as the
converse, inverse, and contrapositive. Let’s explore these concepts with a theorem and its
proof types.
Original Statement (Theorem)
If P, then Q (P → Q)
Associated Statements
1. Converse: The converse of a statement is formed by reversing the hypothesis and
conclusion.
-Converse: If Q, then P (Q → P)
2. Inverse: The inverse of a statement is formed by negating both the hypothesis and
conclusion.
- Inverse: If not P, then not Q (¬P → ¬Q)
3. Contrapositive: The contrapositive of a statement is formed by negating both the
hypothesis and conclusion of the converse.
- Contrapositive: If not Q, then not P (¬Q → ¬P)

Example Theorem: If a number is even, then it is divisible by 2. If a number is even, then it


is divisible by 2.

 P: A number is even.
 Q: A number is divisible by 2.

Converse

If a number is divisible by 2, then it is even.

 Q→P

Inverse

If a number is not even, then it is not divisible by 2.

 ¬P → ¬Q

Contrapositive

If a number is not divisible by 2, then it is not even.

 ¬Q → ¬P
Proof and Its Types

A proof is a logical argument that verifies the truth of a theorem. There are several types of
proofs commonly used in mathematics:

1. Direct Proof: Demonstrates the truth of a given statement by straightforward logical


deductions from known facts, axioms, or previously proven statements.
o Example:
 Statement: If a number is even, then it is divisible by 2.
 Proof: Let nnn be an even number. By definition, n=2kn = 2kn=2k for
some integer kkk. Hence, nnn is divisible by 2.
2. Proof by Contrapositive: Proves a statement by proving its contrapositive. If the
contrapositive is true, the original statement must be true.
o Example:
 Statement: If a number is not divisible by 2, then it is not even.
 Proof: Let nnn be a number not divisible by 2. This means nnn is of
the form 2k+12k + 12k+1 for some integer kkk, implying nnn is odd
and therefore not even.
3. Proof by Contradiction: Assumes the negation of the statement to be proven and
derives a contradiction from this assumption, thus proving the original statement must
be true.
o Example:
 Statement: If a number is even, then it is divisible by 2.
 Proof: Assume the negation: A number is even and not divisible by 2.
Let nnn be an even number, so n=2kn = 2kn=2k for some integer kkk.
If nnn is not divisible by 2, this contradicts the definition of an even
number. Hence, the original statement is true.
4. Proof by Induction: A method often used to prove statements about integers. It
involves proving a base case and an inductive step that shows if the statement holds
for one integer, it holds for the next.
o Example:
 Statement: For all n∈Nn \in \mathbb{N}n∈N, 2n2n2n is even.
 Proof:
 Base Case: For n=1n = 1n=1, 2×1=22 \times 1 = 22×1=2,
which is even.
 Inductive Step: Assume 2k2k2k is even for some kkk. Then
2(k+1)=2k+22(k + 1) = 2k + 22(k+1)=2k+2, which is even.
Hence, by induction, the statement is true for all nnn.

These are fundamental logical tools and proof methods used in mathematics to establish the
validity of theorems and statements

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy