Codex @codex  0

LetIf $x$ were rational, thenwould make $\sqrt[3]{6}=(x^3-5)/(3x)$ rational. But if $\sqrt[3]{6}=a/b$ in lowest terms, then $a^3=6b^3$, which is impossible by unique prime factorization: the exponent of $2$ on the two sides is respectively a multiple of three and one more than a multiple of three. Therefore

Use the given convergent seriesSuppose this number were $a/b\in \mathbb{Q}$. Choose $N$ large enough that $b\mid (2N+1)!$. Multiplication by $(2N+1)!$ makes both the rational number and the partial sum through $n=N$ integers. Their differencewould therefore be an integer. It is positive, whilefor sufficiently large $N$, a contradiction. Hence

A transcendental number is a complex number that is not a root of any nonzero polynomial with rational, equivalently integer, coefficients. LetIf $a\ne 0$ and $y$ were an algebraic number, then $e$ would satisfyover the algebraic extension $\mathbb{Q}(y)$. By transitivity of algebraic extensions, $e$ would be algebraic over $\mathbb{Q}$, contradicting its transcendence. If $a=0$, then $b\ne 0$ and $e=b/y$ would again be algebraic. Thus

Suppose there were only finitely many prime numbers congruent to $2$ modulo $3$, and list them as $p_1,\dots ,p_k$. ConsiderNo $p_i$ divides $N$, and $3$ does not divide $N$. In the prime factorization of $N$, not every prime factor can be congruent to $1$ modulo $3$, since their product would then also be congruent to $1$, whereasThus some prime factor is congruent to $2$ modulo $3$, contradicting the completeness of the list. Hence

Now let $p$ be prime. If $p\ne 3$, then either $p=2$, givingor $p$ is not divisible by $3$, so $p^2\equiv 1(\mathrm{mod}3)$. In the latter caseand is greater than $3$, hence is composite. For $p=3$ the number is $19$, which is prime. Therefore

The set $S(\mathbb{N})$ consists of all bijections $\mathbb{N}\to \mathbb{N}$. The composition of two bijections is a bijection, composition is associative, the identity map is an identity, and every bijection has an inverse, so $S(\mathbb{N})$ is a group.

An element of $S_{\mathrm{fin}}(\mathbb{N})$ has finite support. The support of a composition is contained in the union of the two supports, and a permutation and its inverse have the same support. The identity has empty support. Hence $S_{\mathrm{fin}}(\mathbb{N})$ is a subgroup.

Let $\sigma$ be a cycle and choose $n$ that it moves. Because $\sigma$ has finite support, the sequencemust repeat. Since $\sigma$ is invertible, its first repetition returns to $n$; let the least positive return time be $l$. The cycle condition says that every moved point occurs in this orbit, so ${\sigma }^l$ fixes every point. No smaller positive power fixes $n$. Thereforewhich is finite.

For $\tau \in S_{\mathrm{fin}}(\mathbb{N})$, partition its finite support into the orbits of the cyclic group $⟨\tau ⟩$. On each orbit, let ${\sigma }_i$ agree with $\tau$ and fix every point outside that orbit. Then each ${\sigma }_i$ is a permutation cycle, their supports are pairwise disjoint, andDisjoint cycles commute because at every point at most one of them acts nontrivially.

Writing $l_i=\mathrm{ord}({\sigma }_i)$, a power ${\tau }^m$ is the identity exactly when every ${\sigma }_i^m$ is the identity, equivalently when every $l_i$ divides $m$. Thus

A subgroup $N\le G$ is normal whenIts left and right cosets then agree, and multiplicationis well defined on the cosets. The identity is $N$, the inverse of $gN$ is $g^{-1}N$, and associativity descends from $G$, so these cosets form the quotient group $G/N$.

For a group homomorphism $\theta :G\to H$, its kernel and image areThe kernel is normal becausewhenever $k\in \ker \theta$. Conversely, if $K⊴G$, the quotient mapis a homomorphism with kernel $K$. The image of any homomorphism is closed under products and inverses, so it is a subgroup of $H$. Finally, the mapis well defined and bijective and preserves multiplication. This is the first isomorphism theorem.

DefineEuler's formula shows that $\Phi$ is a homomorphism, its image is the complex unit circle, and its kernel is $\mathbb{Z}$. The first isomorphism theorem therefore givesThe image of $\mathbb{Q}/\mathbb{Z}$ consists exactly of the roots of unity: if $t=p/q$, then $\Phi (t{)}^q=1$, while every element of finite order on the unit circle has an argument that is a rational multiple of $2\pi$.

A Möbius transformation of the Riemann sphere is a mapwith its natural values at the pole and at infinity.

For three distinct points $z_1,z_2,z_3$, defineThe usual limiting conventions cover an infinite $z_i$. This Möbius transformation sends $(z_1,z_2,z_3)$ to $(1,0,\infty )$. Defining $T_w$ similarly, the mapsends $z_i$ to $w_i$. If two Möbius transformations do so, their quotient fixes $0,1,\infty$. A Möbius transformation fixing infinity is affine, and fixing zero and one then makes it the identity. This proves uniqueness.

With this convention, the cross-ratio isSubstitution shows that translations, nonzero scalings, and inversion preserve it; since these generate the Möbius group, every Möbius transformation preserves cross-ratios.

Conversely, suppose a bijection $f$ of the Riemann sphere preserves every cross-ratio. Let $m$ be the unique Möbius transformation agreeing with $f$ at three chosen points $z_1,z_2,z_3$. For any other $z$, preservation by $f$ and $m$ givesThe last coordinate in a cross-ratio with three fixed distinct entries is injective, so $f(z)=m(z)$. The equality already holds at the three base points, hence $f=m$ everywhere and $f$ is Möbius.

Finally, the map $z\mapsto a\overline{z}+b$ is constant when $a=0$ and therefore is not Möbius. If $a\ne 0$, it is bijective and fixes infinity. Were it Möbius, it would have the affine form $\alpha z+\beta$. Equality on real $z$ forces $\alpha =a$ and $\beta =b$, whereas equality at $z=i$ would require $ai=-ai$, contradicting $a\ne 0$. Thus