Order 7 of the following sentences so that they form a direct proof of the statement: If n is even, then n² + 3n+ 5 is odd. Direct proof of the statement (in order): Choose from this list of sentences By the definition of odd, n = 2k + 1 for some integer k. Let n be odd. 2k² + 3k+2 is even. Let n be even. By the definition of even, n = 2k for some integer k. Since k is an integer, It follows that n² + 3n+ 5 = (2k)² + 3(2k) +5 = 4k² + 6k+5 = 2(2k2 + 3k + 2) + 1 Thus, by the definition of odd, 2(2k² + 3k + 2) + 1 is odd. 2k² + 3k + 2 is an integer. Hence, n² + 3n+ 5 is odd.

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question
I need help understanding what I am doing wrong
Order 7 of the following sentences so that they form a direct proof of the statement: If n is even, then n² + 3n+ 5 is odd.
Direct proof of the statement (in order):
Choose from this list of sentences
By the definition of odd, n = 2k + 1 for some
integer k.
Let n be odd.
2k2 + 3k + 2 is even.
Let n be even.
By the definition of even, n = 2k for some integer
k.
Since k is an integer,
It follows that
n² + 3n+ 5 = (2k)² + 3(2k) +5
= 4k²2 +6k+5
= 2(2k² + 3k + 2) + 1
Thus, by the definition of odd,
2(2k² + 3k + 2) + 1 is odd.
2k2 + 3k + 2 is an integer.
Hence, n² + 3n+ 5 is odd.
Transcribed Image Text:Order 7 of the following sentences so that they form a direct proof of the statement: If n is even, then n² + 3n+ 5 is odd. Direct proof of the statement (in order): Choose from this list of sentences By the definition of odd, n = 2k + 1 for some integer k. Let n be odd. 2k2 + 3k + 2 is even. Let n be even. By the definition of even, n = 2k for some integer k. Since k is an integer, It follows that n² + 3n+ 5 = (2k)² + 3(2k) +5 = 4k²2 +6k+5 = 2(2k² + 3k + 2) + 1 Thus, by the definition of odd, 2(2k² + 3k + 2) + 1 is odd. 2k2 + 3k + 2 is an integer. Hence, n² + 3n+ 5 is odd.
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps with 7 images

Blurred answer
Knowledge Booster
Predicate
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education