Prove that if n is an integer and 3n+2 is even, then n is even using a proof by contradiction. Rank the options below. As 3n is even and n is odd, 3n- n should be odd, but 3n-n= 2n is even. This is a contradiction. Since 3n+2 is even, so is 3n. Suppose that 3n+2 is even and that n is odd. We know that if we subtract an odd number from an even number, we get an odd number. Therefore, our supposition was wrong; hence n is even.

Advanced Engineering Mathematics
10th Edition
ISBN:9780470458365
Author:Erwin Kreyszig
Publisher:Erwin Kreyszig
Chapter2: Second-order Linear Odes
Section: Chapter Questions
Problem 1RQ
icon
Related questions
Question
NOTE: This is a multi-part question. Once an answer is submitted, you will be unable to return to this part.
Consider the statement that min(a, min(b, c)) = min(min(a, b), c) whenever a, b, and care real numbers.
Identify the set of cases that are required to prove the given statement using proof by cases.
(You must provide an answer before moving to the next part.)
Multiple Choice
O
O.
O
a<b<c, a≤ c≤ b, b<a<c, b< c≤ a, c<a<b, c < b <≤a
a<b<c, a<c<b, b<a<c, b<c<a, c<a<b, c < b <a.
a>b≥c, a>c> b, b≥a ≥c, bzcza, c> a>b, c>b>a.
a>b>c, a>c>b, b>a>c, b> c> a, c>a>b, c>b> a
Transcribed Image Text:NOTE: This is a multi-part question. Once an answer is submitted, you will be unable to return to this part. Consider the statement that min(a, min(b, c)) = min(min(a, b), c) whenever a, b, and care real numbers. Identify the set of cases that are required to prove the given statement using proof by cases. (You must provide an answer before moving to the next part.) Multiple Choice O O. O a<b<c, a≤ c≤ b, b<a<c, b< c≤ a, c<a<b, c < b <≤a a<b<c, a<c<b, b<a<c, b<c<a, c<a<b, c < b <a. a>b≥c, a>c> b, b≥a ≥c, bzcza, c> a>b, c>b>a. a>b>c, a>c>b, b>a>c, b> c> a, c>a>b, c>b> a
ent 2: Secs 1.7-1.8 i
Required information
NOTE: This is a multi-part question. Once an answer is submitted, you will be unable to return to this part.
Prove that if n is an integer and 3n+2 is even, then n is even using
a proof by contradiction.
Rank the options below.
As 3n is even and n is odd, 3n- n should be odd, but 3n - n = 2n is even. This is a contradiction.
Since 3n+ 2 is even, so is 3n.
Saved
Suppose that 3n+2 is even and that n is odd.
We know that if we subtract an odd number from an even number, we get an odd number.
Therefore, our supposition was wrong; hence n is even.
Transcribed Image Text:ent 2: Secs 1.7-1.8 i Required information NOTE: This is a multi-part question. Once an answer is submitted, you will be unable to return to this part. Prove that if n is an integer and 3n+2 is even, then n is even using a proof by contradiction. Rank the options below. As 3n is even and n is odd, 3n- n should be odd, but 3n - n = 2n is even. This is a contradiction. Since 3n+ 2 is even, so is 3n. Saved Suppose that 3n+2 is even and that n is odd. We know that if we subtract an odd number from an even number, we get an odd number. Therefore, our supposition was wrong; hence n is even.
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 3 steps with 3 images

Blurred answer
Recommended textbooks for you
Advanced Engineering Mathematics
Advanced Engineering Mathematics
Advanced Math
ISBN:
9780470458365
Author:
Erwin Kreyszig
Publisher:
Wiley, John & Sons, Incorporated
Numerical Methods for Engineers
Numerical Methods for Engineers
Advanced Math
ISBN:
9780073397924
Author:
Steven C. Chapra Dr., Raymond P. Canale
Publisher:
McGraw-Hill Education
Introductory Mathematics for Engineering Applicat…
Introductory Mathematics for Engineering Applicat…
Advanced Math
ISBN:
9781118141809
Author:
Nathan Klingbeil
Publisher:
WILEY
Mathematics For Machine Technology
Mathematics For Machine Technology
Advanced Math
ISBN:
9781337798310
Author:
Peterson, John.
Publisher:
Cengage Learning,
Basic Technical Mathematics
Basic Technical Mathematics
Advanced Math
ISBN:
9780134437705
Author:
Washington
Publisher:
PEARSON
Topology
Topology
Advanced Math
ISBN:
9780134689517
Author:
Munkres, James R.
Publisher:
Pearson,