Chapter 5: Q28E (page 330)
Prove that is nonnegative whenever n is an integer with
Short Answer
is a positive integer, then
Chapter 5: Q28E (page 330)
Prove that is nonnegative whenever n is an integer with
is a positive integer, then
All the tools & learning materials you need for study success - in one app.
Get started for freeDevise a recursive algorithm to find a, where a is a real number and n is a positive integer. [Hint: Use the equality .]
Give a recursive algorithm for computing whenever n is a positive integer and x is an integer, using just addition.
Describe a recursive algorithm for multiplying two nonnegative integers x and y based on the fact that xy = 2 (x . (y / 2)) when y is even and xy = 2 (x . [y / 2]) + x when y is odd, together with the initial condition xy = 0 when y = 0 .
Suppose that a store offers gift certificates in denominations 25 dollars and 40 dollars. Determine the possible total amounts you can form using these gift certificates. Prove your answer using strong induction.
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.
What do you think about this solution?
We value your feedback to improve our textbook solutions.