For n at least 2, it is easy to show that the lower bound is greater than 1, so we obtain Minkowski's Theorem, that the discriminant of every number field, other than Q, is non-trivial.
For n at least 2, it is straightforward to demonstrate that the lower bound exceeds 1, yielding Minkowski's Theorem, which asserts that every number field, except Q, possesses a non-trivial discriminant.