Hilbert number (source code)

= Hilbert number
{c}
{title2=$4k+1$}

A <Hilbert number> is a <positive integer> congruent to $1$ <modulo> $4$: the first examples are $1,5,9,13,17$. The <Hilbert numbers> form a <multiplicative set>, because a <product> of two <integers> congruent to $1$ <modulo> $4$ again has that residue.

This set inherits multiplication from the <integers>, but restricting its allowed factors changes <divisibility> questions. For example, $9$ belongs to the <Hilbert numbers> while $3$ does not. Its ordinary factorization $9=3\times3$ is therefore unavailable as a factorization into smaller <Hilbert numbers>. The <squarefree Hilbert number> definition uses this restricted collection of factors.