All questions
Question 1
The sequence an satisfies the recurrence an=3an−1−2an−2 for n≥2 with a0=1 and a1=4. If G(x)=∑n=0∞anxn is the generating function for this sequence, which equation must G(x) satisfy?
- G(x)=1+4x+3xG(x)−2x2G(x)
- G(x)=1−3x+2x21+x
- (1−3x+2x2)G(x)=1+x (correct answer)
- G(x)=1+4x+(3x−2x2)∑n=2∞anxn
Explanation: Starting with the recurrence relation an=3an−1−2an−2, multiply by xn and sum from n=2 to ∞: ∑n=2∞anxn=3∑n=2∞an−1xn−2∑n=2∞an−2xn. This gives G(x)−a0−a1x=3x(G(x)−a0)−2x2G(x). Substituting a0=1 and a1=4: G(x)−1−4x=3x(G(x)−1)−2x2G(x). Expanding: G(x)−1−4x=3xG(x)−3x−2x2G(x). Rearranging: G(x)−3xG(x)+2x2G(x)=1+4x−3x=1+x. Therefore (1−3x+2x2)G(x)=1+x. Choice A incorrectly starts the generating function equation. Choice B gives the closed form but not the functional equation. Choice D uses an incorrect indexing approach. Question 2
Two sequences {un} and {vn} have generating functions related by V(x)=dxd[x⋅U(x)], where U(x)=1−2x1. What is the relationship between the sequences {un} and {vn}?
- vn=(n+2)⋅2n−1 for n≥0, calculated using the product rule and series manipulation
- vn=n⋅2n−1 for n≥1 and v0=0, obtained through careful index management
- vn=2n+n⋅2n−1 for n≥1, combining the original and shifted derivative terms
- vn=(n+1)⋅2n for n≥0, derived from the differentiation and multiplication rules (correct answer)
Explanation: When working with generating functions and derivatives, you need to carefully apply differentiation rules and track how they affect the corresponding sequences.
Starting with U(x)=1−2x1, you can recognize this as the generating function for un=2n. To find V(x)=dxd[x⋅U(x)], first multiply: x⋅U(x)=1−2xx.
Now differentiate using the quotient rule:
V(x)=dxd[1−2xx]=(1−2x)2(1−2x)(1)−x(−2)=(1−2x)21−2x+2x=(1−2x)21
The generating function (1−2x)21 corresponds to the sequence vn=(n+1)⋅2n for n≥0. This follows from the general formula that (1−ax)21 generates (n+1)an.
Option A gives vn=(n+2)⋅2n−1, which would correspond to a different generating function with an extra factor. Option B incorrectly sets v0=0 and uses 2n−1 instead of 2n, suggesting confusion about index shifts. Option C adds an extra 2n term that doesn't arise from the differentiation process.
Study tip: When differentiating generating functions, remember that dxd[x⋅f(x)] often increases the power of coefficients by 1. Practice recognizing standard forms like (1−ax)21↔(n+1)an. Question 3
Consider the recurrence relation an=an−1+an−2+2n−2 for n≥2 with a0=0 and a1=1. Which expression represents the generating function for the sequence {an}?
- 1−x−x2x+1−2xx2, combining homogeneous and particular solution components
- (1−x−x2)(1−2x)x(1−2x)+x2, using the method of undetermined coefficients systematically (correct answer)
- 1−x−x2x+x2+1−2xx2, treating homogeneous and non-homogeneous parts independently
- (1−x−x2)(1−2x)x(1−x)+2x2, derived through direct generating function manipulation techniques
Explanation: This is a non-homogeneous recurrence. Let G(x)=∑n=0∞anxn. From the recurrence an=an−1+an−2+2n−2 for n≥2, multiply by xn and sum: ∑n=2∞anxn=∑n=2∞an−1xn+∑n=2∞an−2xn+∑n=2∞2n−2xn. This gives G(x)−a0−a1x=x(G(x)−a0)+x2G(x)+x2∑n=0∞2nxn. Substituting a0=0,a1=1: G(x)−x=xG(x)+x2G(x)+1−2xx2. Rearranging: G(x)(1−x−x2)=x+1−2xx2. Therefore G(x)=1−x−x2x+1−2xx2=(1−x−x2)(1−2x)x(1−2x)+x2. Choice A has the right structure but incorrect numerator form. Choice C incorrectly separates the generating function additively. Choice D has wrong coefficients in the numerator. Question 4
Consider the generating function G(x)=(1−x)3x2. If this generating function is shifted to start from the constant term (i.e., we define G~(x)=x−2G(x)), what recurrence relation does the resulting sequence satisfy?
- an=3an−1−3an−2+an−3 with initial conditions determined by the shift operation (correct answer)
- an=an−1+2an−2 with modified boundary conditions reflecting the polynomial adjustment
- an+2=3an+1−3an+an−1 with the index shift incorporated into the relation
- an=3an−1−2an−2 with coefficients adjusted for the denominator factorization pattern
Explanation: Starting with G(x)=(1−x)3x2, when we define G~(x)=x−2G(x)=(1−x)31, we get a generating function with denominator (1−x)3. The generating function (1−x)31 corresponds to the sequence of triangular numbers (shifted): the coefficient of xn is (2n+2). For a generating function of the form (1−x)kP(x), the corresponding recurrence comes from the fact that (1−x)−k satisfies (1−x)k∑anxn=polynomial. For k=3, we have (1−x)3=1−3x+3x2−x3, so the recurrence relation is an−3an−1+3an−2−an−3=0 for n≥3, which rearranges to an=3an−1−3an−2+an−3. Choice B has the wrong number of terms and coefficients. Choice C incorrectly shifts the indices in the recurrence. Choice D uses incorrect coefficients that don't match the (1−x)3 expansion. Question 5
The generating function R(x)=1−x1⋅1−x31 counts the number of ways to make change using coins of denominations 1 and 3. What is the coefficient of x7 in this generating function?
- 6, calculated through the convolution of individual denomination generating functions
- 8, counting all possible ways including different orderings of the same coins
- 5, obtained by systematic enumeration of valid coin combinations with repetition allowed
- 3, representing the distinct combinations of coins that sum to 7 (correct answer)
Explanation: When you encounter generating functions for coin change problems, you're looking at a powerful tool that encodes the number of ways to make each amount using specific denominations. The generating function R(x)=1−x1⋅1−x31 represents using unlimited coins of value 1 and 3, where the coefficient of xn tells you how many ways you can make amount n.
To find the coefficient of x7, you need to determine how many non-negative integer solutions exist for a+3b=7, where a is the number of 1-cent coins and b is the number of 3-cent coins. Systematically checking values: when b=0, a=7 (using seven 1's); when b=1, a=4 (using four 1's and one 3); when b=2, a=1 (using one 1 and two 3's). For b≥3, we'd need 3b≥9>7, so no solutions exist. This gives us exactly 3 distinct combinations.
Answer A incorrectly suggests 6 through convolution calculations, likely from computational error. Answer B's result of 8 suggests counting ordered arrangements rather than combinations—but generating functions count combinations, not permutations. Answer C's value of 5 represents systematic enumeration but with an incorrect count, possibly double-counting or including invalid combinations.
Remember: in coin change generating functions, coefficients count distinct combinations of coins, not arrangements. Always convert to the equation ∑di⋅ni=target and solve systematically for non-negative integers. Question 6
Consider the generating function F(x)=1−5x+6x22. If this represents the generating function for a sequence {bn} satisfying a homogeneous linear recurrence, what is the characteristic equation of that recurrence?
- r2−5r+6=0 with initial conditions requiring specific determination (correct answer)
- r2+5r−6=0 with roots determining the exponential growth pattern
- 6r2−5r+1=0 with coefficients derived from the denominator structure
- r2−6r+5=0 with characteristic roots obtained by coefficient reversal
Explanation: For a generating function of the form 1+c1x+c2x2P(x), the corresponding recurrence relation is an+c1an−1+c2an−2=0 for n≥2. Here we have F(x)=1−5x+6x22, so c1=−5 and c2=6. This gives the recurrence an−5an−1+6an−2=0, or equivalently an=5an−1−6an−2. The characteristic equation is r2−5r+6=0. Choice B incorrectly flips signs. Choice C incorrectly reverses the coefficient order. Choice D swaps the middle and last coefficients. Question 7
Consider the generating function S(x)=exp(1−xx). If S(x)=∑n=0∞snxn, what can be said about the growth rate of the coefficients sn as n→∞?
- The coefficients grow exponentially, with sn∼C⋅rn for some constants C and r>1
- The coefficients grow polynomially, with sn=O(nk) for some fixed positive integer k
- The coefficients grow super-exponentially, faster than any exponential function but slower than factorial (correct answer)
- The coefficients grow factorially, with sn∼Cnn! for some constant C>1
Explanation: When analyzing the growth rate of coefficients in a generating function, you need to examine the singularities and behavior of the function to determine how quickly the coefficients grow.
For S(x)=exp(1−xx), the key insight is examining what happens near the dominant singularity at x=1. As x→1−, the expression 1−xx grows like 1−x1, which approaches infinity. This means S(x) has essential singularity behavior near x=1, growing faster than any polynomial power of 1−x1.
Using singularity analysis techniques, when a generating function has an essential singularity of the form exp(1−x1) near x=1, the coefficients grow super-exponentially. Specifically, they grow faster than rn for any fixed r, but slower than n!. This places the growth in the super-exponential category, making (C) correct.
(A) is wrong because exponential growth C⋅rn occurs when you have simple pole singularities, not essential singularities. (B) is incorrect since polynomial growth O(nk) corresponds to functions with algebraic singularities, not the exponential-type singularity we have here. (D) is wrong because factorial growth ∼Cnn! would require a more severe singularity structure.
Strategy tip: When you see generating functions with exponential expressions involving 1−x1, immediately think super-exponential growth. The essential singularity created by the exponential function is the telltale sign that coefficients will grow faster than any exponential but slower than factorial. Question 8
A sequence {dn} satisfies d0=2, d1=1, and dn=2dn−1+3dn−2 for n≥2. If we define f(x)=∑n=0∞dnxn+1, what is the closed form of f(x)?
- 1−2x−3x22x+x2, obtained by applying the standard generating function transformation
- 1−2x−3x2x(2−3x), derived through careful manipulation of the shifted series (correct answer)
- 1+2x+3x22x+x2, found by incorporating the sign changes in the recurrence
- 1−2x−3x2x(2+x), calculated using the index shift and initial condition adjustments
Explanation: We have f(x)=∑n=0∞dnxn+1=x∑n=0∞dnxn=x⋅D(x), where D(x) is the standard generating function for {dn}. From the recurrence dn=2dn−1+3dn−2, we get D(x)=1−2x−3x2d0+(d1−2d0)x=1−2x−3x22+(1−4)x=1−2x−3x22−3x. Therefore, f(x)=x⋅D(x)=1−2x−3x2x(2−3x). Choice A incorrectly computes the numerator after the shift. Choice C has the wrong sign in the denominator. Choice D has an incorrect numerator that doesn't account for the initial conditions properly. Question 9
The generating functions F(x)=∑n=0∞fnxn=1−x22x and G(x)=∑n=0∞gnxn=1−x21 are related to sequences with special properties. What is the relationship between the sequences {fn} and {gn}?
- fn=2gn for all even n and fn=0 for all odd n
- fn=2gn for all odd n and fn=0 for all even n
- fn=gn−1+gn+1 for all n≥1
- fn=2gn−1 for all n≥1 and f0=0 (correct answer)
Explanation: When you encounter generating functions, you're looking at a powerful tool that encodes sequence information in polynomial form. The key insight is that algebraic relationships between generating functions translate directly to relationships between their coefficient sequences.
To find the relationship between {fn} and {gn}, let's first expand these generating functions. For G(x)=1−x21, we can use the geometric series formula: G(x)=1+x2+x4+x6+⋯. This means g0=g2=g4=⋯=1 and g1=g3=g5=⋯=0.
For F(x)=1−x22x=2x⋅1−x21=2x⋅G(x), we get F(x)=2x(1+x2+x4+⋯)=2x+2x3+2x5+⋯. Therefore, f0=0, f1=2, f2=0, f3=2, and so on.
Notice that f1=2=2g0, f3=2=2g2, f5=2=2g4. In general, fn=2gn−1 for n≥1, and f0=0. This confirms answer D.
Looking at the wrong answers: A incorrectly states the relationship holds for even n when it actually holds for odd n. B has the right parity but wrong formula - it's not fn=2gn. C suggests a recurrence relation that doesn't match our coefficient analysis.
Study tip: When comparing generating functions, multiply or factor them algebraically first, then extract coefficients systematically. The algebraic manipulation often reveals the sequence relationship immediately. Question 10
Consider the recurrence relation an=3an−1−2an−2 for n≥2 with initial conditions a0=1 and a1=4. If G(x)=∑n=0∞anxn is the generating function for this sequence, what is the correct form of G(x) after applying the recurrence relation method?
- G(x)=1−3x+2x21+x (correct answer)
- G(x)=1+3x−2x21−x
- G(x)=1+3x−2x21+x
- G(x)=1−3x+2x21−x
Explanation: Starting with G(x) = a₀ + a₁x + a₂x² + ..., we multiply the recurrence by xⁿ and sum. This gives G(x) - a₀ - a₁x = 3x(G(x) - a₀) - 2x²G(x). Substituting a₀ = 1 and a₁ = 4: G(x) - 1 - 4x = 3x(G(x) - 1) - 2x²G(x). Expanding: G(x) - 1 - 4x = 3xG(x) - 3x - 2x²G(x). Collecting terms: G(x)(1 - 3x + 2x²) = 1 + x. Therefore G(x) = (1 + x)/(1 - 3x + 2x²). Choice B has wrong signs in denominator, choice C has wrong sign on 3x term, choice D has wrong numerator.
Question 11
A sequence satisfies an=an−1+an−2 for n≥2 with a0=0 and a1=1. If we want to find the coefficient of x5 in the generating function G(x), which intermediate step correctly represents the algebraic manipulation needed?
- G(x)=x+x⋅G(x)+x2⋅G(x)
- G(x)=x+G(x)⋅x+G(x)⋅x2
- (1−x−x2)⋅G(x)=x (correct answer)
- (1+x+x2)⋅G(x)=x
Explanation: From the recurrence aₙ = aₙ₋₁ + aₙ₋₂, multiplying by xⁿ and summing gives ∑aₙxⁿ = ∑aₙ₋₁xⁿ + ∑aₙ₋₂xⁿ. This becomes G(x) - a₀ - a₁x = x(G(x) - a₀) + x²G(x). With a₀ = 0, a₁ = 1: G(x) - x = xG(x) + x²G(x). Rearranging: G(x) - xG(x) - x²G(x) = x, so (1 - x - x²)G(x) = x. Choice A incorrectly places x outside, choice B is the same error, choice D has wrong signs in the factor.
Question 12
A sequence {cn} has generating function C(x)=1−3x+2x21−x. If we factor the denominator as (1−r1x)(1−r2x) where r1>r2>0, what can we conclude about the long-term behavior of cn as n→∞?
- cn approaches a constant value as n increases
- cn alternates between positive and negative values indefinitely
- cn grows like r1n with the ratio cn+1/cn approaching r1 (correct answer)
- cn decreases exponentially and approaches zero as n increases
Explanation: When you encounter a generating function problem asking about long-term behavior, you need to analyze the poles (roots of the denominator) to understand how the sequence behaves asymptotically.
First, let's factor the denominator 1−3x+2x2. Setting it equal to zero: 2x2−3x+1=0, which factors as (2x−1)(x−1)=0. So x=21 and x=1. This means the denominator factors as (1−2x)(1−x)=(1−r1x)(1−r2x) where r1=2 and r2=1.
Using partial fraction decomposition, we can write C(x)=1−2xA+1−xB for some constants A and B. Each term 1−rx1 generates the sequence rn, so cn=A⋅2n+B⋅1n=A⋅2n+B.
Since 2n grows much faster than the constant B, the dominant term is A⋅2n. Therefore, cn grows like 2n=r1n, and cncn+1 approaches r1=2 as n→∞. This confirms answer (C).
(A) is wrong because 2n grows exponentially, not toward a constant. (B) is incorrect because both roots are positive, so no alternating behavior occurs. (D) is false because the sequence grows rather than decreases—the dominant root r1=2>1 causes exponential growth.
Study tip: The largest root in the denominator always determines long-term behavior. If the largest root r>1, expect exponential growth; if r<1, expect decay to zero. Question 13
The generating function H(x)=(1−x)(1−3x)1+2x can be expanded using partial fractions. If H(x)=1−xA+1−3xB, what sequence property can be directly inferred about the coefficients hn in H(x)=∑n=0∞hnxn?
- hn grows exponentially with ratio between consecutive terms approaching 3
- hn=A⋅1n+B⋅3n for all n≥0
- hn satisfies the recurrence hn=4hn−1−3hn−2
- hn=A+B⋅3n for all n≥0 (correct answer)
Explanation: When you see a generating function with partial fractions, you're looking at a powerful tool that directly reveals the form of the sequence coefficients. Each term in the partial fraction decomposition corresponds to a specific pattern in the resulting sequence.
First, let's find the values of A and B. Using partial fractions on H(x)=(1−x)(1−3x)1+2x=1−xA+1−3xB, we get 1+2x=A(1−3x)+B(1−x). Setting x=1 gives 3=−2A, so A=−23. Setting x=31 gives 35=32B, so B=25.
The key insight is that 1−x1=∑n=0∞xn and 1−3x1=∑n=0∞3nxn. Therefore, hn=A⋅1n+B⋅3n=A+B⋅3n.
Choice A incorrectly focuses on growth rates rather than the explicit formula. Choice B uses the correct general form but incorrectly includes the 1n term explicitly, when 1n=1 simplifies to just a constant. Choice C gives a recurrence relation, which while mathematically equivalent, isn't what we can "directly infer" from the partial fraction form—that requires additional work.
Choice D correctly recognizes that the partial fraction decomposition immediately gives us hn=A+B⋅3n.
Remember: partial fractions in generating functions directly translate to explicit formulas for sequence terms. Each fraction 1−rxC contributes C⋅rn to the coefficient formula. Question 14
A sequence {bn} satisfies bn=5bn−1−6bn−2 for n≥2. If the generating function B(x)=∑n=0∞bnxn has the form 1−5x+6x2P(x), and we know that b2=7, b3=23, what must be the degree of polynomial P(x)?
- P(x) has degree 0 (constant polynomial)
- P(x) has degree 1 (linear polynomial) (correct answer)
- P(x) has degree 2 (quadratic polynomial)
- P(x) has degree 3 (cubic polynomial)
Explanation: For a second-order recurrence aₙ = caₙ₋₁ + daₙ₋₂, the generating function has the form G(x) = (a₀ + (a₁ - ca₀)x)/(1 - cx - dx²). Here c = 5, d = -6, so the denominator is 1 - 5x + 6x². The numerator P(x) = b₀ + (b₁ - 5b₀)x. Since we need exactly two initial conditions to determine a second-order recurrence completely, and we're given b₂ and b₃, we can work backwards to find b₀ and b₁. This gives P(x) as a linear polynomial (degree 1). Choice A would only work if b₁ = 5b₀, choice C would suggest a third-order recurrence, choice D is impossible for a second-order recurrence.
Question 15
Two sequences {un} and {vn} have generating functions U(x)=1−2x1 and V(x)=1−x−x2x respectively. What is the coefficient of x4 in the generating function for the sequence {wn} where wn=un+vn?
- 16
- 19 (correct answer)
- 21
- 23
Explanation: W(x) = U(x) + V(x) = 1/(1-2x) + x/(1-x-x²). From U(x) = ∑2ⁿxⁿ, we get u₄ = 2⁴ = 16. For V(x) = x/(1-x-x²), this generates the Fibonacci sequence shifted: v₀ = 0, v₁ = 1, v₂ = 1, v₃ = 2, v₄ = 3 (since V(x) = x·F(x) where F(x) is the standard Fibonacci generating function). Therefore w₄ = u₄ + v₄ = 16 + 3 = 19. Choice A gives only u₄, choice C and D represent common arithmetic errors in computing Fibonacci terms or powers of 2.
Question 16
Consider the generating function G(x)=1−x−x2−x3x2. This function represents a sequence where each term depends on how many previous terms?
- Each term depends on the previous 2 terms only
- Each term depends on the previous 3 terms only (correct answer)
- Each term depends on the previous 2 or 3 terms depending on the index
- Each term depends on all previous terms in the sequence
Explanation: The denominator 1 - x - x² - x³ indicates a third-order recurrence relation. From G(x) = x²/(1 - x - x² - x³), we can derive that the sequence satisfies aₙ = aₙ₋₁ + aₙ₋₂ + aₙ₋₃ for n ≥ 3, after accounting for initial conditions determined by the numerator x². This is a third-order linear recurrence, meaning each term depends on exactly the previous 3 terms. Choice A would correspond to denominator 1 - ax - bx², choice C suggests a variable-order recurrence (which this is not), choice D would require an infinite sum in the denominator.
Question 17
The generating function G(x)=1−4x+3x22 corresponds to a sequence that satisfies a second-order linear recurrence. What are the characteristic roots of this recurrence relation?
- r1=1,r2=3 (correct answer)
- r1=3,r2=1
- r1=4,r2=−3
- r1=−1,r2=−3
Explanation: The generating function G(x) = 2/(1 - 4x + 3x²) corresponds to the recurrence aₙ = 4aₙ₋₁ - 3aₙ₋₂. The characteristic equation is r² - 4r + 3 = 0, which factors as (r - 1)(r - 3) = 0, giving roots r₁ = 1 and r₂ = 3. Choice B gives the same roots in different order (which is equivalent), choice C incorrectly uses coefficients from the denominator directly, choice D has wrong signs.