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 freeIn this exercise we will count the number of paths in the\(xy\)plane between the origin \((0,0)\) and point\((m,n)\), where\(m\)and\(n\)are nonnegative integers, such that each path is made up of a series of steps, where each step is a move one unit to the right or a move one unit upward. (No moves to the left or downward are allowed.) Two such paths from\((0,0)\)to\((5,3)\)are illustrated here.
a) Show that each path of the type described can be represented by a bit string consisting of\(m\,\,0\)s and\(n\,\,1\)s, where a\(0\)represents a move one unit to the right and a\(1\)represents a move one unit upward.
b) Conclude from part (a) that there are \(\left( {\begin{array}{*{20}{c}}{m + n}\\n\end{array}} \right)\) paths of the desired type.
How many ways are there to choose 6 items from 10 distinct items when
a) the items in the choices are ordered and repetition is not allowed?
b) the items in the choices are ordered and repetition is allowed?
c) the items in the choices are unordered and repetition is not allowed?
d) the items in the choices are unordered and repetition is allowed?
When the numbers from \({\rm{1}}\) to \({\rm{1000}}\) are written out in decimal notation, how many of each of these digits are used?
a) \({\rm{0}}\)
b) \({\rm{1}}\)
c) \({\rm{2}}\)
d) \({\rm{9}}\)
a) How can the product rule be used to find the number of functions from a set with m elements to a set with n elements?
b) How many functions are there from a set with five elements to a set with 10 elements?
c) How can the product rule be used to find the number of one-to-one functions from a set with m elements to a set with n elements?
d) How many one-to-one functions are there from a set with five elements to a set with 10 elements?
e) How many onto functions are there from a set with five elements to a set with 10 elements?
List all the permutations of {a,b,c}.
What do you think about this solution?
We value your feedback to improve our textbook solutions.