Chapter 5: Q36E (page 330)
Prove that 21 divides whenever n is a positive integer.
Short Answer
21 divides whenever n is a positive integer
Chapter 5: Q36E (page 330)
Prove that 21 divides whenever n is a positive integer.
21 divides whenever n is a positive integer
All the tools & learning materials you need for study success - in one app.
Get started for freeHow does the number of multiplications used by the algorithm in Exercise 26 compare to the number of multiplications used by Algorithm 2 to evaluate a?
Devise a recursive algorithm for computing where n is a nonnegative integer, using the fact that . Then prove that this algorithm is correct.
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).
Prove that the recursive algorithm that you found in Exercise 7 is correct.
The well-ordering property can be used to show that there is a unique greatest common divisor of two positive integers. Let a and be positive integers, and let S be the set of positive integers of the form , where s and t are integers.
a) Show that s is nonempty.
b) Use the well-ordering property to show that s has a smallest element .
c) Show that if d is a common divisor of a and b, then d is a divisor of c.
d) Show that c I a and c I b. [Hint: First, assume that . Then , where . Show that , contradicting the choice of c.]
e) Conclude from (c) and (d) that the greatest common divisor of a and b exists. Finish the proof by showing that this greatest common divisor is unique.
What do you think about this solution?
We value your feedback to improve our textbook solutions.