Chapter 5: Q25E (page 358)
Give a recursive definition of
- the set of even integers.
- the set of positive integers congruent to 2 modulo 3.
- the set of positive integers not divisible by 5.
Chapter 5: Q25E (page 358)
Give a recursive definition of
All the tools & learning materials you need for study success - in one app.
Get started for freeProve that Algorithm 1 for computing n! when n is a nonnegative integer is correct.
Prove that the algorithm you devised in Exercise 17 is correct.
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 the first player has a winning strategy for the game of Chomp, introduced in Example 12 in Section 1.8, if the initial board is square. [Hint: Use strong induction to show that this strategy works. For the first move, the first player chomps all cookies except those in the left and top edges. On subsequent moves, after the second player has chomped cookies on either the top or left edge, the first player chomps cookies in the same relative positions in the left or top edge, respectively.]
Prove that 21 divides whenever n is a positive integer.
What do you think about this solution?
We value your feedback to improve our textbook solutions.