Chapter 5: Q23E (page 330)
For which nonnegative integer’s n is Prove your answer.
Short Answer
P(n) is true for all integers n>3.
Chapter 5: Q23E (page 330)
For which nonnegative integer’s n is Prove your answer.
P(n) is true for all integers n>3.
All the tools & learning materials you need for study success - in one app.
Get started for freeProve that the recursive algorithm for finding the sum of the first n positive integers you found in Exercise 8 is correct.
Prove that for every positive integer n,
Assume that a chocolate bar consists of n squares arranged in a rectangular pattern. The entire bar, a smaller rectangular piece of the bar, can be broken along a vertical or a horizontal line separating the squares. Assuming that only one piece can be broken at a time, determine how many breaks you must successfully make to break the bar into n separate squares. Use strong induction to prove your answer
Let P (n) be the statement that a postage of n cents can be formed using just 3-cent stamps and 5-cent stamps. The parts of this exercise outline a strong induction proof that P (n) is true for n ≥ 8.
a) Show that the statements P (8), P (9), and P (10) are true, completing the basis step of the proof.
b) What is the inductive hypothesis of the proof?
c) What do you need to prove in the inductive step?
d) Complete the inductive step for k ≥ 10.
e) Explain why these steps show that this statement is true whenever n ≥ 8.
In the proof of Lemma 1 we mentioned that many incorrect methods for finding a vertex such that the line segment is an interior diagonal of have been published. This exercise presents some of the incorrect ways has been chosen in these proofs. Show, by considering one of the polygons drawn here, that for each of these choices of , the line segment is not necessarily an interior diagonal of .
a) p is the vertex of P such that the angleis smallest.
b) p is the vertex of P with the least -coordinate (other than ).
c) p is the vertex of P that is closest to .
What do you think about this solution?
We value your feedback to improve our textbook solutions.