<html><head><meta name="color-scheme" content="light dark"></head><body><pre style="word-wrap: break-word; white-space: pre-wrap;">\documentclass[a4paper,12pt]{article}

\begin{document}

\parindent=0pt

QUESTION

Let $p$ be an odd prime. Let $x$ be a positive integer such that
the congruence class $[x]$ is a generator for $U_p$, the group of
units modulo $p$. If $m$ divides $p-1$ write $\prod(m)$ for the
integer

$$\prod(m)=1+x^m+x^{2m}+x^{3m}+\ldots+x^{m(((p-1)/m)-1)}=1+x^m+\ldots+x^{p-1-m}.$$

\begin{description}

\item[(i)]
Show that

$$\prod(p-1)\equiv1\textrm{modulo} p).$$

\item[(ii)]
If $1\leq m&lt;p-1$ show that

$$(x^m-1)\prod(m)\equiv0(\textrm{ modulo }p).$$

\item[(iii)]
Use (ii) to show that

$$\prod(m)\equiv0\textrm{ modulo }p)$$

if $1\leq m&lt;p-1$.

\item[(iv)]
For the rest of the question suppose that $p=p_1\ldots p_k+1$
where $p_1,p_2,\ldots,p_k$ are distinct primes. Show that

$\sum_{1\leq j\leq p-1, gcd(j,p-1)}1^{x^j}$

$$\equiv\prod(1)-\sum_{s}\prod(p_s)+\sum_{s&lt;t}\prod(p_sp_t)-\sum_{s&lt;t&lt;u}\prod(p_sp_tp_u)$$

$$+\ldots+(-1)^k\prod(p_1p_2\ldots p_k)\ (\textrm(modulo )p).$$

\item[(v)]
Use part (iv) to show that

$$\sum_{1\leq j\leq p-1,gcd(j,p-1)=1}x^j\equiv(-1)^k\
(\textrm{modulo }p).$$

\end{description}



ANSWER

\begin{description}

\item[(i)]
By definition we have $\prod(p-1)=1$.

\item[(ii)]
If $1\leq m&lt;p-1$ then

\begin{eqnarray*}
&amp;&amp;(x^m-1)\prod(m)\\
&amp;=&amp;x^m(1+x^m+\ldots_x^{p-1-1})-(1+x^m+\ldots+x^{p-1-m})\\
&amp;=&amp;x^m+x^{2m}+\ldots+x^p+1-1-x^m-\ldots-x^{p-1-m}\\ &amp;=&amp;x^{p-1}-1
\end{eqnarray*}

and $x^{p-1}\equiv1$ (modulo $p$) by Fermat's little Theorem.

\item[(iii)]
Since $x$ is a generator for $U_p$ it has multiplicative order
$p-1$ modulo $p$. Therefore, when $1\leq m&lt;p-1$ the integer
$x^m-1$ is prime to $p$ and so we can find integers $a,b$ sech
that $1=ap+b(x^m-1)$. Hence $\prod(m)=\prod(m)ap+\prod(m)b(x^m-1)$
which is divisible by $p$, by (ii).

\item[(iv)]
Suppose that $p=p_1\ldots p_k+1$ where $p_1,p_2,\ldots.p_k$ are
distinct primes. Then the sum $\sum_{1\leq j\leq
p-1,gcd(j,p-1)=1}x^j$ may be written as

$$\sum_{i\leq j\leq p-1}x^j-\sum_{1\leq j\leq p-1, gcd(j,
p-1)&gt;1}x^j=\prod(1)-\sum_{1\leq j\leq p-1,gcd(j,p-1)&gt;1}x^j$$

Now the integers, $j$, which satisfy $1\leq j\leq p-1,
gcd(j,p-1)&gt;1$ are precisely all the multiples of

$$p_1,p_2\ldots p_k$$

Therefore as a first approximation to the difference of the two
sums consider

$$\prod(1)-\sum_s\prod(p_s)$$

In this difference we have subtracted from $\prod(1)$ all the
$x^{p_s}$'s but we have subtracted twice the $x^v$'s where $v$ is
a multiple of two of the $p_s$'s. Therefore we should consider

$$\prod(1)-\sum_s\prod(p_s)+\sum_{s&lt;t}\prod(p_sp_t)-\sum_{s&lt;t&lt;w}
\prod(p_sp_tp_w)+\ldots+(-1)^k\prod(p_2p_2\ldots p_k)$$

as required.

\item[(v)]
This follows from (i)-(iv) since all the terms in the alternating
sum of (iv) are zero modulo $p$ except for the last one, which
contributes $(-1)^k$ (modulo $p$).

\end{description}




\end{document}
</pre></body></html>