Class group
Named by 2 essays across one field — each of them below, with the objects they name alongside it.
Also named here as class number — the same set of essays touches all of them, so they are one junction rather than several.
Counting the classes that break factorisation
The class number measures how badly unique factorisation fails in a field, and defined through ideals it looks impossible to compute. Gauss computed it by hand, for every field he wanted, by counting quadratic forms — and every form can be squeezed, by changes of variable that keep its values, into exactly one small standard shape.
Euler's sixty-five convenient numbers
For some n, whether a prime can be written as x² + ny² is settled by its remainder on division by 4n alone, the way a prime's remainder on division by four settles whether it is a sum of two squares. Euler found sixty-five such n, from 1 to 1,848, called them convenient, and used the largest to prove that 18,518,809 is prime. Every one of them is a number whose class group has no element of order more than two — and whether the list is complete is still not known.
Named alongside it
The objects these essays reach for when they reach for this one.
Class numberDiscriminantQuadratic formGenusIdealIdoneal numberModular groupPrimality testQuadratic fieldRemainderUnique factorisation