KonkurStudy
همه کارت‌ها

Evaluating Factorial Series by Rewriting the Numerator in the Factorial's Argument

Sum series like sum n/(2n+1)! by writing the numerator as a combination of the factorial's argument, so each term collapses onto a known e, sinh, or cosh series.

کارت الگوریتم کنکور ارشد علوم کامپیوتر

اهمیت
۰/۵

Intuition

A series whose general term is P(n)(an+b)!\dfrac{P(n)}{(an+b)!}, with PP a polynomial in nn, can almost always be summed in closed form. The trick is that a factorial cancels its own argument: an+b(an+b)!=1(an+b−1)!\dfrac{an+b}{(an+b)!}=\dfrac{1}{(an+b-1)!}. So if you rewrite the numerator P(n)P(n) as a combination of the falling factors (an+b),(an+b−1),…(an+b),(an+b-1),\dots of the denominator's argument, every term drops to a lower factorial and lands on a series you already know.

The target "known" series are the Maclaurin expansions at x=1x=1: e=∑n=0∞1n!,cosh⁡1=∑n=0∞1(2n)!=e+e−12,sinh⁡1=∑n=0∞1(2n+1)!=e−e−12.e=\sum_{n=0}^{\infty}\frac{1}{n!},\qquad \cosh 1=\sum_{n=0}^{\infty}\frac{1}{(2n)!}=\frac{e+e^{-1}}{2},\qquad \sinh 1=\sum_{n=0}^{\infty}\frac{1}{(2n+1)!}=\frac{e-e^{-1}}{2}.

Method

  1. Identify the denominator's argument m=an+bm=an+b (e.g. m=2n+1m=2n+1). This is the quantity you will express the numerator in terms of.
  2. Rewrite the numerator P(n)P(n) as a linear combination of 1, m, m(m−1),…1,\,m,\,m(m-1),\dots Solve for the constants by matching. For a linear PP, write n=1a[(an+b)−b]n=\dfrac{1}{a}\big[(an+b)-b\big].
  3. Cancel one factor of the argument per term: mm!=1(m−1)!\dfrac{m}{m!}=\dfrac{1}{(m-1)!}, and m(m−1)m!=1(m−2)!\dfrac{m(m-1)}{m!}=\dfrac{1}{(m-2)!}, lowering each piece to a known factorial series.
  4. Match each resulting sum to ee, sinh⁡1\sinh 1, or cosh⁡1\cosh 1 (mind whether the index gives even or odd factorials), then combine.

Worked example

Evaluate S=∑n=0∞n(2n+1)!\displaystyle S=\sum_{n=0}^{\infty}\frac{n}{(2n+1)!}.

Here the argument is m=2n+1m=2n+1, so write n=12[(2n+1)−1]n=\tfrac12\big[(2n+1)-1\big]: n(2n+1)!=12⋅2n+1(2n+1)!−12⋅1(2n+1)!=12⋅1(2n)!−12⋅1(2n+1)!.\frac{n}{(2n+1)!}=\frac12\cdot\frac{2n+1}{(2n+1)!}-\frac12\cdot\frac{1}{(2n+1)!}=\frac12\cdot\frac{1}{(2n)!}-\frac12\cdot\frac{1}{(2n+1)!}. Summing each piece against the known series, S=12∑n=0∞1(2n)!−12∑n=0∞1(2n+1)!=12cosh⁡1−12sinh⁡1=12⋅2e−12=12e.S=\frac12\sum_{n=0}^{\infty}\frac{1}{(2n)!}-\frac12\sum_{n=0}^{\infty}\frac{1}{(2n+1)!}=\frac12\cosh 1-\frac12\sinh 1=\frac{1}{2}\cdot\frac{2e^{-1}}{2}=\frac{1}{2e}.

The same recipe handles ∑nn!=e\sum \dfrac{n}{n!}=e, ∑n2n!=2e\sum \dfrac{n^2}{n!}=2e, and quadratic numerators (split n2=n(n−1)+nn^2=n(n-1)+n to cancel two factors).

Exam trick: Pick the split that matches the denominator's exact argument, not just any factor of nn. For (2n+1)!(2n+1)! use n=12[(2n+1)−1]n=\tfrac12[(2n+1)-1] (giving (2n)!(2n)! and (2n+1)!(2n+1)!); for (2n)!(2n)! use n=12[(2n)−0]+…n=\tfrac12[(2n)-0]+\dots so the cancelled factor leaves the parity you can sum. Cancelling the wrong factor lands you on a series you can't name.

فرمول‌های کلیدی

Argument-cancellation identity
an+b(an+b)!=1(an+b−1)!\frac{an+b}{(an+b)!}=\frac{1}{(an+b-1)!}

A factorial cancels its own argument, lowering the factorial by one; the engine of the whole method.

Linear numerator split
n(an+b)!=1a⋅1(an+b−1)!−ba⋅1(an+b)!\frac{n}{(an+b)!}=\frac{1}{a}\cdot\frac{1}{(an+b-1)!}-\frac{b}{a}\cdot\frac{1}{(an+b)!}

Write n = (1/a)[(an+b) - b], then cancel the argument in the first piece.

Hyperbolic target series
∑n=0∞1(2n)!=cosh⁡1=e+e−12,∑n=0∞1(2n+1)!=sinh⁡1=e−e−12\sum_{n=0}^{\infty}\frac{1}{(2n)!}=\cosh 1=\frac{e+e^{-1}}{2},\qquad \sum_{n=0}^{\infty}\frac{1}{(2n+1)!}=\sinh 1=\frac{e-e^{-1}}{2}

Even and odd factorial series sum to cosh 1 and sinh 1; the landing spots after cancellation.

Quadratic numerator split
n2=n(n−1)+nn^{2}=n(n-1)+n

For n^2/n! cancel two factors: n(n-1)/n! = 1/(n-2)! and n/n! = 1/(n-1)!, giving sum n^2/n! = 2e.

#infinite-series#factorial-series#maclaurin-series#sinh-cosh#exponential-series#telescoping-numerator

سوالات تمرینی