167k views
5 votes
For all integers n, if n2 is odd, then n is odd.

Use a proof by contraposition, as in Lemma 1.1

check screen shoot

For all integers n, if n2 is odd, then n is odd. Use a proof by contraposition, as-example-1
For all integers n, if n2 is odd, then n is odd. Use a proof by contraposition, as-example-1
For all integers n, if n2 is odd, then n is odd. Use a proof by contraposition, as-example-2

1 Answer

3 votes
Check out the attachment I'm posting.
For all integers n, if n2 is odd, then n is odd. Use a proof by contraposition, as-example-1
User Kritzikratzi
by
7.8k points