Prove each statement using either weak, strong, or structural induction. Make sure to clearly indicate the different parts of your proof: the basis step, the inductive hypothesis, what you will show in the inductive step, and the inductive step. Make sure to clearly format your proofs and to write in complete, clear sentences. EXAMPLE: Prove that for any nonnegative integer n, Σ i = (n+1) Answer: Proof. (by weak induction) Basis step: n = 1 Σ=1 1(1+1)==1 Therefore, (n+1) when n = 1. = Inductive hypothesis: Assume that Inductive step: We will show that i=1 i=1 i= = (+1) for some integer k > 1. i= (k+1)((k+1)+1) k+1 Σ=Σ+ (κ + 1) i=1 By inductive hypothesis, k+1 Σ IME i=1 k(k+1) = +k+1 2 k(k+1)+2(k+1) = 2 (k+2)(k+1) = 2 (k+1)((k+1)+1) 2 Therefore, by weak induction, we have shown that = (n+1) for all nonnegative integers n. Prove that 9" 2" is divisible by 7 for all positive integers n.

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
Prove each statement using either weak, strong, or structural induction. Make sure to clearly indicate the
different parts of your proof: the basis step, the inductive hypothesis, what you will show in the inductive
step, and the inductive step. Make sure to clearly format your proofs and to write in complete, clear
sentences.
EXAMPLE: Prove that for any nonnegative integer n, Σ i = (n+1)
Answer:
Proof. (by weak induction)
Basis step: n = 1
Σ=1
1(1+1)==1
Therefore, (n+1) when n = 1.
=
Inductive hypothesis: Assume that
Inductive step: We will show that
i=1
i=1
i=
= (+1) for some integer k > 1.
i= (k+1)((k+1)+1)
k+1
Σ=Σ+ (κ + 1)
i=1
By inductive hypothesis,
k+1
Σ
IME
i=1
k(k+1)
=
+k+1
2
k(k+1)+2(k+1)
=
2
(k+2)(k+1)
=
2
(k+1)((k+1)+1)
2
Therefore, by weak induction, we have shown that = (n+1) for all nonnegative integers n.
Transcribed Image Text:Prove each statement using either weak, strong, or structural induction. Make sure to clearly indicate the different parts of your proof: the basis step, the inductive hypothesis, what you will show in the inductive step, and the inductive step. Make sure to clearly format your proofs and to write in complete, clear sentences. EXAMPLE: Prove that for any nonnegative integer n, Σ i = (n+1) Answer: Proof. (by weak induction) Basis step: n = 1 Σ=1 1(1+1)==1 Therefore, (n+1) when n = 1. = Inductive hypothesis: Assume that Inductive step: We will show that i=1 i=1 i= = (+1) for some integer k > 1. i= (k+1)((k+1)+1) k+1 Σ=Σ+ (κ + 1) i=1 By inductive hypothesis, k+1 Σ IME i=1 k(k+1) = +k+1 2 k(k+1)+2(k+1) = 2 (k+2)(k+1) = 2 (k+1)((k+1)+1) 2 Therefore, by weak induction, we have shown that = (n+1) for all nonnegative integers n.
Prove that 9" 2" is divisible by 7 for all positive integers n.
Transcribed Image Text:Prove that 9" 2" is divisible by 7 for all positive integers n.
Expert Solution
steps

Step by step

Solved in 2 steps with 1 images

Blurred answer
Similar questions
  • SEE MORE 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