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 freeSuppose that is a simple polygon with vertices listed so that consecutive vertices are connected by an edge, and and are connected by an edge. A vertex is called an ear if the line segment connecting the two vertices adjacent tolocalid="1668577988053" is an interior diagonal of the simple polygon. Two ears and are called nonoverlapping if the interiors of the triangles with vertices and its two adjacent vertices and and its two adjacent vertices do not intersect. Prove that every simple polygon with at least four vertices has at least two nonoverlapping ears.
Prove that if n is an integer greater than 4.
For which nonnegative integer’s n is Prove your answer.
Trace Algorithm 1 when it is given n = 6 as input. That is, show all steps used by Algorithm 1 to find 6!, as is done in Example 1 to find 4!.
Use strong induction to show that if a simple polygon with at least four sides is triangulated, then at least two of the triangles in the triangulation have two sides that border the exterior of the polygon.
What do you think about this solution?
We value your feedback to improve our textbook solutions.