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.
Ben Webster ♦
- 44.7k
- 12
- 126
- 260