menu
Qammunity.org
Login
Register
My account
Edit my Profile
Private messages
My favorites
For all integers n, if n2 is odd, then n is odd. Use a proof by contraposition, as in Lemma 1.1. Let n be an integer. Suppose that n is even, i.e., n =
Ask a Question
Questions
Unanswered
Tags
Ask a Question
For all integers n, if n2 is odd, then n is odd. Use a proof by contraposition, as in Lemma 1.1. Let n be an integer. Suppose that n is even, i.e., n =
asked
Jan 22, 2018
178k
views
4
votes
For all integers n, if n2 is odd, then n is odd. Use a proof by contraposition, as in Lemma 1.1. Let n be an integer. Suppose that n is even, i.e., n =
Mathematics
college
Igor Kroitor
asked
by
Igor Kroitor
8.1k
points
answer
comment
share this
share
0 Comments
Please
log in
or
register
to add a comment.
Please
log in
or
register
to answer this question.
1
Answer
3
votes
Let's assume that the statement "if n^2 is odd, then is odd" is false. That would mean "n^2 is odd" leads to "n is even"
Suppose n is even. That means n = 2k where k is any integer.
Square both sides
n = 2k
n^2 = (2k)^2
n^2 = 4k^2
n^2 = 2*(2k^2)
The expression 2(2k^2) is in the form 2m where m is an integer (m = 2k^2) which shows us that n^2 is also even.
So this contradicts the initial statement which forces n to be odd.
VRC
answered
Jan 29, 2018
by
VRC
7.7k
points
ask related question
comment
share this
0 Comments
Please
log in
or
register
to add a comment.
← Prev Question
Next Question →
Related questions
asked
Nov 6, 2017
54.4k
views
Prove: For all integers n, if n2 is odd, then n is odd. Use a proof by contraposition, as in Lemma 1.1.
Viktor Stojanov
asked
Nov 6, 2017
by
Viktor Stojanov
8.2k
points
Mathematics
high-school
1
answer
1
vote
54.4k
views
asked
Mar 8, 2018
106k
views
Prove: For all integers n, if n2 is odd, then n is odd. Use a proof by contraposition, as in Lemma 1.1. Let n be an integer. Suppose that n is even, i.e., n = for some integer k. Then n2 = = 2 is also
Alekzander
asked
Mar 8, 2018
by
Alekzander
7.8k
points
Mathematics
college
1
answer
1
vote
106k
views
asked
May 17, 2018
167k
views
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
Mickburkejnr
asked
May 17, 2018
by
Mickburkejnr
7.9k
points
Mathematics
college
1
answer
5
votes
167k
views
Ask a Question
Welcome to QAmmunity.org, where you can ask questions and receive answers from other members of our community.
9.4m
questions
12.2m
answers
Categories
All categories
Mathematics
(3.7m)
History
(955k)
English
(903k)
Biology
(716k)
Chemistry
(440k)
Physics
(405k)
Social Studies
(564k)
Advanced Placement
(27.5k)
SAT
(19.1k)
Geography
(146k)
Health
(283k)
Arts
(107k)
Business
(468k)
Computers & Tech
(195k)
French
(33.9k)
German
(4.9k)
Spanish
(174k)
Medicine
(125k)
Law
(53.4k)
Engineering
(74.2k)
Other Questions
What is .725 as a fraction
How do you estimate of 4 5/8 X 1/3
A bathtub is being filled with water. After 3 minutes 4/5 of the tub is full. Assuming the rate is constant, how much longer will it take to fill the tub?
Twitter
WhatsApp
Facebook
Reddit
LinkedIn
Email
Link Copied!
Copy
Search Qammunity.org