Solved

Posted on 2009-04-26

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.

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.

2 Comments

Title | # Comments | Views | Activity |
---|---|---|---|

Trying to solve some simple triangle Math | 28 | 78 | |

Michel Meyer experiments | 40 | 194 | |

Representing TIME in Excel | 8 | 41 | |

Where is the math error. | 13 | 58 |

Join the community of 500,000 technology professionals and ask your questions.

Connect with top rated Experts

**19** Experts available now in Live!