= Class number problem
{title2=$h(D)=h_0$}
{wiki}
A <class number problem> asks which <number field> or <order in a number field> has a prescribed <class number>. The family is part of the question: fixing the value alone does not specify the degree, discriminant or type of field.
For <imaginary quadratic fields>, it becomes a problem about negative <fundamental discriminants> $D$ and the <class number of a negative discriminant> $h(D)$. Allowing nonfundamental discriminants instead includes an <order in a number field> smaller than the full <ring of integers>. A <reduced positive definite binary quadratic form> and the <enumeration of reduced binary quadratic forms> make each fixed negative-discriminant case an explicit finite calculation.
For example, <class number one for discriminant minus sixty-seven> proves $h(-67)=1$ by exhausting the reduced coefficient possibilities. In a <number field>, class number one means every <ideal> of the <ring of integers> is principal, so the ring is a <principal ideal domain>. This connects a numerical classification with the arithmetic question of whether ideal obstructions to unique factorization remain. A computation for one discriminant does not by itself classify all discriminants of that class number.
Back to article page