Combinatorics Through Guided Discovery, 2004a
Combinatorics Through Guided Discovery, 2004a
Combinatorics Through Guided Discovery, 2004a
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
C.2. Exponential Generating Functions 153<br />
◦ Problem 373. Find the EGF (exponential generating function) for the number<br />
of ways to paint the n streetlight poles that run along the north side of<br />
Main Street in Anytown, USA using four colors.<br />
Problem 374. For what sequence is ex −e −x<br />
2<br />
= x the EGF (exponential<br />
generating function)?<br />
· Problem 375. For what sequence is ( 1<br />
1−x<br />
) the EGF? ((y) stands for the<br />
natural logarithm of y. People often write (y) instead.) Hint: Think of<br />
the definition of the logarithm as an integral, and don’t worry at this stage<br />
whether or not the usual laws of calculus apply, just use them as if they do!<br />
We will then define (1 − x) to be the power series you get. a<br />
and<br />
a It is possible to define the derivatives and integrals of power series by the formulas<br />
d<br />
∞∑ ∞∑<br />
b i x i = ib i x i−1<br />
dx<br />
∫ x<br />
0<br />
i=0<br />
i=0<br />
i=1<br />
∞∑ ∞∑<br />
b i x i b i<br />
=<br />
i +1 xi+1<br />
rather than by using the limit definitions from calculus. It is then possible to prove that the<br />
sum rule, product rule, etc. apply. (There is a little technicality involving the meaning of<br />
composition for power series that turns into a technicality involving the chain rule, but it<br />
needn’t concern us at this time.)<br />
i=0<br />
· Problem 376. What is the EGF for the number of permutations of an n-<br />
element set?<br />
⇒ ·<br />
Problem 377. What is the EGF for the number of ways to arrange n people<br />
around a round table? Try to find a recognizable function represented by<br />
the EGF. Notice that we may think of this as the EGF for the number of<br />
permutations on n elements that are cycles. (h)<br />
⇒ ·<br />
Problem 378. What is the EGF ∑ ∞ x<br />
n=0 p 2n<br />
2n (2n)! for the number of ways p 2n to<br />
pair up 2n people to play a total of n tennis matches (as in Problems 12 and<br />
44)? (h)