Link to home
Start Free TrialLog in
Avatar of AlephNought
AlephNought

asked on

Jacobi symbol problem

n is odd and square-free
The sum (k/n)=0, where the sum taken over all k in a reduced set of residues modulo n. Use this to show that the number of integers in a reduced set of residues modulo n such that (k/n)=1 is equal to the number with (k/n)= -1.
Avatar of AlephNought
AlephNought

ASKER

I'm not looking for an answer at all. I'd just like to understand how to approach the problem. For example, I have already determined that the sum is 0. (This wasn't part of the question, so I entered it in b/c I thought this fact might be useful somehow.) I think this question is sayin that the number of quadratic residues (k/n)=(k/p1)(k/p2)...(k/pr) and quadratic nonresidues are equaivatent, but isn't that why the sum is 0? So I really don't know what more the question wants me to show.
ASKER CERTIFIED SOLUTION
Avatar of AlephNought
AlephNought

Link to home
membership
This solution is only available to members.
To access this solution, you must be a member of Experts Exchange.
Start Free Trial