Chapter 5: Q7E (page 342)
Which amounts of money can be formed using just two-dollar bills and five-dollar bills? Prove your answer using strong induction.
Short Answer
All amounts can be formed except $1 and $3.
Chapter 5: Q7E (page 342)
Which amounts of money can be formed using just two-dollar bills and five-dollar bills? Prove your answer using strong induction.
All amounts can be formed except $1 and $3.
All the tools & learning materials you need for study success - in one app.
Get started for freeProve that 21 divides whenever n is a positive integer.
Devise a recursive algorithm for computing the greatest common divisor of two nonnegative integers a and b with using the fact that gcd (a,b) = gcd (a,b - a) .
Prove that for every positive integer n,
Prove that divisible by 8 whenever n is an odd positive integer.
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.
What do you think about this solution?
We value your feedback to improve our textbook solutions.