42. Complex Numbers.—One of Gauss's most important and far-reaching contributions to arithmetic was his introduction of complex integers
, where
are ordinary integers, and, as usual,
. In this theory there are four units
; the numbers
are said to be associated;
is the conjugate of
and we write
, the norm of
, its conjugate, and associates. The most fundamental proposition in the theory is that the process of residuation (§ 24) is applicable; namely, if
are any two complex integers and
, we can always find integers
euch that
with
. This may be proved analytically, but is obvious if we mark complex integers by points in a plane. Hence immediately follow propositions about resolutions into prime factors, greatest common measure, &c., analogous to those in the ordinary theory; it will only be necessary to indicate special points of difference.
We have
, so that
is associated with a square; a real prime of the form
is still a piime, but one of the form
breaks up into two conjugate prime factors, for example,
. An integer is even, semi-even, or odd according as it is divisible by
or is prime to
. Among four associated odd integers there is one and only one which
; this is said to be primary; the conjugate of a primary number is primary, and the product of any number of primaries is primary. The conditions that
may be primary are
. Every complex integer can be uniquely expressed in the form
, where
, and
are primary primes.
With respect to a complex modulus
, all complex integers may be distributed into
incongruous classes. If
where
are co-primes, we may take as representatives of these classes the residues
where
. Thus when
we may take
, giving the
residues of the real number
; while if
is prime,
form a complete set of residues.
The number of residues of
that are prime to
is given by
![{\displaystyle \phi (m)=\mathrm {N} (m)\Pi \left(1-{\frac {1}{\mathrm {N} (p)}}\right)}](https://wikimedia.org/api/rest_v1/media/math/render/svg/ea5c825a27da91fb1056b5b9e515bf660f043cce)
where the product extends to all prime factors of
. As an analogue to Fermat’s theorem we have, for any integer prime to the modulus,
![{\displaystyle x^{\phi (m)}\equiv 1{\pmod {m}},x^{\mathrm {N} (p)-1}\equiv 1{\pmod {p}}}](https://wikimedia.org/api/rest_v1/media/math/render/svg/7b5e6e3ccb2abf09316118da948ea304e27efb5b)
according as
is composite or prime. There are
primitive roots of the prime
; a primitive root in the real theory for a real prime
is also a primitive root in the new theory for each prime factor of
, but if
be a prime its primitive roots are necessarily complex.
43. If
are any two odd primes, we shall define the symbols
and
by the congruences
![{\displaystyle p^{{\tfrac {1}{2}}\{\mathrm {N} (q)-1\}}\equiv \left({\frac {p}{q}}\right)_{2},p^{{\tfrac {1}{4}}\{\mathrm {N} (q)-1\}}\equiv \left({\frac {p}{q}}\right)_{4},}](https://wikimedia.org/api/rest_v1/media/math/render/svg/8c627f5fb0a2037cb26a2e1d0344bda40c01087a)
it being understood that the symbols stand for absolutely least residues. It follows that
according as
is a quadratic residue of
or not; and that
only if
is a biquadratic residue of
. If p, q are primary primes, we have two laws of reciprocity, expressed by the equations
![{\displaystyle \left({\frac {p}{q}}\right)_{2}=\left({\frac {q}{p}}\right)_{2},\left({\frac {p}{q}}\right)_{4}\left({\frac {q}{p}}\right)_{4}=(-1)^{{\tfrac {1}{4}}\{\mathrm {N} (p)-1\}\cdot {\tfrac {1}{4}}\{\mathrm {N} (q)-1\}}}](https://wikimedia.org/api/rest_v1/media/math/render/svg/d691d08962e6d89055838fdaa586ede2ce2eb977)
To these must be added the supplementary formulae
,
,
being a primary odd prime. In words, the law of biquadratic reciprocity for two primary odd primes may be expressed by saying that the biquadratic characters of each prime with respect to the other are identical, unless
, in which case they are opposite. The law of biquadratic reciprocity was discovered by Gauss, who does not seem, however, to have obtained a complete proof of it. The first published proof is that of Eisenstein, which is very beautiful and simple, but involves the theory of lemniscate functions. A proof on the lines indicated in Gauss’s posthumous papers has been developed by Busche; this probably admits of simplification. Other demonstrations, for instance Jacobi’s, depend on cyclotomy (see below).