Put $x=e^{-t}$. Thenwhere the second substitution is $u=(k+1)t$ and the final integral is the given gamma function value. The formula also holds for $k=0$, with value $1$.

For $0<x<1$, the exponential function expansion givesEvery term is nonnegative. By the monotone convergence theorem, integration can be interchanged with summation, and henceThis identity is one form of Sophomore's dream.

The partial sums $s_n={\sum }_{k=1}^n{a}_k$ are nonnegative measurable functions and increase to an extended-valued function $s$. By the monotone convergence theorem,A nonnegative function with finite Lebesgue integral cannot equal $+\infty$ on a set of positive measure: otherwise its integral would exceed $M$ times that measure for every $M>0$. Thus the series converges to a finite value almost everywhere. Redefine it to be zero on the exceptional null set if a finite-valued representative is desired. The resulting function is Lebesgue integrable, with

The monotone convergence theorem states that if $f_n$ are nonnegative measurable functions on a measure space and $f_n\uparrow f$ almost everywhere, thenEither side is allowed to be $+\infty$; no integrable dominating function is required.

Supposeare two factorizations into primes. Repeatedly apply the cyclic-subgroup construction of part (c), first removing $p_r$, then $p_{r-1}$, and so on. This constructs a composition series for $C_n$ whose composition factors are $C_{p_1},\dots ,C_{p_r}$. The second factorization constructs another composition series with composition factors $C_{q_1},\dots ,C_{q_s}$.

By the Jordan–Hölder theorem, $r=s$ and these composition factors agree up to group isomorphism and permutation. Since isomorphic finite groups have the same order, the corresponding primes agree. This proves uniqueness of prime factorization up to permutation, using existence of prime factorizations but not their uniqueness.

Write $C_n=⟨g⟩$ and set $N=⟨g^p⟩$. The order of $g^p$ is $n/\gcd (n,p)=m$, so $N\cong C_m$. Every subgroup of an abelian group is a normal subgroup. The quotient group $C_n/N$ is generated by $gN$ and has order $n/m=p$, hence is $C_p$ and is a simple group. By the subgroup correspondence theorem, there is no proper normal subgroup strictly between $N$ and $C_n$. Therefore $N$ is a maximal normal subgroup with the required quotient group.

In the Klein four-group $V=\{1,a,b,ab\}$, the chainsare distinct composition series. All their composition factors are $C_2$.

The Jordan–Hölder theorem states that any two composition series of a group have the same length and the same composition factors up to permutation and group isomorphism. Thus the subgroup chains may differ, while the multiset of simple quotients is intrinsic.

A composition series is a finite chainwhose inclusions are strict and whose quotients $G_i/G_{i-1}$ are simple. These quotients are the composition factors. The normal subgroup condition is relative to the next member, rather than necessarily to all of $G$.

Induct on the order of a finite group. The trivial group has the empty composition series. Otherwise choose a maximal normal subgroup $N⪇G$, which exists because there are finitely many subgroups. The subgroup correspondence theorem identifies normal subgroups of $G/N$ with normal subgroups of $G$ containing $N$, so maximality makes $G/N$ a simple group. By induction $N$ has a composition series; appending $G$ gives one for $G$.

For example, the nonabelian symmetric group $S_3$ haswith composition factors $C_3$ and $C_2$, both abelian.