Chapter 6: Q25E (page 433)
How many positive integers less than 1,000,000 have the sum of their digits equal to 19?
Short Answer
There are 30,492 positive integers less than 1,000,000 have the sum of their digits equal to 19
Chapter 6: Q25E (page 433)
How many positive integers less than 1,000,000 have the sum of their digits equal to 19?
There are 30,492 positive integers less than 1,000,000 have the sum of their digits equal to 19
All the tools & learning materials you need for study success - in one app.
Get started for free13. A book publisher has 3000 copies of a discrete mathematics book. How many ways are there to store these books in their three warehouses if the copies of the book are indistinguishable?
Show that if \(p\) is a prime and\(k\)is an integer such that \(1 \le k \le p - 1\), then \(p\)divides \(\left( {\begin{array}{*{20}{l}}p\\k\end{array}} \right)\).
Prove that if\(n\)and\(k\)are integers with\(1 \le k \le n\), then\(k \cdot \left( {\begin{array}{*{20}{l}}n\\k\end{array}} \right) = n \cdot \left( {\begin{array}{*{20}{l}}{n - 1}\\{k - 1}\end{array}} \right)\),
a) using a combinatorial proof. [Hint: Show that the two sides of the identity count the number of ways to select a subset with\(k\)elements from a set with n elements and then an element of this subset.]
b) using an algebraic proof based on the formula for\(\left( {\begin{array}{*{20}{l}}n\\r\end{array}} \right)\)given in Theorem\(2\)in Section\(6.3\).
In how many ways can a set of five letters be selected from the English alphabet?
4. Every day a student randomly chooses a sandwich for lunch from a pile of wrapped sandwiches. If there are six kinds of sandwiches, how many different ways are there for the student to choose sandwiches for the seven days of a week if the order in which the sandwiches are chosen matters?
What do you think about this solution?
We value your feedback to improve our textbook solutions.