Chapter 8: Q9E (page 535)
Suppose that when is a positive integer divisible by 5 , and . Find
Short Answer
The answers are given below;
a)\(f\left( 5 \right) = 79\)
b)\(f\left( {125} \right) = 48,829\)
c) \(f\left( {3125} \right) = 30,517,579\)
Chapter 8: Q9E (page 535)
Suppose that when is a positive integer divisible by 5 , and . Find
The answers are given below;
a)\(f\left( 5 \right) = 79\)
b)\(f\left( {125} \right) = 48,829\)
c) \(f\left( {3125} \right) = 30,517,579\)
All the tools & learning materials you need for study success - in one app.
Get started for freeUse generating functions to find the number of ways to select 14 balls from a jar containing 100 red balls, 100 blue balls, and 100 green balls so that no fewer than 3 and no more than 10 blue balls are selected. Assume that the order in which the balls are drawn does not matter.
Suppose that when is an even positive integer, and . Find
a)
b).
c).
d).
Prove Theorem 4.
a) Show that is the generating function for the number of ways that the sum n can be obtained when a die is rolled repeatedly and the order of the roll matters.
b) Use part (a) to find the number of ways to roll a total of 8 when a die is rolled repeatedly, and the order of the roll matters.
(Linear algebra required) Let \({{\bf{A}}_n}\) be the \(n \times n\) matrix with \(2\;{\rm{s}}\) on its main diagonal, 1s in all positions next to a diagonal element, and \(0\)s everywhere else. Find a recurrence relation for\({d_n}\), the determinant of \({{\bf{A}}_n}\) - Solve this recurrence relation to find a formula for\({d_n}\).
What do you think about this solution?
We value your feedback to improve our textbook solutions.