Proof by Contradiction and Contraposition

In summary, the conversation discusses the contrapositive, truth value, and proof by contradiction of the statement "If n=4q+1 or n=4q+3 for some q \in Z, then n is odd." The contrapositive is "If n is even, then n \neq 4q+1 or n \neq 4q+3 for all q \in Z." The truth value of the contrapositive for all n \in N is unknown, but it can be proven true based on the intuition gained from searching for a counterexample. The converse of the statement, "If n is odd, then n=4q+1 or n=4q+3 for
  • #1
roam
1,271
12

Homework Statement



For any integer n, let A(n) be the statement:
"If n=4q+1 or n=4q+3 for some [tex]q \in Z[/tex], then n is odd."

(a) Write down the contrapositive of A(n).
(b) Is the contrapositive of A(n) true for all [tex]n \in N[/tex]? Give brief reasons.
(c) Use proof by contradiction to show that the converse of A(n) is true for all [tex]n \in Z[/tex].

Homework Equations





The Attempt at a Solution



(a)

The contrapositive of [tex]A \Rightarrow B[/tex] is [tex]\neg B \Rightarrow \neg A[/tex], so in this case:

A:= If n=4q+1 or n=4q+3 for some [tex]q \in Z[/tex]
B:= n is odd

The contrapositive would be:

If n is even then [tex]n \neq 4q+1[/tex] and [tex]n \neq 4q+3[/tex] for all [tex]q \in Z[/tex].

Is this right?

(b)

I have no idea how to answer this one.

(c)

The converse of the A(n) is: "If n is odd, then n=4q+1 or n=4q+3 for some [tex]q \in Z[/tex]"

A:= n is odd
B:= n=4q+1 or n=4q+3

Now this is what I have to show for a proof by contradiction:
[tex](A \Rightarrow B) \Leftrightarrow \neg (A \wedge \neg B)[/tex]

[tex]A \wedge \neg B[/tex] = n is odd and [tex]n \neq 4q+1[/tex] or [tex]n \neq 4q+3[/tex]

Of course, n is odd [tex]\Leftrightarrow (\exists m \in Z)(2m+1)[/tex]

So, I'm stuck here & I'm not sure exactly how to prove that [tex]A \wedge \neg B[/tex] is false. Any help is appreciated.
 
Physics news on Phys.org
  • #2
a) Looks good
b) Search for a counterexample. If you can't, try proving that it's true based on the intuition gained from the search for the counterexample.
c) Any integer m is either even or odd.
 
  • #3
snipez90 said:
a) Looks good
b) Search for a counterexample. If you can't, try proving that it's true based on the intuition gained from the search for the counterexample.
c) Any integer m is either even or odd.

About part (C), I need to prove this wrong:

[tex]A \wedge \neg B[/tex] = "n is odd and [tex]n \neq 4q+1[/tex] or [tex]n \neq 4q+3[/tex]"

A:= n is odd
B:= n=4q+1 or n=4q+3

Suppose A and [tex]\neg B[/tex] are true; n is odd. n is odd if n=2m+1 and even if n=2m. However n=4q+1 and n=4q+3 are both odd since:

n=4q+1 = 2(2q)+1

And 4q+3= 2(2q+1)+1

[tex]2q+1 \in Z[/tex] and [tex]2q \in Z[/tex]. Hence [tex]\neg B[/tex] doesn't imply A, so the converse of A(n) is true for all [tex]n \in Z[/tex].

Is this right??
 

Related to Proof by Contradiction and Contraposition

What is proof by contradiction?

Proof by contradiction is a method of mathematical proof in which a statement is proven to be true by assuming its opposite and showing that this assumption leads to a contradiction. This proves that the original statement must be true.

What is the difference between proof by contradiction and proof by contraposition?

Proof by contraposition is a specific type of proof by contradiction in which a statement is proven to be true by showing that its contrapositive statement, which is logically equivalent, must also be true. In contrast, proof by contradiction does not necessarily involve proving a statement's contrapositive.

When is proof by contradiction used?

Proof by contradiction is commonly used in mathematics and logic to prove the existence or uniqueness of a solution to a problem. It is also used to prove the truth of statements that are difficult to prove directly.

What are the steps involved in a proof by contradiction?

The first step in proof by contradiction is to assume the opposite of the statement to be proven. Then, using logical reasoning and previous known facts, the assumption is shown to lead to a contradiction. This proves that the original statement must be true. The final step is to state the original statement as the conclusion of the proof.

What are the limitations of proof by contradiction?

Proof by contradiction can only be used to prove the truth of a statement, it cannot be used to prove the statement to be false. Additionally, it may be more complex and less intuitive than other proof methods, and may require a strong understanding of logical reasoning and mathematical concepts.

Similar threads

  • Calculus and Beyond Homework Help
Replies
3
Views
721
  • Calculus and Beyond Homework Help
Replies
24
Views
1K
  • Calculus and Beyond Homework Help
Replies
9
Views
2K
  • Calculus and Beyond Homework Help
Replies
1
Views
699
  • Calculus and Beyond Homework Help
Replies
1
Views
720
  • Precalculus Mathematics Homework Help
Replies
10
Views
1K
  • Calculus and Beyond Homework Help
Replies
2
Views
517
  • Calculus and Beyond Homework Help
Replies
6
Views
430
  • Calculus and Beyond Homework Help
Replies
3
Views
875
  • Calculus and Beyond Homework Help
Replies
3
Views
701
Back
Top