By Stirling's approximation,
Here and , as is seen by taking the natural logarithm. The Cauchy-Hadamard theorem gives .
The Cauchy-Hadamard theorem states . At the prime numbers , this root equals . There are infinitely many prime numbers, so these indices form an unbounded subsequence. For every other positive index the root is zero. The limit superior is therefore one, and .
Let . Its derivative is
which is negative for . Also , since a positive power eventually dominates the natural logarithm. Thus the alternating series test proves convergence of .
For , , whose p-series diverges. The comparison test therefore rules out absolute convergence. The answer is conditional convergence.
For , , so
The integral test applies to the decreasing positive comparison function, and
The comparison test proves that the series converges; since all terms are nonnegative, this is also absolute convergence.
The binomial theorem gives . Therefore
The geometric series with ratio converges. By the comparison test, the given series is absolutely convergent.
The implication is false. Set
Then . For , , so . The integral test gives
Thus the comparison test shows that diverges.
The implication is true, with absolute convergence. Since , there is such that for . The p-series converges because its exponent exceeds one. The comparison test proves , and absolute convergence implies convergence of .
The sine has values on the four residue classes of modulo four. For , the exponential function gives ; the other residue classes tend to . All terms satisfy , and the first class approaches . Hence
At even integers , the terms are . At odd integers they are . The largest eventual values therefore come from the subsequence at even integers, and
Explicitly, every sufficiently late term is below , while infinitely many even integers give terms greater than .
For with , bijectivity of and the previous part imply
The supplied numerical fact forces . Thus permutes the transpositions.
Suppose , and write for . These are distinct transpositions. For , the product has order of a group element three, so also has order three. Two distinct transpositions have this property precisely when their two-element sets of moved points meet in one point: disjoint ones have a product of order two, whereas ones sharing one point have a three-cycle as product. The two-element support of a permutation associated with each therefore meets that of every other .
We now show that they have a common point. Choose two; the support of a permutation is for one and for the other, where are distinct. Any further two-element set meeting both either contains or is . If occurs, any two-element set meeting all three must itself be one of : a set containing must also contain or , and a set omitting must contain both . Hence a pairwise-intersecting family with no common point consists of exactly those three edges of a triangle.
For , there are distinct , ruling out that triangle. For , the two sets already have a common point. For , the triangle alternative would make all three fix the fourth point. They would then generate a proper subgroup of , contrary to surjectivity of and part (a)(iv), which imply that the generate . Thus in every case there is a common point , and we may write
The are distinct and different from , so they exhaust the remaining points. Define a permutation by
Then
The two group homomorphisms and agree on a generating set of a group, so agree on every product of its elements, hence throughout :
Finally, is trivial and has a unique nonidentity element, so every automorphism of either is the identity and we can take . This completes all degrees and proves that every such automorphism is an inner automorphism.
Assume first . All transpositions form a single conjugacy class . A group automorphism preserves order of a group element, so the image of a transposition is a nonidentity involution. By the order formula, its disjoint cycle decomposition contains only one-cycles and two-cycles, with at least one two-cycle. Thus it lies in some , where .
Moreover an automorphism maps the entire conjugacy class onto the conjugacy class of the image: for a fixed transposition ,
and runs over all of by surjectivity. Part (a)(i) identifies that latter conjugacy class as . Hence , with equality rather than just inclusion. If , is empty and the equality holds trivially with .
For distinct , direct conjugation gives
Thus the given star transpositions generate every transposition. Every cycle can in turn be expressed as
By the disjoint cycle decomposition, every permutation is a product of cycles, hence of transpositions, hence of the given star transpositions. Therefore
For , the empty generating set of a group generates the trivial group .
For , first select an ordered list of distinct entries. There are lists. Pair consecutive entries to obtain
Each product of disjoint transpositions is counted times: each pair has two orientations, and the pairs can be ordered in ways. There is no other duplication, by uniqueness of the disjoint cycle decomposition. Therefore
If , there are no such permutations. For , .
Let the lengths in the disjoint cycle decomposition of be , with fixed points contributing length one. Disjoint cycles commute, and if and only if every cycle raised to is the identity, equivalently divides for every . Hence the order of a group element is
In particular, the identity has order one.
Conjugating a cycle simply relabels its entries. With permutations composed from right to left,
This follows by applying each side to and to points outside the displayed cycle. Consequently conjugation preserves the lengths in the disjoint cycle decomposition, including fixed points, and therefore preserves cycle type.
Conversely, suppose two permutations have the same cycle type. Pair their cycles of equal length, including their one-cycles. Define a bijection by mapping the entries of each cycle of the first permutation, in their cyclic order, to the entries of the paired cycle of the second. Because the cycles partition , these assignments combine into a permutation. The displayed identity then conjugates the first permutation to the second. Thus they are conjugate group elements exactly when their cycle types agree.
Put . Repeated application of part (iv), or mathematical induction on , gives
Part (ii) therefore implies that is an infinite set. If is nonempty, choose . We claim its left coset is wholly outside . If for some , then and closure under products and inverses would give , a contradiction.
Thus . Part (i) makes infinite, so the complement is infinite. If there is no such , the complement is empty. This proves the complement of a finite union of finite-index subgroups property:
Define a map between sets of left cosets by
It is well defined: replacing by for changes neither component. It is injective because
The Cartesian product on the right has at most elements. Therefore
This proves the basic bound for a finite intersection of finite-index subgroups.
Every left coset with is also a left coset of in . Moreover equality of two such cosets means the same thing in and in :
Thus the map from the set of left cosets of in to the set of left cosets of in , taking to itself, is injective. Consequently the index of a subgroup satisfies
These are sets of cosets; no normal subgroup assumption is needed.
Suppose were finite, say . There are at most left cosets, each with elements by part (i), and they partition . Hence would be a finite set with at most elements. This contradicts the assumption that is an infinite group. Therefore .
For every , left multiplication gives a bijection
whose inverse is . Hence every left coset has the same cardinality as . If is an infinite set, every left coset is infinite; if is a finite set, every left coset is finite. These are the only possibilities.

There are unlisted articles, also show them or only show them.