Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

I'm having a lot of difficultly understanding the approach I should use for this problem. I was wondering if anyone would be able to provide some assistance.

Show that if m = is a product of distinct odd primes, the set of odd a such that

$\left(\dfrac{a}{m}\right)$ = 1 are those lying in half of the congruence classes b modulo m such that gcd(b,m) = 1 . As a corollary, deduce that for any odd integer n > 1, the primes p such that

$\left(\dfrac{n}{p}\right)$ = 1 are those in one of $\varphi(n)$ congruence classes of the $\varphi(2(n))$ congruence classes modulo 4n which can contain odd numbers.

share|cite|improve this question
You could try doing the first part by induction on $r$. – Gerry Myerson Nov 2 '12 at 11:51

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.