All Questions
1 question
24
votes
2
answers
2k
views
Have we ever proved any non-solvable case of reciprocity without the Langlands program ?
The reciprocity of the title is the following not completely well-posed problem:
Fix $P(X)$ a monic irreducible polynomial of degree $n$, with coefficients in $\mathbb Z$. "Describe"
(in some sense) ...
- 26k