This is not the answer you are looking for. Go read Brian Conrad'sKConrad's.
|
4 | deleted 5 characters in body | ||
|
|
||||
|
Post Undeleted by Ben Webster♦
|
||||
|
|
||||
|
|
3 | deleted 266 characters in body | ||
|
Robin pointed this out, but I think it's worth saying in This is not the answer box: the definition of "p is unramified" is that there you are no repeated factors mod plooking for. It is then a (not terribly difficult) theorem that this happens if and only if p divides the discriminantGo read Brian Conrad's. |
||||
|
Post Deleted by Ben Webster♦
|
||||
|
2 | added 2 characters in body | ||
|
|
1 |
|
||
