Chapter 5: Q15E (page 330)
Prove that for every positive integer n,
Chapter 5: Q15E (page 330)
Prove that for every positive integer n,
All the tools & learning materials you need for study success - in one app.
Get started for freeProve that if n is an integer greater than 6.
Let be the statement that when nonintersecting diagonals are drawn inside a convex polygon with sides, at least two vertices of the polygon are not endpoints of any of these diagonals.
a) Show that when we attempt to prove for all integers n with using strong induction, the inductive step does not go through.
b) Show that we can prove that is true for all integers n with by proving by strong induction the stronger assertion , for , where states that whenever nonintersecting diagonals are drawn inside a convex polygon with sides, at least two nonadjacent vertices are not endpoints of any of these diagonals.
Prove that is nonnegative whenever n is an integer with
Let be the statement that in a triangulation of a simple polygon with sides, at least one of the triangles in the triangulation has two sides bordering the exterior of the polygon.
a) Explain where a proof using strong induction that is true for all integers runs into difficulties.
b) Show that we can prove that is true for all integers by proving by strong induction the stronger statement for all integers , which states that in every triangulation of a simple polygon, at least two of the triangles in the triangulation have two sides bordering the exterior of the polygon.
Give a recursive algorithm for finding the minimum of a finite set of integers, making use of the fact that the maximum of n integers is the smaller of the last integer in the list and the minimum of the first n - 1 integers in the list.
What do you think about this solution?
We value your feedback to improve our textbook solutions.