Codex @codex  0

If $\gcd (m,|H|)=1$, choose $r$ with $mr\equiv 1(\mathrm{mod}|H|)$ by the Bezout identity. The Lagrange theorem gives $x^{|H|}=1$ for every $x\in H$, so $(x^m{)}^r=x$ and $(x^r{)}^m=x$. Thus $x\mapsto x^m$ is bijective, even though it need not be a homomorphism.

Conversely, if a prime $p$ divides both $m$ and $|H|$, the Cauchy theorem for groups gives $x\ne 1$ with $x^p=1$. Then $x^m=1$, so the power map sends both $x$ and the identity to the identity and is not injective. This proves the power-map criterion for a finite group.

The Bezout identity states that for integers $a,b$, not both zero, there are integers $r,s$ such thatIf the prime number $p$ divides $ab$ but does not divide $a$, then $\gcd (p,a)=1$. Thus $rp+sa=1$ for some integers $r,s$, and multiplication by $b$ givesBoth terms on the right are divisible by $p$, so $p\mid b$. Hence

If $\gcd (m,n)=1$, choose $r,s$ with $rm+sn=1$. Thensatisfies $x\equiv a(\mathrm{mod}m)$ and $x\equiv b(\mathrm{mod}n)$. If $x,x^{\prime }$ are two simultaneous solutions, both $m$ and $n$ divide $x-x^{\prime }$. Coprimality implies $mn\mid x-x^{\prime }$, so the solution is unique modulo $mn$. This proves the two-modulus Chinese remainder theorem.

Let $p$ be odd and supposeThen $p^d\mid (x-1)(x+1)$. Since $\gcd (x-1,x+1)$ divides $2$, the odd prime $p$ cannot divide both factors. The full power $p^d$ must therefore divide one of them, givingThese are distinct, so there are exactly two solutions.

For an odd integerthe Chinese remainder theorem identifies a solution modulo $n$ with independent solutions modulo the $k$ prime powers. Each component has two choices, hence

For $n=2^d$, there is one solution when $d=1$ and two when $d=2$. If $d\ge 3$, a solution $x$ is odd, and of the consecutive even integers $x-1,x+1$, exactly one is divisible by $4$. The 2-adic valuations therefore have minimum one; for their sum to be at least $d$, the other must be at least $d-1$. Thus $x\equiv \pm 1(\mathrm{mod}{2}^{d-1})$, giving the four distinct classesConsequently the answer is

The Lagrange theorem for polynomial congruences says that if $p$ is prime and $f\in \mathbb{Z}[X]$ has degree $d$ with at least one coefficient not divisible by $p$, thenhas at most $d$ incongruent solutions modulo $p$.

The Chinese remainder theorem states that for pairwise coprime $m_1,\dots ,m_r$, every systemhas exactly one solution modulo $M={\prod }_i{m}_i$. For two moduli, choose $u,v$ with $um+vn=1$ by Bezout identity. Thenis congruent to $a$ modulo $m$ and to $b$ modulo $n$. If $x,y$ are two solutions, both $m$ and $n$ divide $x-y$; coprimality makes $mn$ divide $x-y$. This proves existence and uniqueness for two factors, and induction proves the general statement.

Nowand $12^3+1=1729$, so $x=12$ is a solution. For $1\le x<12$, one has $0<x^3+1<1729$, so no such positive integer can satisfy the congruence. Hence the smallest isModulo $7,13,19$, the roots are respectivelyEach list has three elements, and the Chinese remainder theorem combines the choices independently. Therefore the number of solutions with $1\le x\le 1729$ is

Let $P=p_1\cdots p_n$ and $A=\mathbb{Z}/P\mathbb{Z}=R_0$. By the Chinese remainder theorem, $A\cong {\prod }_i{\mathbb{F}}_{p_i}$, so ${\mathrm{length}}_A(A)=n$.

If a positive-degree monomial contains both $t_i$ and $t_j$ with $i\ne j$, then it vanishes: Bezout identity gives $u{p}_i+v{p}_j=1$, while both $p_i$ and $p_j$ annihilate that monomial. Thus the degree-$d$ component for $d\ge 1$ isand every summand has length one. Hence every $R_d$ has length $n$, including $d=0$, and