Chapter 5: Q9E (page 342)
Use strong induction to prove that is irrational. [Hint: Let be the statement that for any positive integer b.]
Short Answer
It has been proved that is irrational.
Chapter 5: Q9E (page 342)
Use strong induction to prove that is irrational. [Hint: Let be the statement that for any positive integer b.]
It has been proved that is irrational.
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
Prove that 2 divides whenever n is a positive integer.
a) Find a formula for
by examining the values of this expression for small
values of n.
b) Prove the formula you conjectured in part (a).
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
What do you think about this solution?
We value your feedback to improve our textbook solutions.