All Questions
2
questions
0
votes
1
answer
129
views
Let g_n equal the number of lists of any length taken from {1,3,4} having elements that sum to n.
For example, g_3 = 2 because the lists are (3) abd (1,1,1). Also g_4 = 4 because the lsits are (4), (3,1), (1,3), and (1,1,1,1). Define g_0 = 1.
(a) Find g_1, g_2, and g_5 by complete enumeration.
(b) ...
- 61
0
votes
1
answer
251
views
Generating Function of Integer Partitions
Let $p_{k}(n)$ be a number of partitions of $n$ that into parts not greater than $k$.
$p_{k}(n)=p_{k-1}(n)+p_{k}(n-k)$
i will prove this partition recurrence bu using Generating Functions of ...
- 421