Return to Answer

This is not the answer you are looking for. Go read Brian Conrad's.

This is not the answer you are looking for. Go read KConrad's.

Robin pointed this out, but I think it's worth saying in the answer box: the definition of "p is unramified" is that there are no repeated factors mod p. It is then a (not terribly difficult) theorem that this happens if and only if p divides the discriminant.

This is not the answer you are looking for. Go read Brian Conrad's.

Robin pointed this out, but I think it's worth saying in the answer box: the definition of "p is unramified" is that there are no repeated factors mod p. It is then a (not terribly difficult) theorem that is happens if and only if p divides the discriminant.

Robin pointed this out, but I think it's worth saying in the answer box: the definition of "p is unramified" is that there are no repeated factors mod p. It is then a (not terribly difficult) theorem that this happens if and only if p divides the discriminant.