A number or a short expression. Spacing and $ signs are ignored.
Solution
First Solution: Note that (n2n)=n!⋅n!(2n)!=n!(2n)(2n−2)(2n−4)⋯(2)⋅n!(2n−1)(2n−3)(2n−5)⋯(1)=2n⋅n!(−2)n(−21)(−21−1)(−21−2)⋯(−21−n+1)=(−4)n(n−21). Then, by the binomial theorem, for any real x with ∣x∣<41, we have (1−4x)−1/2=∑n=0∞(n−21)(−4x)n=∑n=0∞(n2n)xn. Therefore, ∑n=0∞(n2n)(51)n=1−541=5. Second Solution: Consider the generating function f(x)=∑n=0∞(n2n)xn. It has formal integral given by g(x)=I(f(x))=∑n=0∞n+11(n2n)xn+1=∑n=0∞Cnxn+1=x∑n=0∞Cnxn where Cn=n+11(n2n) is the nth Catalan number. Let h(x)=∑n=0∞Cnxn; it suffices to compute this generating function. Note that 1+xh(x)2=1+x∑i,j≥0CiCjxi+j=1+x∑k≥0(∑i=0kCiCk−i)xk=1+∑k≥0Ck+1xk+1=h(x) where we've used the recurrence relation for the Catalan numbers. We now solve for h(x) with the quadratic equation to obtain h(x)=21/x±1/x2−4/x=2x1±1−4x. Note that we must choose the - sign in the ±, since the + would lead to a leading term of x1 for h (by expanding 1−4x into a power series). Therefore, we see that f(x)=D(g(x))=D(xh(x))=D(21−1−4x)=1−4x1 and our answer is hence f(1/5)=5.
Want a route through all this instead of an archive? The track
puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.
Source: Omni-MATH,
licensed Apache-2.0.
Statement and solution reproduced as published; topic and difficulty added by this site.