Skip to main content

Timeline for Reciprocity theorem with $n \ge 5$

Current License: CC BY-SA 4.0

7 events
when toggle format what by license comment
Jun 4, 2020 at 22:22 comment added Henri Cohen I strongly suggest that you read the excellent and very complete book of Franz Lemmermeyer (who is on MO) on the subject.
Jun 4, 2020 at 17:11 comment added Wojowu If $n$ is a prime and $\mathbb Q(\zeta_n)$ has class number 1, then you can use Eisenstein reciprocity to give a similar criterion.
Jun 4, 2020 at 17:04 comment added LSpice I found it very hard to understand the question, so I re-phrased it, hopefully without changing the meaning. Feel free to revert or re-edit if I did not succeed. I think you also mean to assume that $p$ is prime. I also mention your earlier question mathoverflow.net/questions/362187/… , which was the case $n = 3$.
Jun 4, 2020 at 17:03 history edited LSpice CC BY-SA 4.0
Re-phrasing
Jun 4, 2020 at 15:54 history edited zomega CC BY-SA 4.0
added 8 characters in body
Jun 4, 2020 at 15:23 history edited Martin Sleziak
edited tags
Jun 4, 2020 at 15:11 history asked zomega CC BY-SA 4.0