Chapter 5: Q33E (page 330)
Prove that 5 divides whenever n is a non negative integer.
Short Answer
5 divides whenever n is a positive integer
Chapter 5: Q33E (page 330)
Prove that 5 divides whenever n is a non negative integer.
5 divides whenever n is a positive integer
All the tools & learning materials you need for study success - in one app.
Get started for freea) 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 a set with n elements has subsets containing exactly three elements whenever n is an integer greater than or equal to 3.
Prove that 21 divides whenever n is a positive integer.
(a) Determine which amounts of postage can be formed using just 3-cent and 10-cent stamps.
(b) Prove your answer to (a) using the principle of mathematical induction. Be sure to state explicitly your inductive hypothesis in the inductive step.
(c) Prove your answer to (a) using strong induction. How does the inductive hypothesis in this proof differ from that in the inductive hypothesis for a proof using mathematical induction?
Prove that a set with n elements has subsets containing exactly two elements whenever n is an integer greater than or equal to 2.
What do you think about this solution?
We value your feedback to improve our textbook solutions.