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 freeProve that divisible by 8 whenever n is an odd positive integer.
How many additions are used by the recursive and iterative algorithms given in Algorithm 7 and 8, respectively, to find the Fibonacci number ?
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 .
Prove that if and are sets such that , then
How does the number of multiplications used by the algorithm in Exercise 24 compare to the number of multiplications used by Algorithm 2 to evaluate ?
What do you think about this solution?
We value your feedback to improve our textbook solutions.