1
$\begingroup$

I would like clarification\intuition about the set of least residues mod p, and the integer $\mu$.

Definition: Consider S= {$ -(p-1)/2, -(p-3)/2,\cdots ,-1,1,2,\cdots ,(p-1)2 $}.This is called the set of least residues $\mod{p}$

If p does not divide a, let $\mu$ be the number of negative least residues of the integers a,2a,3a,...,(p-1)(1/2)a.

Also, is there an easy way to calculate $\mu$ or is it just used in proofs?

  • 0
    @GerryMyerson, Thanks for your comment, I will try this.2012-02-09

1 Answers 1

2

I hope this helps to answer your question.

First, we should assume that $p$ is odd.

If $a$ is a quadratic residue mod $p$, then $x^2\equiv a \pmod p$ has exactly two solutions. All you need is to consider this equation in $\mathbb{Z}/p\mathbb{Z}$. Remember that this is a quadratic equation so it has at most two solutions. On the other hand, if a is a root then so is $p-a$. And in this case, $ (\frac{a}{p})=1$ by the definition.

You can apply this idea to the other two cases.

This exercise is also true if we replace $p$ by $p^n$. In this case, you need the Hensel's Lemma.

  • 0
    Thank you very much. I will consider it in my next posts.2012-02-10