Translation:Theoria residuorum biquadraticum

1.
The theory of quadratic residues has been reduced to a few fundamental theorems, to be numbered among the most beautiful relics of Higher Arithmetic. These were first easily discovered by induction, and then were demonstrated in many ways, so that nothing more was left to be desired.

However, the theory of cubic and biquadratic residues is a far deeper undertaking. When we began to investigate this in the year 1805, some special theorems presented themselves, beyond those which had been placed on the threshold, which were very remarkable owing both to their simplicity and to the difficulty of their demonstrations. We soon found out that the principles of higher arithmetic hitherto used were by no means sufficient for establishing the general theory, and rather this necessarily required that the field of higher arithmetic be advanced as if to infinity. How this is to be understood will be elucidated clearly in the remainder of these discussions. As soon as we entered this new field, an approach to the knowledge of the simplest theorems was at once obvious, and the whole theory was exhausted by induction. Yet the demonstrations lay so deeply concealed, that it was only after many fruitless attempts that they could at last be brought to light.

Now that we are preparing to publish these lucubrations, we will begin with the theory of biquadratic residues, and indeed in this first commentary we will describe those investigations which have already been completed within the expanded field of Arithmetic, and which paved the way, as it were. At the same time, we will present some new developments in the theory of division of the circle.

2.
We introduced the concept of a biquadratic residue in Disquisitiones Arithmeticae art. 115. Specifically, an integer $a$, positive or negative, is said to be a biquadratic residue modulo $p$ if $a$  is congruent to a biquadrate modulo $p$ , and likewise a non-residue, if no such congruence exists. In all of the following discussions, unless explicitly stated otherwise, we will assume that the modulus $p$ is a prime number (odd positive), and that $a$  is not divisible by $p$, since all of the remaining cases can easily be reduced to this one.

3.
It is clear that every biquadratic residue modulo $p$ is also a quadratic residue, and therefore every quadratic non-residue is also a biquadratic non-residue. We may also invert this statement whenever $p$ is a prime number of the form $4n+3$. For in this case, if $a$ is a quadratic residue modulo $p$, we can set $a \equiv bbb \pmod{p}$ , and $b$  will either be a quadratic residue or non-residue modulo $p$. In the former case, we can set $b \equiv c c$, and hence $a \equiv c^{4}$ , i. e. $a$ will be a biquadratic residue modulo $p$. In the latter case, $-b$ will be a quadratic residue modulo $p$  (since $-1$  is a quadratic non-residue of any prime of the form $4n+3$ ), and setting $-b \equiv c c$, we will have as before $a \equiv c^{4}$ , so $a$  will be a biquadratic residue modulo $p$. At the same time, it can be easily seen that, aside from the solutions $x \equiv c$ and $x \equiv -c$, no other solutions of the congruence $x^4 \equiv a \pmod{p}$  can be found in this case. Since these propositions clearly exhaust the entire theory of biquadratic residues for prime moduli of the form $4n+3$, we will exclude such moduli entirely from our investigation, or in other words we will limit ourselves to prime moduli of the form $4n+1$.

4.
Given a prime number $p$ of the form $4n+1$, the converse of the proposition in the previous article is invalid: namely, there can exist quadratic residues that are not at the same time biquadratic residues. Indeed, this happens whenever a quadratic residue is congruent to the square of a quadratic non-residue. For setting $a \equiv bb$, where $b$ is a quadratic non-residue modulo $p$ , if the congruence $x^4 \equiv a$  could be satisfied by a value $x \equiv c$ , then we would have $c^4 \equiv bb$ , or the product $(cc-b)(cc+b)$  would be divisible by $p$. Thus $p$ would divide one of the two factors $cc-b$  or $cc+b$, i. e. , either $+b$ or $-b$  would be a quadratic residue modulo $p$, and therefore (since $-1$  is a quadratic residue) both would be quadratic residues, contrary to the hypothesis.

Therefore, all integers not divisible by $p$ can be distributed into three classes, the first containing the biquadratic residues, the second containing the biquadratic non-residues which are at the same time quadratic residues, and the third containing the quadratic non-residues. Clearly, it is sufficient to subject only the numbers $1$, $2$ , $3 \ldots p-1$ to this classification, and half of these will be reduced to the third class, whereas the other half will be distributed between the first and second classes.

5.
However, it will be better to establish four classes, whose nature is as follows.

Let $A$ be the complex of all biquadratic residues modulo $p$  that are situated between $1$  and $p-1$  (inclusive), and let $e$  be an arbitrary quadratic non-residue modulo $p$. Let $B$ be the complex of minimal positive residues arising from the products $e A$  taken modulo $p$, and likewise let $C$  and $D$  be the complexes of minimal positive residues arising from the products $e e A$ , $e^{3} A$  modulo $p$. Having done this, it is easy to see that the numbers in $B$ will be distinct from each other, and likewise for $C$  and $D$. Furthermore, it is clear that all numbers contained in $A$ and $C$  are quadratic residues of $p$, while all those in $B$  and $D$  are quadratic non-residues, so that certainly the complexes $A$  and $C$  cannot have a number in common with the either of the complexes $B$  or $D$. Moreover, $A$ cannot have any number in common with $C$, and $B$  cannot have any number in common with $D$. For suppose

I. that some number from $A$, e. g. $a$, can also be found in $C$ , where it is congruent to a product $e e a^{\prime}$ , with $a^{\prime}$ being a number from the complex $A$. Let $a \equiv \alpha^{4}$, $a^{\prime} \equiv \alpha^{\prime 4}$ , and let an integer $\Theta$ be chosen such that $\Theta \alpha^{\prime} \equiv 1$. Then we have $e e \alpha^{\prime 4} \equiv \alpha^{4}$, and therefore, by multiplying by $\Theta^{4}$ ,

$$e e \equiv \alpha^{4} \Theta^{4}$$

i. e. $ee$ is a biquadratic residue, and therefore $e$  is a quadratic residue, contrary to the hypothesis.

II. Similarly, suppose that some number is common to the complexes $B$, $D$ , and that it comes from products $e a$ , $e^{3} a^{\prime}$ , with $a$ , $a^{\prime}$ being numbers from the complex $A$. Then the congruence $e a \equiv e^{3} a^{\prime}$ would imply $a \equiv e e a^{\prime}$, hence a number would be obtained, which being a product $e e a^{\prime}$  would originate from $C$ , but at the same time would belong to $A$ , which we have just shown to be impossible.

Furthermore, it is easily shown that all quadratic residues modulo $p$, between $1$ and $p-1$  inclusive, must necessarily lie in either $A$  or $C$ , and all quadratic non-residues of $p$  between those limits must necessarily lie in either $B$  or in $D$. For

I. Every such quadratic residue, which is also a biquadratic residue, is found in $A$ by hypothesis.

II. Given a quadratic residue $h$ (less than $p$ ), which is also a biquadratic non-residue, one can find a quadratic non-residue such that $h$  is $\equiv g g$. Find an integer $\gamma$ such that $e \gamma \equiv g$. Then $\gamma$ will be a quadratic residue modulo $p$, which we set $\equiv k k$. Hence

$$h \equiv g g \equiv e e \gamma \gamma \equiv e e k^{4}$$

Therefore, since the minimum residue of $k^{4}$ is found in $A$, the number $h$ , which arises from it by taking the product with $e e$ , must necessarily be contained in $C$.

III. Let $h$ denote a quadratic non-residue modulo $p$  between the limits $1$  and $p-1$, and let $g$  be an integer between the same limits such that $e g \equiv h$. Then $g$ is a quadratic residue, and therefore it is contained in either $A$  or $C$. In the former case, $h$ will clearly be found among the numbers in $B$, and in the latter case, it will be found among the numbers in $D$.

From all this it is deduced that the numbers $1$, $2$ , $3$ , …$p-1$ are distributed among the four series $A$ , $B$ , $C$ , $D$  in such a way that each of them is found in exactly one of these. Therefore, each series must contain exactly $\frac{1}{4}(p-1)$ numbers. In this classification, classes $A$ and $C$  possess their numbers naturally, but the distinction between classes $B$  and $D$  is arbitrary, insofar as it depends on the choice of the number $e$, which is always referred to class $B$. Therefore, if another number from class $D$ is adopted in its place, the classes $B$  and $D$  will be interchanged.

6.
Since $-1$ is a quadratic residue modulo $p$, let us set $-1 \equiv ff \pmod{p}$ , so that the four roots of the congruence $x^{4} \equiv 1$  will be $1$ , $f$ , $-1$ , $-f$. Then if $a$ is a biquadratic residue modulo $p$, say $\equiv \alpha^{4}$ , the four roots of the congruence $x^{4} \equiv a$  will be $\alpha$ , $f \alpha$ , $-\alpha$ , $-f \alpha$ , which are easily seen to be incongruent to each other. Hence, it is clear that if the least positive residues of the biquadrates $1$, $16$ , $81$ , $256 \ldots (p-1)^{4}$ are collected, each will be present four times, so that the $\frac{1}{4}(p-1)$  distinct biquadratic residues forming the complex $A$  will be obtained. If only the minimal residues of biquadrates up to $(\frac{1}{2} p-\frac{1}{2})^{4}$ are collected, then each will occur twice.

7.
The product of two biquadratic residues is clearly a biquadratic residue, as multiplication of two numbers of class $A$ will always produce a product whose minimal positive residue belongs to the same class. Similarly, products of numbers from $B$ with numbers from $D$, or numbers from $C$  with numbers from $C$ , will always have their minimal positive residues in $A$.

Likewise, the residues of the products $A. B$ and $C. D$ fall in $B$ ; the residues of the products $A. C$, $B. B$, and $D. D$ fall in $C$ ; and finally, the residues of the products $A. D$ and $B. C$ fall in $D$.

The proofs are so obvious that it suffices to indicate just one. Let e. g. $c$ and $d$  be numbers from $C$  and $D$, with $c \equiv e ea$ , $d \equiv e^{3} a^{\prime}$ , where $a$  and $a^{\prime}$  are numbers from $A$. Then $e^{4} a a^{\prime}$ will be a biquadratic residue, i. e. its minimal residue will lie in $A$ : thus, since the product $c d$ is $\equiv e e^{4} a a^{\prime}$, its minimal residue will lie in $B$.

At the same time, it can now be easily judged to which class the product of several factors should be referred. Namely, by assigning characters $0$, $1$ , $2$ , $3$ to the classes $A$ , $B$ , $C$ , $D$  respectively, the character of a product will be equal to the sum of the characters, or rather its minimal residue modulo 4.

8.
It seemed worthwhile to develop these elementary propositions without the support of the theory of powers of residues, with whose help it would have been far easier to demonstrate everything thus far.

Let $g$ be a primitive root modulo $p$, i. e. a number such that in the series of powers $g$, $g g$ , $g^3, \ldots$ no value before $g^{p-1}$  is congruent to unity modulo $p$. Then without regard to order, the minimal positive residues of the numbers $1$, $g$ , $g g$ , $g^3, \ldots, g^{p-2}$ agree with $1$ , $2$ , $3, \ldots, p-1$ , and they can be conveniently distributed into four classes in the following manner:

$$ \begin{array}{c|l} \text{to} & \text{the minimal residues of the numbers} \\ \hline A & 1,\phantom{g} g^{4}, g^{8}, \phantom{g}g^{12} \ldots \ldots g^{p-5}\\ B & g,\phantom{g} g^{5}, g^{9}, \phantom{g}g^{13} \ldots \ldots g^{p-4}\\ C & g g, g^{6}, g^{10}, g^{14} \ldots \ldots g^{p-3}\\ D & g^{3}, g^{7}, g^{11}, g^{15} \ldots \ldots g^{p-2}\end{array}$$

Hence all the previous propositions follow automatically.

Moreover, just as here the numbers $1$, $2$ , $3, \ldots, p-1$ have been distributed into four classes, whose complexes we denoted by $A$ , $B$ , $C$ , $D$ , so may any integer not divisible by $p$  be assigned to one of these classes, according to the class of its minimal residue modulo $p$.

9.
We shall denote by $f$ the minimal residue of the power $g^{\frac{1}{4}(p-1)}$  modulo $p$. Then it follows that $f f \equiv g^{\frac{1}{2}(p-1)} \equiv -1$ (Disquis. Arithm. art. 62), and it is clear that $f$  here has the same meaning as in article 6. Thus for an arbitrary positive integer $\lambda$, the power $g^{\frac{1}{4} \lambda(p-1)}$ will be congruent to $1$ , $f$ , $-1$ , $-f$  modulo $p$ , depending on whether $\lambda$  takes the form $4m$ , $4m+1$ , $4m+2$ , $4m+3$  resp. , or as the minimal residue of $g^{\lambda}$ is found in $A$, $B$ , $C$ , $D$  resp. From this we obtain a very simple criterion for deciding to which class a given number $h$ (not divisible by $p$ ) should be referred; namely, $h$  will belong to $A$, $B$ , $C$ , or $D$ , depending on whether the power $h^{\frac{1}{4}(p-1)}$  turns out to be congruent to $1$ , $f$ , $-1$ , or $-f$  modulo $p$.

As a corollary, it follows from this that $-1$ is always referred to class $A$  whenever $p$  is of the form $8n+1$, and to class $C$  whenever $p$  is of the form $8n+5$. A proof of this theorem which is independent of the theory of residual powers can be easily constructed from what we have shown in Disquisitionibus Arithmeticis art. 115, III.

10.
Since all primitive roots modulo $p$ come from residues of powers $g^{\lambda}$, by taking for $\lambda$  all numbers relatively prime to $p-1$ , it is easy to see that these will be equally distributed between the sets ${B}$  and ${D}$ , with the base $g$  always contained in ${B}$. If, instead of the number $g$, a different primitive root from the set $B$ is chosen as the base, the classification will remain the same; however, if a primitive root from the set $D$  is adopted as the base, the sets $B$  and $D$  will be interchanged.

If the classification criterion is built upon the theorem in the previous article, the distinction between the classes $B$ and $D$  will depend on which root of congruence $x x \equiv-1\pmod{p}$  we adopt as the characteristic number $f$.

11.
In order for the more subtle investigations which we are about to undertake to be illustrated by examples, we present here the construction of the classes for all moduli less than $100$. We have adopted the smallest primitive root in each case.

$$\begin{aligned} & \begin{array}{c} p=5 \\ g=2, f=2 \end{array} \\ \begin{array}{l} A \\ B \\ C \\D \end{array} & \begin{array}{|r} 1 \\ 2 \\ 4 \\ 3 \end{array} \\ & \begin{array}{c} p=13 \\ g=2, f=8 \end{array} \\ \begin{array}{l} A \\ B \\ C \\D \end{array} & \begin{array}{|rrr} 1,& 3,& 9 \\ 2,& 5,&6 \\ 4,& 10,& 12 \\ 7,& 8,& 11 \end{array}\\ & \begin{array}{c} p=17 \\ g=2, f=12 \end{array} \\ \begin{array}{l} A \\ B \\ C \\D \end{array} & \begin{array}{|rrrr} 1,& 4,&13,& 16 \\ 3,& 5,&12,&14 \\ 2,& 8,& 9,&15 \\ 6,& 7,&10,&11 \end{array} \\ & \begin{array}{c} p=29 \\ g=2, f=12 \end{array} \\ \begin{array}{l} A \\ B \\ C \\D \end{array} & \begin{array}{|rrrrrrr} 1,&7,&16,&20,&23,&24,&25\\ 2,& 3,&11,&14,&17,&19,&21 \\ 4,& 5,&6,&9,&13,&22,&28 \\ 8,& 10,& 12,&15,&18,& 26,&27 \end{array} \\ & \begin{array}{c} p = 37 \\ g=2, f=31 \end{array} \\ \begin{array}{l} A \\ B \\ C \\D \end{array} & \begin{array}{|rrrrrrrrr} 1,&7,&9,&10,&12,&16,&26,&33,&34 \\ 2,& 14,&15,&18,&20,&24,&29,&31,&32 \\ 3,& 4,& 11,&21,&25,&27,&28,&30,&36 \\ 5,&6,&8,& 13,& 17,&19,&22,& 23,&35 \end{array} \\ & \begin{array}{c}p=41 \\ g=6, f=32 \end{array} \\ \begin{array}{l} A \\ B \\ C \\D \end{array} & \begin{array}{|rrrrrrrrrr} 1,&4,&10,&16,&18,&23,&25,&31,&37,&40 \\ 6,& 14,&15,&17,&19,&22,&24,&26,&27,&35 \\ 2,& 5,& 8,&9,&20,&21,&32,&33,&36,&39 \\ 3,&7,&11,& 12,& 13,&28,&29,& 30,&34,&38 \end{array} \\ & \begin{array}{c} p=53 \\ g=2, f=30 \end{array} \\ \begin{array}{l} A \\ B \\ C \\D \end{array} & \begin{array}{|rrrrrrrrrrrrr} 1,&10,&13,&15,&16,&24,&28,&36,&42,&44,&46,&47,&49 \\ 2,&3,& 19,&20,&26,&30,&31,&32,&35,&39,&41,&45,&48 \\ 4,& 6,& 7,&9,&11,&17,&25,&29,&37,&38,&40,&43,&52 \\ 5,&8,&12,&14,&18,&21,&22,& 23,&27,&33,&34,&50,&51 \end{array} \\ & \begin{array}{c} p=61 \\ g=2, f=11 \end{array} \\ \begin{array}{l} A \\ B \\ C \\D \end{array} & \begin{array}{|rrrrrrrrrrrrrrr} 1,&9,&12,&13,&15,&16,&20,&22,&25,&34,&42,&47,&56,&57,&58 \\ 2,&7,& 18,&23,&24,&26,&30,&32,&33,&40,&44,&50,&51,&53,&55 \\ 3,& 4,& 5,&14,&19,&27,&36,&39,&41,&45,&46,&48,&49,&52,&60 \\ 6,&8,&10,&11,&17,&21,&28,& 29,&31,&35,&37,&38,&43,&54,&59 \end{array} \\ & \begin{array}{c} p=73 \\ g=5, f=27 \end{array} \\ \begin{array}{l} A \\ B \\ C \\D \end{array} & \begin{array}{|rrrrrrrrrrrrrrrrrr} 1,&2,&4,&8,&9,&16,&18,&32,&36,&37,&41,&55,&57,&64,&65,&69,&71,&72 \\ 5,&7,&10,&14,&17,&20,&28,&33,&34,&39,&40,&45,&53,&56,&59,&63,&66,&68 \\ 3,&6,&12,&19,&23,&24,&25,&27,&35,&38,&46,&48,&49,&50,&54,&61,&67,&70 \\ 11,&13,&15,&21,&22,&26,&29,& 30,&31,&42,&43,&44,&47,&51,&52,&58,&60,&62 \end{array} \\ & \begin{array}{c} p=89 \\ g=3, f=34 \end{array} \\ \begin{array}{l} A \\ B \\ C \\ D \\\end{array} & \begin{array}{|rrrrrrrrrrrrrrrrrrrrrr} 1,&2,&4,&8,&11,&16,&22,&25,&32,&39,&44,&45,&50,&57,&64,&67,&73,&78,&81,&85,&87,&88\\ 3,&6,&7,&12,&14,&23,&24,&28,&33,&41,&43,&46,&48,&56,&61,&65,&66,&75,&77,&82&83,&86 \\ 5,&9,&10,&17,&18,&20,&21,&34,&36,&40,&42,&47,&49,&53,&55,&68,&69,&71,&72,&79,&80,&84&\\ 13,&15,&19,&26,&27,&29,& 30,&31,&35,&37,&38,&51,&52,&54,&58,&59,&60,&62,&63,&70,&74,&76 \end{array} \\ & \begin{array}{c} p=97 \\ g=5, f=22 \end{array} \\ \begin{array}{l} A \\ B \\ C \\ D \\ \end{array} & \begin{array}{|rrrrrrrrrrrrrrrrrrrrrr} 1,&4,&6,&9,&16,&22,&24,&33,&35,&36,&43,&47,&50,&54,&61,&62,&64,&73,&75,&81,&88,&91,&93,&96 \\ 5,&13,&14,&17,&19,&20,&21,&23,&29,&30,&41,&45,&52,&56,&67,&68,&74,&76,&77,&78,&80,&83,&84,&92 \\ 2,&3,&8,&11,&12,&18,&25,&27,&31,&32,&44,&48,&49,&53,&65,&66,&70,&72,&79,&85,&86,&89,&94,&95\\ 7,&10,&15,&26,&28,&34,&37,&38,&39,&40,&42,&46,&51,&55,&57,&58,&59,&60,&63,&69,&71,&82,&87,&90 \end{array} \end{aligned}$$

12.
Since the number 2 is a quadratic residue modulo all prime numbers of the form $8n+1$, and a non-residue modulo all prime numbers of the form $8n+5$ , it will be found in classes $A$ or $C$  for prime moduli of the former form, and in classes $B$  or $D$  for prime moduli of the latter form. Since the distinction between classes $B$ and $D$  is not essential, and indeed depends only on the choice of the number $f$, we will temporarily set aside the moduli of the form $8n+5$. By applying induction to moduli of the form $8n+1$, we find that $2$ belongs to $A$  for $p=73$ , $89$ , $113$ , $233$ , $257$ , $281$ , $337$ , $353$ , etc. ; on the contrary, $2$ belongs to $C$  for $p=17$, $41$ , $97$ , $137$ , $193$ , $241$ , $313$ , $401$ , $409$ , $433$ , $449$ , $457$ , etc.

Moreover, since the number $-1$ is a biquadratic residue modulo any prime of the form $8n+1$, it is evident that $-2$  always belongs to the same class as $+2$.

13.
If the examples of the previous article are compared to each other, no simple criterion seems to offer itself, at least at first sight, by which it would be possible to distinguish the former moduli from the latter. Nevertheless, two such criteria can be found, distinguished by their elegance and remarkable simplicity, to which the consideration of the following observations will pave the way.

The modulus $p$ being a prime number of the form$8 n+1$, it is reducible, and indeed in only one way, to the form $a a+2 b b$  (Disquiss. Arithm. art. 182, II); we will assume that roots $a$ , $b$  are taken positively. Clearly $a$ will be odd, and $b$  will be even; let us set $b=2^{\lambda} c$, where $c$  is odd. We now observe

I. By assumption, $p \equiv a a \pmod$, so $p$ is a quadratic residue modulo $c$ , and therefore it is also a quadratic residue modulo each prime factor of $c$. Therefore, by the fundamental theorem, each of these prime factors will be a quadratic residue modulo $p$, and therefore also their product $c$ will be a quadratic residue modulo $p$. Since this also holds for the number $2$, it is clear that $b$ is a quadratic residue modulo $p$ , and therefore both $b b$  and $-b b$  are biquadratic residues.

II. It follows that $-2 b b$ must belong to the same class as the number $2$. Therefore, since $a a \equiv-2 b b$, it is clear that $2$ will belong to class $A$  or class $C$ , depending on whether $a$  is a quadratic residue or non-residue modulo $p$.

III. Now let us suppose that $a$ has been resolved into its prime factors, among which those which are of the form $8 m+1$  or $8 m+7$  are denoted by $\alpha$, $\alpha^{\prime}$ , $\alpha^{\prime \prime}$  etc. , and those which are of the form $8 m+3$ or $8 m+5$  are denoted by $\beta$, $\beta^{\prime}$ , $\beta^{\prime \prime}$  etc. Let the multitude of the latter be $=\mu$. Since $p \equiv 2 b b \pmod{a}$, $p$ will be a quadratic residue modulo those prime factors of $a$  for which 2 is a quadratic residue, i. e. the factors $\alpha$, $\alpha^{\prime}$ , $\alpha^{\prime \prime}$ etc. ; and it will be a quadratic non-residue modulo those factors for which $2$ is a quadratic non-residue, i. e. the factors $\beta$, $\beta^{\prime}$ , $\beta^{\prime \prime}$ etc. Therefore, by the fundamental theorem, each of the numbers $\alpha$, $\alpha^{\prime}$ , $\alpha^{\prime}$ , $\alpha^{\prime \prime}$ etc. will be a quadratic residue modulo $p$, and each of the numbers $\beta$ , $\beta^{\prime}$ , $\beta^{\prime \prime}$ etc. will be a quadratic non-residue. From this it follows that the product $a$ will be a quadratic residue or non-residue modulo $p$, depending on whether $\mu$  is even or odd.

IV. But it is easily confirmed that the product of all $\alpha$, $\alpha^{\prime}$ , $\alpha^{\prime \prime}$ etc. will be of the form $8 m+1$ or $8 m+7$, and the same holds for the product of all $\beta$ , $\beta^{\prime}$ , $\beta^{\prime \prime}$  etc. , if the multitude of these is even. So, in this case the product $a$ must necessarily be of the form $8 m+1$  or $8 m+7$. On the other hand, the product of all $\beta$, $\beta^{\prime}$ , $\beta^{\prime \prime}$ etc. , whenever their multitude is odd, will be of the form $8 m+3$ or $8 m+5$, and the same holds in this case for the product $a$.

From all of this, an elegant theorem can be deduced:

When $a$ is of the form $8m+1$  or $8m+7$, the number $2$  will be in the complex $A$ ; but whenever $a$  is of the form $8m+3$  or $8m+5$ , it will be in the complex $C$ .

This is confirmed by the examples enumerated in the preceding article; the former moduli are thus resolved: $73=1+2.36$, $89=81+2.4$ , $113=81+2.16$ , $233=225+2.4$ , $257=225+2.16$ , $281=81+2.100$ , $337=49+2.144$ , $353=225+2.64$ ; but the latter thus: $17=9+2.4$ , $41=9+2.16$ , $97=25+2.36$ , $137=9+2.64$ , $193=121+2.36$ , $241=169+2.36$ , $313=25+2.144$ , $401=9+2.196$ , $409=121+2.144$ , $433=361+2.36$ , $449=441+2.4$ , $457=169+2.144$.

14.
Since the factorization of the number $p$ into a simple and double square has produced such a remarkable connection with the classification of the number $2$, it seems worthwhile to investigate whether the decomposition into two squares, to which the number $p$  is equally liable, may provide a similar success. Behold then, the decompositions of the numbers $p$ for which $2$  belongs to the class

$$\begin{array}{c|c} A & C \\ \hline \begin{aligned} 9&+64 \\ 25&+64  \\ 49&+64 \\ 169&+64\\ 1&+256 \\ 25&+256\\ 81&+256\\ 289&+64\\ \\ \\ \\ \\ \end{aligned} & \begin{aligned} 1&+16\\ 25&+16\\ 81&+16\\ 121&+16\\ 49&+144\\ 225&+16\\ 169&+144\\ 1&+400\\ 9&+400\\ 289&+144\\ 49&+400\\ 441&+16 \end{aligned} \end{array}$$

First of all we observe that, of the two squares into which $p$ has been divided, one must be odd, which we set $=a a$, and the other must even, which we set $=b b$. Since $a a$ is of the form $8 n+1$, it is clear that the oddly even $b$  correspond to values of $p$  of the form $8 n+5$ , which are excluded by our induction, since they would have the number $2$  in class $B$  or $D$. For the values of $p$ which are of the form $8 n+1$, the value of $b$  must be evenly even, and if we have faith in the induction presented before our eyes, the number $2$  must be assigned to class $A$  for all moduli such that $b$  is of the form $8 n$ , and to class $C$  for all moduli such that $b$  is of the form $8 n+4$. But this theorem requires a far deeper investigation than that which we have brought forth in the preceding article, and the demonstration must be preceded by several preliminary investigations regarding the order in which the numbers of the sets $A$, $B$ , $C$ , $D$ follow each other.

15.
Let us denote the multitude of numbers from the complex $A$, that are immediately followed by numbers from the complexes $A$ , $B$ , $C$ , $D$ resp. , by $(00)$, $(01)$ , $(02)$ , $(03)$. Likewise, denote the multitude of numbers from complex $B$ that are followed by numbers from complex $A$, $B$ , $C$ , $D$  resp. by $(10)$, $(11)$ , $(12)$ , $(13)$ ; and likewise in the complex $C$ by $(20)$ , $(21)$ , $(22)$ , $(23)$ , and in complex $D$  by $(30)$ , $(31)$ , $(32)$ , $(33)$. We propose to determine these sixteen multitudes a priori. In order that the reader can compare the general reasoning with some examples, it was thought to add here the numerical values of the terms in a diagram ($S$ )

$$\begin{array}{llll} (00), & (01), & (02), & (03) \\ (10), & (11), & (12), & (13) \\ (20), & (21), & (22), & (23) \\ (30), & (31), & (32), & (33) \end{array}$$

for each modulus for which we have given the classifications in article 11.

$$\begin{array}{c|c|c|c} p=5 & p=13 & p=17 & p=29 \\ 0, 1, 0, 0 & 0, 1, 2, 0 & 0, 2, 1, 0 & 2, 3, 0, 2 \\ 0, 0, 0, 1 & 1, 1, 0, 1 & 2, 0, 1, 1 & 1, 1, 2, 3 \\ 0, 0, 0, 0 & 0, 1, 0, 1 & 1, 1, 1, 1 & 2, 1, 2, 1 \\ 0, 0, 1, 0 & 1, 0, 1, 1 & 0, 1, 1, 2 & 1, 2, 3, 1 \\ \hline p=37 & p=41 & p=53 & p=61 \\ 2, 1, 2, 4 & 0, 4, 3, 2 & 2, 3, 6, 2 & 4, 3, 2, 6 \\ 2, 2, 4, 1 & 4, 2, 2, 2 & 4, 4, 2, 3 & 3, 3, 6, 3 \\ 2, 2, 2, 2 & 3, 2, 3, 2 & 2, 4, 2, 4 & 4, 3, 4, 3 \\ 2, 4, 1, 2 & 2, 2, 2, 4 & 4, 2, 3, 4 & 3, 6, 3, 3 \\ \hline p=73 & p=89 & p=97  \\ 5, 6, 4, 2 & 3, 8, 6, 4 & 2, 6, 7, 8  \\ 6, 2, 5, 5 & 8, 4, 5, 5 & 6, 8, 5, 5   \\ 4, 5, 4, 5 & 6, 5, 6, 5 & 7, 5, 7, 5   \\ 2, 5, 5, 6 & 4, 5, 5, 8 & 8, 5, 5, 6   \\ \end{array}$$

Since moduli of the form $8n+1$ and $8n+5$  behave in different ways, each must be treated separately: we will begin with the former.

16.
The symbol $(00)$ indicates the multitude of different ways that the equation $\alpha+1=\alpha^{\prime}$  can be satisfied, where $\alpha$, $\alpha^{\prime}$  denote indefinite numbers in the complex $A$. Whereas for a modulus of the form $8n+1$, such as we understand here, $\alpha^{\prime}$ and $p-\alpha^{\prime}$  belong to the same complex, we will say more succinctly that $(00)$  expresses the multitude of different ways to satisfy the equation $1+\alpha+\alpha^{\prime}=p$. Clearly, this equation can be replaced by the congruence $1+\alpha+\alpha^{\prime} \equiv 0 \pmod{p}$.

Likewise,

$(01)$ indicates the multitude of solutions of the congruence $1+\alpha+\beta \equiv 0\pmod{p}$

$(02)$ indicates the multitude of solutions of the congruence $1+\alpha+\gamma \equiv 0$

$(03)$ indicates the multitude of solutions of the congruence $1+\alpha+\delta \equiv 0$

$(11)$ indicates the multitude of solutions of the congruence $1+\beta+\beta^{\prime} \equiv 0$  etc.

where $\beta$ and $\beta^{\prime}$  are indefinite numbers from the complex $B$, $\gamma$  is an indefinite number from the complex $C$ , and $\delta$  is an indefinite number from the complex $D$. Hence we immediately obtain the following six equations:

$$(01)=(10), \; (02)=(20), \; (03)=(30), \; (12)=(21), \;(13)=(31), \;(23)=(32)$$

From any given solution of the congruence $1+\alpha+\beta \equiv 0$, there arises a solution of the congruence $1+\delta+\delta^{\prime} \equiv 0$ , where $\delta$ a number within the limits $1 \ldots p-1$  such that $\beta \delta \equiv 1$  (which is clearly from the complex $D$ ), and $\delta^{\prime}$  is the minimal positive residue of the product $\alpha \delta$  (which will also be from the complex $D$ ). Likewise it is clear how to return from a given solution of the congruence $1+\delta+\delta^{\prime} \equiv 0$ to a solution of the congruence $1+\alpha+\beta \equiv 0$, if $\beta$  is taken in such a way that $\beta \delta \equiv 1$ , and we simultaneously let $\alpha \equiv \beta \delta^{\prime}$. Hence, we conclude that both congruences enjoy an equal multitude of solutions, that is, $(01) = (33)$.

In a similar manner, from the congruence $1+\alpha+\gamma \equiv 0$ we deduce $\gamma^{\prime}+\gamma^{\prime \prime}+1 \equiv 0$, if $\gamma^{\prime}$  is taken from the complex $C$  in such a way that $\gamma \gamma^{\prime} \equiv 1$ , and $\gamma^{\prime \prime}$  is congruent to the product $\alpha \gamma^{\prime}$  from the same complex. Hence, we easily infer that these two congruences admit an equal multitude of solutions, that is, $(02) = (22)$.

Similarly, from the congruence $1+\alpha+\delta \equiv 0$ we deduce $\beta+\beta^{\prime}+1 \equiv 0$, where $\beta$ , $\beta^{\prime}$  are chosen in such a way that $\beta \delta \equiv 1, \beta \alpha \equiv \beta^{\prime}$. Therefore, $(03) = (11)$.

Finally, from the congruence $1+\beta+\gamma \equiv 0$, we derive in a similar manner h the congruence $\delta+1+\beta^{\prime} \equiv 0$ , and hence also $\gamma^{\prime}+\delta^{\prime}+1 \equiv 0$ , and thus we conclude that $(12) = (13) = (23)$.

We have thus obtained, among our sixteen unknowns, eleven equations, such that they can be reduced to five, and the scheme $S$ can thus be exhibited as follows:

$$\begin{array}{llll} h, & i, & k, & l \\ i, & l, & m, & m \\ k, & m, & k, & m \\ l, & m, & m, & i \end{array}$$

Three new conditional equations can now be easily added. For since every number of the complex $A$, except the final $p-1$ , must be followed by a number from one of the complexes $A$ , $B$ , $C$ or $D$ , we will have

$$(00)+(01)+(02)+(03)=2n-1$$

and similarly

$$\begin{aligned} &(10)+(11)+(12)+(13)=2n \\ &(20)+(21)+(22)+(23)=2n \\ &(30)+(31)+(32)+(33)=2n. \end{aligned}$$

In terms of the variables we have just introduced, the first three equations supply:

$$\begin{aligned} h+i+k+l & =2n-1 \\ i+l+2m & =2n \\ k+m & =n \end{aligned}$$

and the fourth is identical to the second. With the aid of these equations it is possible to eliminate three of the unknowns, by which means the sixteen unknowns are now reduced to two.

17.
In order to obtain a complete determination, it will be necessary to investigate the number of solutions of the congruence

$$1+\alpha+\beta+\gamma \equiv 0\pmod{p}$$

where $\alpha$, $\beta$ , $\gamma$ denote indefinite numbers from the complex $A$ , $B$ , $C$. Clearly the value $\alpha=p-1$ is not admissible, since we cannot have $\beta+\gamma \equiv 0$. Therefore, substituting for $\alpha$ the remaining values produces $h$, $i$ , $k$ , $l$  values of $1+\alpha$  from $A$ , $B$ , $C$ , $D$  respectively. Similarly, for any given value of $1+\alpha$ from $A$, say for $1+\alpha=\alpha^{0}$ , the congruence $\alpha^{0}+\beta+\gamma \equiv 0$  will admit the same number of solutions as the congruence $1+\beta^{\prime}+\gamma^{\prime} \equiv 0$  (by setting $\beta \equiv \alpha^{0} \beta^{\prime}$ , $\gamma \equiv \alpha^{0} \gamma^{\prime}$ ), i. e. the number of solutions will be $(12)=m$. Likewise, for any given value of $1+\alpha$ from $B$, say $1+\alpha=\beta^{0}$ , the congruence $\beta^{0}+\beta+\gamma \equiv 0$  will have as many solutions as the congruence $1+\alpha^{\prime}+\beta^{\prime} \equiv 0$  (by setting $\beta \equiv \beta^{0} \alpha^{\prime}$ , $\gamma \equiv \beta^{0} \beta^{\prime}$ ), i. e. the number of solutions will be $(01)=i$. Similarly, for any given value of $1+\alpha$ from $C$, say $1+\alpha=\gamma^{0}$ , the congruence $\gamma^{0}+\beta+\gamma \equiv 0$  has the same number of solutions as the congruence $1+\delta+\alpha^{\prime} \equiv 0$  (by setting $\beta \equiv \gamma^{0} \delta$ , $\gamma \equiv \gamma^{0} \alpha^{\prime}$ ), i. e. the number of solutions will be $(03)=l$. Finally, for any given value of $1+\alpha$ from $D$, say for $1+\alpha=\delta^{0}$ , the congruence $\delta^{0}+\beta+\gamma \equiv 0$  will have as many solutions as the congruence $1+\gamma^{\prime}+\delta^{\prime} \equiv 0$  (by setting $\beta \equiv \delta^{0} \gamma^{\prime}$ , $\gamma \equiv \delta^{0} \delta^{\prime}$ ), i. e. there will be $(23)=m$ solutions. Putting all of this together, it is clear that the congruence $1+\alpha+\beta+\gamma \equiv 0$ will admit

$$h m+i i+k l+l m$$

distinct solutions.

In exactly the same way we can deduce that if each of the numbers from $B$ are substituted for $\beta$, then $1+\beta$  obtains resp. $(10)$, $(11)$ , $(12)$ , $(13)$ or $i$ , $l$ , $m$ , $m$  values from $A$ , $B$ , $C$ , $D$ , and for any given value of $1+\beta$  from the relevant complexes, the congruence $\alpha+\beta+\gamma \equiv 0$  admits $(02)$ , $(31)$ , $(20)$ , $(13)$  or $k$ , $m$ , $k$ , $m$  distinct solutions, so that the multitude of all solutions becomes

$$=i k+l m+k m+m m$$

We are led to the same value if we apply the same considerations to the values of $1+\gamma$.

18.
From this double expression of the same multitude we obtain the equation:

$$0=h m+i i+k l-i k-k m-m m$$

and hence, eliminating $h$ with the aid of the equation $h=2 m-k-1$ ,

$$0=(k-m)^{2}+i i+k l-i k-k k-m$$

But the last two equations of article 16 yield $k=\frac{1}{2}(l+i)$, and substituting this value for $k$ , $i i+k l-i k-k k$ becomes $\frac{1}{4}(l-i)^{2}$. Therefore the preceding equation, after multiplying by $4$, becomes

$$0=4(k-m)^{2}+(l-i)^{2}-4 m$$

Hence, because $4 m=2(k+m)-2(k-m)=2 n-2(k-m)$, it follows that

$$2 n=4(k-m)^{2}+2(k-m)+(l-i)^{2}$$

or

$$8 n+1=(4(k-m)+1)^{2}+4(l-i)^{2}$$

Therefore, setting

$$4(k-m)+1=a,\quad 2 l-2 i=b$$

we find that

$$p=a a+b b$$

However, it is clear that there is a unique way to decompose $p$ as a sum of two squares, if one of them must be odd and denoted by $a a$, and the other is required to be even and denoted by $b b$ , so that $a a$  and $b b$  are uniquely determined. Also, $a$ itself will be a completely determined number; for the square root must be taken as positive or negative, depending on whether the positive root is of the form $4 M+1$  or $4 M+3$. We will soon discuss the determination of the sign of $b$.

Now combining these new equations with the last three from article 16, the five numbers $h$, $i$ , $k$ , $l$ , $m$ are completely determined by $a$ , $b$ , and $n$  in the following way:

$$\begin{aligned} & 8 h=4 n-3 a-5 \\ & 8 i=4 n+a-2 b-1 \\ & 8 k=4 n+a-1 \\ & 8 l=4 n+a+2 b-1 \\ & 8 m=4 n-a+1 \end{aligned}$$

If these are expressed in terms of the modulus $p$ rather than $n$, then the diagram ${S}$ , with each term multiplied by $16$  to avoid fractions, is as follows:

$$\begin{array}{l|l|l|l} p-6 a-11 & p+2 a-4 b-3 & p+2 a-3 & p+2 a+4 b-3 \\ p+2 a-4 b-3 & p+2 a+4 b-3 & p-2 a+1 & p-2 a+1 \\ p+2 a-3 & p-2 a+1 & p+2 a-3 & p-2 a+1 \\ p+2 a+4 b-3 & p-2 a+1 & p-2 a+1 & p+2 a-4 b-3 \end{array}$$

19.
It remains for us to explain how to assign the correct sign to $b$. Already in article 10 above we have pointed out that the distinction between the sets $B$ and $D$  is not essential in itself, but rather depends on the choice of a number $f$, for which one of the roots of the congruence $x x \equiv-1$  must be taken, and they are interchanged with each other if one of the roots is adopted instead of the other. Now, since an inspection of the diagram just presented shows that changing the sign of $b$ results in a similar permutation, it may be foreseen that there must be a connection between the sign of $b$  and the number $f$. In order to understand this, we first of all observe that if $\mu$ is a non-negative integer, and $z$  runs through all the values $1$, $2$ , $3 \ldots p-1$ , then either $\Sigma z^{\mu} \equiv -1$  modulo $p$  (if $\mu$  is not divisible by $p-1$ ) or $\Sigma z^{\mu} \equiv 0$  (if $\mu$  is divisible by $p-1$ ). The latter part of the theorem is clear from the fact that if $\mu$ is divisible by $p-1$, then we have $z^{\mu} \equiv 1$. The former part can be demonstrated as follows. Letting $g$ be a primitive root, all the values of $z$  agree with the minimal residues of all $g^{y}$, where we take for $y$  all the numbers $0$ , $1$ , $2$ , $3 \ldots p-2$  as $y$. Therefore $\Sigma z^{\mu} \equiv \Sigma g^{\mu y}$. But

$$\Sigma g^{\mu y}=\frac{g^{\mu(p-1)-1}}{g^{\mu}-1}, \text{ hence } (g^{\mu}-1) \Sigma z^{\mu} \equiv g^{\mu(p-1)}-1 \equiv 0$$

Since $g^{\mu}$ cannot be congruent to $1$  for values of $\mu$  not divisible by $p-1$, i. e. $g^{\mu}-1$ cannot be divisible by $p$, it follows that $\Sigma z^{\mu} \equiv 0$. Q. E. D.

Now, if the power $(z^{4}+1)^{\frac{1}{4}(p-1)}$ is expanded using the binomial theorem, then by the preceding lemma, we will have

$$\Sigma(z^{4}+1)^{\frac{1}{4}(p-1)} \equiv-2\pmod{p}$$

But the minimal residues of all $z^{4}$ exhibit all the numbers A, with each occurring four times. Therefore, among the minimal residues of $z^{4}+1$ ,

$$\begin{aligned} & 4(00) \text{ belong to } A \\ & 4(01) \text{ belong to } B \\ & 4(02) \text{ belong to } C \\ & 4(03) \text{ belong to } D \end{aligned}$$

and four will be $=0$ (in the cases where $z^{4} \equiv p-1$ ). Hence, considering how the complexes $A$, $B$ , $C$ , $D$ were defined, we deduce

$$\Sigma(z^{4}+1)^{\frac{1}{4}(p-1)} \equiv 4(00)+4 f(01)-4(02)-4 f(03)$$

and therefore

$$-2 \equiv 4(00)+4 f(01)-4(02)-4 f(03)$$

or, substituting for for $(00)$, $(01)$ etc. the values found in the previous section,

$$-2 \equiv-2 a-2-2 b f$$

Hence we conclude that $a+b f \equiv 0$ must always be satisfied, or, multiplying by f,

$$b \equiv a f$$

This congruence serves to determine the sign of $b$, if the number $f$ has already been chosen, or to determine the number $f$ , if the sign of $b$  is prescribed elsewhere.

20.
Having completely solved our problem for moduli of the form $8n+1$, we proceed to the other case, in which $p$ is of the form $8n+5$ : we will be able to complete this more briefly because the reasoning differs little from the previous case.

Whereas for such a modulus, $-1$ belongs to the class $C$, the complements with respect to $p$  of the number in the complexes $A$ , $B$ , $C$ , $D$  will be in classes $C$ , $D$ , $A$ , $B$  respectively. Hence it is easily found that

$$ \begin{array}{c|c} \text{the symbol} & \text{denotes the multitude of} \\ & \text{solutions of the congruence} \\ \hline (00) & 1+\alpha+\gamma \equiv 0 \\ (01) & 1+\alpha+\delta \equiv 0 \\ (02) & 1+\alpha+\alpha^{\prime} \equiv 0 \\ (03) & 1+\alpha+\beta \equiv 0 \\ (10) & 1+\beta+\gamma \equiv 0 \\ (11) & 1+\beta+\delta \equiv 0 \\ (12) & 1+\beta+\alpha \equiv 0 \\ (13) & 1+\beta+\beta^{\prime} \equiv 0 \\ (20) & 1+\gamma+\gamma^{\prime} \equiv 0 \\ (21) & 1+\gamma+\delta \equiv 0 \\ (22) & 1+\gamma+\alpha \equiv 0 \\ (23) & 1+\gamma+\beta \equiv 0 \\ (30) & 1+\delta+\gamma \equiv 0 \\ (31) & 1+\delta+\delta^{\prime} \equiv 0 \\ (32) & 1+\delta+\alpha \equiv 0 \\ (33) & 1+\delta+\beta \equiv 0 \\ \end{array} $$

from which we immediately we have six equations:

$$(00)=(22), \quad (01)=(32), \quad (03)=(12), \quad (10)=(23), \quad (11)=(33), \quad (21)=(30)$$

Multiplying the congruence $1+\alpha+\gamma \equiv 0$ by the number $\gamma^{\prime}$  from the complex $C$  such that $\gamma \gamma^{\prime} \equiv 1$, and taking for $\gamma^{\prime \prime}$  the minimal residue of the product $\alpha \gamma^{\prime}$ , which will evidently also be from the complex $C$ , we obtain $\gamma^{\prime}+\gamma^{\prime \prime}+1 \equiv 0$ , from which we conclude that $(00)=(20)$.

Equations $(01)=(13)$, $(03)=(31)$ , $(10)=(11)=(21)$ can be obtained in a completely similar manner.

With the help of these eleven equations, we can reduce our sixteen unknowns to five, and present the diagram $S$ as follows:

$$\begin{array}{llll} h,& i,& k,& l \\ m,& m,& l,& i \\ h,& m,& h,& m \\ m,& l,& i,&  m \end{array}$$

Furthermore, we have the equations

$$\begin{aligned} & (00)+(01)+(02)+(03)=2 n+1 \\ & (10)+(11)+(12)+(13)=2 n+1 \\ & (20)+(21)+(22)+(23)=2 n \\ & (30)+(31)+(32)+(33)=2 n+1 \end{aligned}$$

or, using the symbols we have just introduced, these three (I):

$$\begin{aligned} h+i+k+l & =2 n+1 \\ 2 m+i+l & =2 n+1 \\ h+m & =n \end{aligned}$$

with the help of which we may now reduce our unknowns to two.

We will derive the remaining equations by considering the multitude of solutions of the congruence $1+\alpha+\beta+\gamma \equiv 0$ ,where $A$, $B$ , $C$ denote indefinite numbers from the complexes $A$ , $B$ , $C$  respectively. Namely, by considering firstly $1+\alpha$, we obtain $h$ , $i$ , $k$ , $l$ numbers from $A$ , $B$ , $C$ , $D$  respectively, and for any given value of $\alpha$  we have, in these four cases, $m$ , $l$ , $i$ , $m$  solution respectively. Thus the total number of solutions will be

$$=hm+il+ik+lm$$

Secondly, since $1+\beta$ yields $m$, $m$ , $l$ , $i$  numbers from the complexes $A$ , $B$ , $C$ , $D$ , and for any given value of $\beta$ , there are $h$ , $m$ , $h$ , $m$  solutions in these four cases, the total number of solutions will be

$$=h m+m m+h l+i m$$

from which we derive the equation

$$0=m m+h l+i m-i l-i k-l m$$

which, with the help of the equation $k=2m-h$ from (I), transforms into this:

$$0=m m+h l+h i-i l-i m-l m$$

Now, from the equations from (I), we also have $l+i=1+2h$, hence

$$\begin{aligned} & 2i=1+2h+(i-l) \\ & 2l=1+2h-(i-l) \end{aligned}$$

Substituting these values into the preceding equation, we get:

$$0=4 m m-4 m-1-8 h m+4 h h+(i-l)^{2}$$

Finally, if we substitute $2(h+m)-2(h-m)$ for $4m$, or, due to the last equation in (I), $2n-2(h-m)$ , we obtain:

$$0=4(h-m)^{2}-2 n+2(h-m)-1+(i-l)^{2}$$

and therefore

$$8 n+5=(4(h-m)+1)^{2}+4(i-l)^{2}$$

Setting

$$4(h-m)+1=a, \quad 2 i-2 l=b$$

this becomes

$$p=a a+b b$$

Since in this case too, $p$ can be decomposed into two squares in only one way, with one even and the other odd, $a a$  and $b b$  will be completely determined numbers; for it is evident that $a$  must be the square of an odd number, and $b$  of an even number. Moreover, the sign of $a$ must be chosen in such a way that $a \equiv 1\pmod{4}$, and the sign of $b$  must be chosen in such a way that $b \equiv af\pmod{p}$ , as can be proved easily using reasoning similar to that which we employed in the previous article.

The numbers $h$, $i$ , $k$ , $l$ , $m$ can then be determined from $a$ , $b$ , and $n$ :

$$\begin{aligned} &h = \frac{1}{8}(4n + a - 1) \\ &i = \frac{1}{8}(4n + a + 2b + 3) \\ &k = \frac{1}{8}(4n - 3a + 3) \\ &l = \frac{1}{8}(4n + a - 2b + 3) \\ &m = \frac{1}{8}(4n - a + 1) \end{aligned}$$

or if we prefer expressions in terms of $p$, the diagram $S$ , with each term multiplied by $16$ , will be as follows:

$$\begin{array}{l|l|l|l} p+2a-7 & p+2a+4b+1 & p-6a+1 & p+2a-4b+1 \\ p-2a-3 & p-2a-3 & p+2a-4b+1 & p+2a+4b+1 \\ p+2a-7 & p-2a-3 & p+2a-7 & p-2a-3 \\ p-2a-3 & p+2a-4b+1 & p+2a+4b+1 & p-2a-3 \end{array}$$

21
Having solved our problem, we return to the main discussion. We will now completely determine the complex to which the number 2 belongs.

I. Whenever $p$ is of the form $8n+1$, it is already established that the number 2 either belongs to the complex $A$  or to the complex $C$. In the former case, it is easily seen that the numbers $\frac{1}{2}(p-1)$ and $\frac{1}{2}(p+1)$  also belong to $A$, and in the latter case, they belong to $C$. Now consider that if $\alpha$ and $\alpha+1$  are consecutive numbers in the complex $A$, then $p-\alpha-1$  and $p-\alpha$  are also two such numbers, or, which is the same, numbers of the complex $A$  that are followed by a number from the same complex, always come in associated pairs, $(\alpha$  and $p-1-\alpha)$. Therefore, the multitude of such numbers, $(00)$, will always be even, unless a number exists which is associated with itself, i. e. unless $\frac{1}{2}(p-1)$ belongs to $A$, in which case $(00)$  will be odd. Hence we conclude that $(00)$ is odd whenever $2$  belongs to the complex $A$, and even whenever $2$  belongs to $C$. But we have

$$16(00)=a a+b b-6 a-11$$

or setting $a=4q+1$, $b=4r$ (see article 14),

$$(00)=q q-q+r r-1$$

Therefore, since $q q-q$ is clearly always even, $(00)$  will be odd or even, according as $r$  is even or odd. Therefore, $2$ will belong to $A$  or $C$  depending on whether $b$  is of the form $8m$  or $8m+4$, which is the very theorem that was found by induction in article 14.

II. We may also complete the other case, where $p$ is of the form $8n+5$. The number $2$ here belongs to either $B$  or $D$, and it is easily seen that in the former case $\frac{1}{2}(p-1)$  belongs to $B$  and $\frac{1}{2}(p+1)$  belongs to $D$ , and in the latter case $\frac{1}{2}(p-1)$  belongs to $D$  and $\frac{1}{2}(p+1)$  belongs to $B$. Now consider that if $\beta$ is a number in $B$  that is followed by a number in $D$, then the number $p-\beta-1$  will also be in $B$  and $p-\beta$  will be in $D$ , i. e. numbers with this property are always present in associated pairs. Their multitude, $(13)$, will therefore be even, except in the case when a number is associated with itself, i. e. when $\frac{1}{2}(p-1)$ belongs to $B$  and $\frac{1}{2}(p+1)$  to $D$ ; then of course $(13)$  will be odd. Hence we conclude that $(13)$ is even whenever $2$  belongs to $D$, and odd whenever $2$  belongs to $B$. But we have

$$16(13)=a a+b b+2 a+4 b+1$$

or, setting $a=4q+1$, $b=4r+2$ ,

$$(13)=q q+q+r r+2 r+1$$

Therefore, $(13)$ will be odd whenever $r$  is even; and on the other hand, $(13)$  will be even whenever $r$  is odd. From this we conclude that $2$ belongs to $B$  whenever $b$  is of the form $8m+2$, and to $D$  whenever $b$  is of the form $8m+6$.

The conclusion of these investigations can be stated as follows:

The number 2 belongs to the set $A$, $B$ , $C$ , or $D$ , according to whether the number $\frac{1}{2} b$ is of the form $4m$ , $4m+1$ , $4m+2$ , or $4m+3$.

22.
In Disquisitiones Arithmeticae we explained the general theory of the division of the circle, and the solution of the equation $x^{p}-1=0$, and among other things, we showed that if $\mu$ is a divisor of the number $p-1$ , then the function $\frac{x^{p}-1}{x-1}$  can be resolved into $\mu$  factors of order $\frac{p-1}{\mu}$ , with the help of an auxiliary equation of order $\mu$. In addition to the general theory of this resolution, we separately considered special cases where $\mu=2$ or $\mu=3$  in articles 356-358 of that work, and we showed how to assign the auxiliary equation a priori, i. e. without finding the minimal residue of a primitive root modulo $p$. Now, even without a reminder, attentive readers will easily perceive a close connection between the next simplest case of this theory, namely $\mu=4$, with the investigations explained here in articles 15-20. Indeed, with the help of the former, the latter can also be completed without much difficulty. But we reserve this treatment for another occasion, and therefore in the present commentary, we preferred to complete the discussion using purely arithmetic methods, without mixing in the theory of the equation $x^{p}-1=0$. Rather, in the conclusion of this work, we will add some new and purely arithmetic theorems, closely connected the subject which has been treated so far.

23.
If the power $(x^{4}+1)^{\frac{1}{2}(p-1)}$ is expanded using the binomial theorem, there will be three terms in which the exponent of $x$  is divisible by $p-1$, namely

$$x^{2(p-1)}, P x^{p-1} \text{ and } 1$$

where $P$ denotes the middle coefficient

$$\frac{\frac{1}{2}(p-1) \cdot \frac{1}{2}(p-3) \cdot \frac{1}{2}(p-5) \ldots \frac{1}{2}(p+3)}{1 \cdot 2 \cdot 3 \ldots \frac{1}{4}(p-1)}$$

Therefore, substituting the numbers $1$, $2$ , $3 \ldots p-1$ in turn for $x$ , we obtain by the lemma of article 19,

$$\Sigma(x^{4}+1)^{\frac{1}{2}(p-1)} \equiv-2-P$$

But considering what we explained in article 19, namely that the numbers of the complexes $A$, $B$ , $C$ , $D$ , when raised to the $\frac{1}{2}(p-1)^{th}$ power, are congruent modulo $p$  to the numbers $+1$ , $-1$ , $+1$ , $-1$  respectively, it is easy to see that

$$\Sigma(x^{4}+1)^{\frac{1}{2}(p-1)} \equiv 4(00)-4(01)+4(02)-4(03)$$

and therefore, according to the diagrams given at the ends of articles 18 and 20, we have

$$\Sigma(x^{4}+1)^{\frac{1}{2}(p-1)} \equiv-2 a-2$$

Comparing these two values yields a most elegant theorem: namely, we have

$$P \equiv 2 a\pmod{p}$$

Denoting the four products

$$\begin{aligned} & 1 \cdot 2 \cdot 3 \ldots \frac{1}{4}(p-1) \\ & \frac{1}{4}(p+3) \cdot \frac{1}{4}(p+7) \cdot \frac{1}{4}(p+11) \ldots \frac{1}{2}(p-1) \\ & \frac{1}{2}(p+1) \cdot \frac{1}{2}(p+3) \cdot \frac{1}{2}(p+5) \ldots \frac{3}{4}(p-1) \\ & \frac{1}{4}(3p+1) \cdot \frac{1}{4}(3p+5) \cdot \frac{1}{4}(3p+9) \ldots (p-1) \end{aligned}$$

by $q$, $r$ , $s$ , $t$ respectively, the preceding theorem can be presented as follows:

$$2a \equiv \frac{r}{q}\pmod{p}$$

Since each factor of $q$ has its complement with respect to $p$  in $t$, we have $q \equiv t\pmod{p}$  whenever the multiplicity of factors is even, i. e. whenever $p$ is of the form $8n+1$. On the other hand, $q \equiv -t\pmod{p}$ whenever the multiplicity of factors is odd, or $p$  is of the form $8n+5$. Similarly, in the former case we will have $r \equiv s$, and in the latter case $r \equiv -s$. In both cases we will have, $qr \equiv st$, and because it is clear that $qrst \equiv -1$ , we will also have $qqrr \equiv -1$ , and consequently $qr \equiv \pm f\pmod{p}$. Combining this congruence with the theorem just found, we obtain $rr \equiv \pm 2af$, and therefore, by articles 19 and 20,

$2b \equiv \pm rr\pmod{p}$

It is very remarkable that the decomposition of the number $p$ into two squares can be found by completely direct operations; namely, the square root of the odd square will be the absolutely minimal residue of $\frac{r}{2q}$  modulo $p$, and the square root of the even square will be the absolutely minimal residue of $\frac{1}{2}rr$  modulo $p$. The expression $\frac{r}{2q}$, which becomes $=1$ for $p=5$ , ican be presented for larger values of $p$  as follows:

$$\frac{6\cdot 10\cdot 14\cdot 18 \ldots (p-3)}{2\cdot 3\cdot 4\cdot 5 \ldots \frac{1}{4}(p-1)}$$

But since we furthermore know by which sign this formula for the square root of an odd number is affected, namely, so that it always takes the form $4m+1$, it is highly noteworthy that a similar general criterion with respect to the sign of the square root of the even number has not yet been found. If anyone finds it and communicates it to us, they will do us a great favor. Meanwhile, it seems appropriate to include here the values of the numbers $a$, $b$ , $f$ , which produce the minimal residues of the expressions $\frac{r}{2q}$ , $\frac{1}{2}rr$ , $qr$ , for all values of $p$ less than 200.

$$\begin{array}{r|r|r|r} p & a & b & f \\ \hline 5 & +1 & +2 & 2 \\ 13 & +3 & -2 & 5 \\ 17 & +1& -4 & 13 \\ 29 & +5 & +2 & 12 \\ 37 & +1 & -6 & 31 \\ 41 & +5 & +4 & 9 \\ 53 & -7 & -2 & 23 \\ 61 & +5 & -6 & 11 \\ 73 & -3 & -8 & 27 \\ 89 & +5 & -8 & 34 \\ 97 & +9 & +4 & 22 \\ 101 & +1 & -10 & 91 \\ 109 & -3 & +10 & 33 \\ 113 & -7 & +8 & 15 \\ 137 & -11 & +4 & 37 \\ 149 & -7 & -10 & 44 \\ 157 & -11 & -6 & 129 \\ 173 & +13 & +2 & 80 \\ 181 & +9 & +10 & 162 \\ 193 & -7 & +12 & 81 \\ 197 & +1 & -14 & 183 \end{array}$$

24.
In the first commentary, that which is required for the biquadratic character of the number $+2$ was completely determined. Specifically, if we conceive of all numbers that are not divisible by the modulus $p$ (which is assumed to be a prime number of the form $4n+1$ ) as being distributed amongst four complexes $A$, $B$ , $C$ , $D$  according to whether they become congruent to $+1$ , $+f$ , $-1$ , $-f$  modulo $p$  when raised to the $\frac{1}{4}(p-1)^{th}$  power, where $f$  denotes one of the roots of the congruence $f f \equiv -1 \pmod{p}$ , then we find that the complex to which the number $+2$  should be assigned depends on the resolution of the number $p$  into two squares. Namely, if $p=a a+b b$, with $a a$ being an odd square, and $b b$  being an even square, and assuming that the signs of $a$ , $b$  are taken in such a way that we have $a \equiv 1\pmod{4}$ , $b \equiv af\pmod{p}$ , then the number $+2$  will belong to the complex $A$ , $B$ , $C$ , $D$  according to whether $\frac{1}{2}b$  is of the form $4n$ , $4n+1$ , $4n+2$ , $4n+3$  resp.

The rule governing the classification of the number $-2$ also naturally arises in this way. Specifically, since $-1$ belongs to the class $A$  for even values of $\frac{1}{2} b$, and to class $C$  for odd values, it follows from the theorem of article 7 that the number $-2$  will belong to the complex $A$ , $B$ , $C$ , $D$  according to whether $\frac{1}{2} b$  is of the form $4 n$ , $4 n+3$ , $4 n+2$ , $4 n+1$  resp.

The above theorems can also be expressed as follows:

$$\begin{array}{c|c|c}\text{The number} & +2 & -2 \\ \hline \text{belongs to the complex} & \text{if }b\text{ is congruent,} &\text{ modulo }8\text{, to} \\ \hline A & 0 & 0 \\ B & 2 a & 6 a \\ C & 4 a & 4 a \\ D & 6 a & 2 a \\ \end{array}$$

It is easily understood that the theorems thus stated no longer depend on the condition $a \equiv 1\pmod{4}$, but still hold if $a \equiv 3\pmod{4}$ , provided that the other condition, $a f \equiv b\pmod{p}$ , is preserved.

It can be easily seen that all of these theorems can be elegantly condensed into a single formula, namely:

if $a$ and $b$  are assumed to be positive, then we always have

$$b^{\frac{1}{2} a b} \equiv a^{\frac{1}{2} a b} 2^{\frac{1}{4}(p-1)}\pmod{p}$$

25.
Let us now see to what extent induction reveals the classification of the number 3. The table in article 11, continued further (and always adopting the minimum primitive root), shows that $+3$ belongs to the complex

$$\begin{array}{c||c||c||c} A \text{, for} & B \text{, for} & C \text{, for} &D \text{, for} \\ \begin{array}{r|r|r} p & a & b \\ 13 & -3 & +2 \\ 109 & -3 & +10 \\ 181 & +9 & +10 \\ 193 & -7 & -12 \\ 229 & -15 & +2 \\ 277 & +9 & +14 \\&&\\ &&\\&& \\&& \\&& \\&& \\&& \\ \end{array} & \begin{array}{r|r|r} p & a & b \\ 17&+1&-4\\ 29&+5&+2\\ 53&-7&+2\\ 89&+5&-8\\ 101&+1&+10\\ 113&-7&-8\\ 137&-11&-4\\ 197&+1&-14\\ 233&+13&+8\\ 257&+1&-16\\ 269&+13&+10\\ 281&+5&+16\\ 293&+17&+2 \end{array}&\begin{array}{r|r|r} p & a & b \\ 37&+1&-6\\ 61&+5&-6\\ 73&-3&-8\\ 97&+9&+4\\ 157&-11&-6\\ 241&-15&-4 \\ &&\\ &&\\ &&\\ &&\\ &&\\ &&\\ &&\\ \end{array}&\begin{array}{r|r|r} p & a & b \\ 5&+1&+2\\ 41&+5&-4\\ 149&-7&+10\\ 173&+13&+2\\ &&\\ &&\\ &&\\&& \\&& \\&& \\&& \\&& \\&& \\ \end{array} \end{array}$$

At first glance, we do not observe a simple connection between the values of the numbers $a$, $b$ that correspond to the same complex. However, if we consider that a similar question in the theory of quadratic residues can be resolved by a simpler rule for the number $-3$ than for the number $+3$, there is hope for an equally successful outcome in the theory of biquadratic residues. Indeed, we find that $-3$ belongs to the complex

$$\begin{array}{c||c||c||c} A \text{, for} & B \text{, for} & C \text{, for} &D \text{, for} \\ \begin{array}{r|r|r} p & a & b \\ 37&+1&-6\\ 61&+5&-6\\ 157&-11&-6\\ 193 & -7 & -12 \\ && \\ && \\ && \\ && \\&& \\&& \\ \end{array} & \begin{array}{r|r|r} p & a & b \\ 5&+1&+2\\ 17&+1&-4\\ 89&+5&-8\\ 113&-7&-8\\ 137&-11&-4\\ 149&-7&+10\\ 173&+13&+2\\ 233&+13&+8\\ 257&+1&-16\\ 281&+5&+16\\ \end{array}& \begin{array}{r|r|r} p & a & b \\ 13 & -3 & +2 \\ 73&-3&-8\\ 97&+9&+4\\ 109 & -3 & +10 \\ 181 & +9 & +10 \\ 229 & -15 & +2 \\ 241&-15&-4 \\ 277 & +9 & +14 \\ && \\&& \\ \end{array} & \begin{array}{r|r|r} p & a & b \\ 29&+5&+2\\ 41&+5&-4\\ 53&-7&+2\\ 101&+1&+10\\ 197&+1&-14\\ 269&+13&+10\\ 293&+17&+2 \\&& \\&& \\&& \\ \end{array} \end{array} $$

from which the inductive rule presents itself spontaneously. Namely, $-3$ belongs to the complex

$A$, whenever $b$ is divisible by 3, or $b \equiv 0\pmod{3}$

$B$, whenever $a+b$ is divisible by 3, or $b \equiv 2 a\pmod{3}$

$C$, whenever $a$ is divisible by 3, or $a \equiv 0\pmod{3}$

$D$, whenever $a-b$ is divisible by 3, or $b \equiv a\pmod{3}$

26.
We find that the number $+5$ belongs to the complex

$A$, for $p=101$ , $109$ , $149$ , $181$ , $269$

$B$, for $p=13$ , $17$ , $73$ , $97$ , $157$ , $193$ , $197$ , $233$ , $277$ , $293$

$C$, for $p=29$ , $41$ , $61$ , $89$ , $229$ , $241$ , $281$

$D$, for $p=37$ , $53$ , $113$ , $137$ , $173$ , $257$

Upon consideration of the values of the numbers $a, b$ corresponding to each $p$, the law here is just as easily grasped as it is for the classification of the number $-3$. Specifically, $+5$ belongs to the complex

$$\begin{array}{l} A, \text{ whenever } b \equiv 0\pmod{5} \\ B, \text{ whenever } b \equiv a \\ C, \text{ whenever } a \equiv 0 \\ D, \text{ whenever } b \equiv 4 a \end{array}$$

It is clear that these rules encompass all cases, since for $b \equiv 2 a$ or $b \equiv 3 a\pmod{5}$, we would have $a a+b b \equiv 0$ , Q.E.A., since by hypothesis $p$  is a prime number different from 5.

27.
Applying induction in the same way to the numbers $-7$, $-11$ , $+13$ , $+17$ , $-19$ , $-23$ yields the following rules:

For the number $-7$. $$ \begin{array}{l|l} A & a \equiv 0, \text{ vel } b \equiv 0\pmod{7} \\ B & b \equiv 4 a, \text{ vel } b \equiv 5 a \\ C & b \equiv a, \text{ vel } b \equiv 6 a \\ D & b \equiv 2 a, \text{ vel } b \equiv 3 a \end{array} $$ For the number $-11$. $$ \begin{array}{l|l} A & b \equiv 0, 5 a, \text{ vel } 6 a\pmod{11} \\ B & b \equiv a, 3 a \text{ vel } 4 a \\ C & a \equiv 0, \text{ vel } b \equiv 2 a \text{ vel } 9 a \\ D & b \equiv 7 a, 8 a \text{ vel } 10 a \end{array} $$ For the number $+13$. $$ \begin{array}{l|l} A & b \equiv 0, 4a, 9 a\pmod{13} \\ B & b \equiv 6 a, 11 a, 12 a \\ C & a \equiv 0; b \equiv 3 a, 10 a \\ D & b \equiv a, 2 a, 7 a \end{array} $$ For the number $+17$. $$ \begin{array}{l|l} A & a \equiv 0; b \equiv 0, a, 16 a\pmod{17}\\ B & b \equiv 2 a, 6 a, 8 a, 14 a\\ C & b \equiv 5 a, 7 a, 10 a, 12 a\\ D & b \equiv 3 a, 9 a, 11 a, 15 a \end{array} $$ For the number $-19$. $$ \begin{array}{l|l} A & b \equiv 0, 2 a, 5 a, 14 a, 17 a\pmod{19} \\ B & b \equiv 3 a, 7 a, 11 a, 13 a, 18 a \\ C & a \equiv 0; b \equiv 4 a, 9 a, 10 a, 15 a \\ D & b \equiv a, 6 a, 8 a, 12 a, 16 a\\ \end{array} $$ For the number $-23$. $$ \begin{array}{l|l} A & a \equiv 0; b \equiv 0, 7 a, 10 a, 13 a, 16 a\pmod{23} \\ B & b \equiv 2 a, 3 a, 4 a, 11 a, 15 a, 17 a \\ C & b \equiv a, 5 a, 9 a, 14 a, 18 a, 22 a \\ D & b \equiv 6 a, 8 a, 12 a, 19 a, 20 a, 21 a \end{array} $$

28.
The special theorems found in this way are found confirmed, as long one continues, and they reveal criteria of the most beautiful form. If they are compared with each other, so that general conclusions may be derived from them, the following observations immediately present themselves at first sight.

The criteria for deciding to which complex number a given prime number $\pm q$ should be referred (where the sign is taken positively or negatively, depending on whether $q$  is of the form $4n+1$  or $4n+3$ ), depend on the forms of the numbers $a$, $b$  modulo $q$. Specifically,

I. When $a \equiv 0\pmod{q}$, $\pm q$ belongs to a specific complex, which is $A$  for $q=7$ , $17$ , $23$ , and $C$  for $q=3$ , $11$ , $13$ , $19$. From this arises the conjecture that the former case generally holds whenever $q$ is of the form $8n\pm1$, and the latter holds whenever $q$  is of the form $8n\pm3$. Moreover, the complexes $B$ and $D$  can already be excluded without induction when $a$  is divisible by $q$, as we then have $p \equiv b b\pmod{q}$ , i.e. $p$  is a quadratic residue modulo $q$ , and hence by the fundamental theorem, $\pm q$  must be a quadratic residue modulo $p$.

II. When $a$ is not divisible by $q$, the criterion depends on the value of the expression $\frac{b}{a}\pmod{q}$. This expression indeed admits different values of $q$, namely $0$ , $1$ , $2$ , $3\ldots q-1$ , but whenever $q$ is of the form $4n+1$ , we must exclude the two values of the expression $\sqrt{-1}\pmod{q}$ , which obviously cannot be values of the expression $\frac{b}{a}\pmod{q}$ , since $p=a a+b b$  is always assumed to be a prime number different from $q$. Therefore, the number of admissible values of the expression $\frac{b}{a}\pmod{q}$ is $=q-2$  for $q \equiv 1\pmod{4}$, while it remains $=q$  for $q \equiv 3\pmod{4}$.

We can now distribute these values into four classes, so that some, denoted indefinitely by $\alpha$, correspond to the complex $A$ ; others, denoted by $\beta$ , correspond to the complex $B$ ; others $\gamma$ correspond to the complex $C$ ; and finally the remaining $\delta$  correspond to the complex $D$. We do this in such a way that $\pm q$ belongs to the complex $A$, $B$ , $C$ , or $D$  depending on whether $b \equiv \alpha a$ , $b \equiv \beta a$ , $b \equiv \gamma a$ , or $c \equiv \delta a\pmod{q}$.

The law of this distribution seems more abstruse than it actually is, although some general observations can be made promptly. Three of the classes have the same multitude, namely $\frac{1}{4}(q-1)$ or $\frac{1}{4}(q+1)$, while for the fourth (the one corresponding to the criterion $a \equiv 0$ ), the number is one less, so that the number of different criteria corresponding to each complex is the same, namely $\frac{1}{4}(q-1)$  or $\frac{1}{4}(q+1)$. Furthermore, we note that $0$ is always found in the first class (among $\alpha$ ), and that the complements of the numbers $\alpha$, $\beta$ , $\gamma$ , $\delta$  to $q$ , i. e. $q-\alpha$, $q-\beta$ , $q-\gamma$ , $q-\delta$ correspond to the first, fourth, third, second class, respectively. Finally, we see that the values of the expressions $\frac{1}{a}$, $\frac{1}{\beta}$ , $\frac{1}{\gamma}$ , $\frac{1}{\delta} \pmod{q}$ belong to the first, fourth, third, second class, whenever the criterion $a \equiv 0$  corresponds to the complex $A$ ; and to the third, second, first, fourth class, whenever the criterion $a \equiv 0$  is referred to the complex $C$. But these are almost all the observations that can be reached by induction, unless we presumptuously dare to anticipate those which will be derived below from genuine sources.

29.
Before we proceed further, it is worth noting that the criteria for prime numbers (taken positively if they are of the form $4n+1$, and negatively if they are of the form $4n+3$ ) suffice for the determination of all other numbers, provided that the theorem of article 7 and the criteria for $-1$ and $\pm 2$  are called upon to assist. Thus, for example, if criteria for the number $+3$ is desired, then the criteria stated in article 25, which refer to $-3$, will still apply for $+3$  whenever $\frac{1}{2}b$  is an even number; on the other hand, the complexes $A$ , $B$ , $C$ , $D$  should be interchanged with the complexes $C$ , $D$ , $A$ , $B$  whenever $\frac{1}{2}b$  is odd. From this, the following criteria can be obtained:

$+3$ belongs $$ \begin{array}{c|l} \text{to the complex}&\text{if}\\ A & b \equiv 0\pmod{12}; \text{ or simultaneously } a \equiv 0\pmod{3}, b \equiv 2\pmod{4} \\ B & b \equiv 8 a \text{ vel } 10 a\pmod{12} \\ C & b \equiv 6 a\pmod{12}; \text{ or simultaneously } a \equiv 0\pmod{3}, b \equiv 0\pmod{4} \\ D & b \equiv 2 a \text{ vel } 4 a\pmod{12} \end{array} $$

Similarly, the criteria for $\pm 6$ can be found by combining the criteria for $\mp 2$  and $-3$ ; specifically,

$+6$ belongs $$\begin{array}{c|l} \text{to the complex}&\text{if}\\ A & b \equiv 0, \phantom{00a}2a, 22a \pmod{24}; \text{ or simultaneously } a \equiv 0 \pmod{3}, b \equiv 4a \pmod{8} \\ B & b \equiv 4a, \phantom{00}6a, \phantom{0}8a \pmod{24}; \text{ or simultaneously } a \equiv 0 \pmod{3}, b \equiv 2a \pmod{8} \\ C & b \equiv 10a, 12a, 14a \pmod{24}; \text{ or simultaneously } a \equiv 0 \pmod{3}, b \equiv 0\phantom{a} \pmod{8} \\ D & b \equiv 16a, 18a, 20a \pmod{24}; \text{ or simultaneously } a \equiv 0 \pmod{3}, b \equiv 6a \pmod{8} \end{array}$$

$-6$ belongs $$\begin{array}{c|l} \text{to the complex}&\text{if}\\ A & b \equiv 0,\phantom{a} 10a, 14a \pmod{24}; \text{ or simultaneously } a \equiv 0 \pmod{3}, b \equiv 4a \pmod{8} \\ B & b \equiv 4a, \phantom{0}8a, 18a \pmod{24}; \text{ or simultaneously } a \equiv 0 \pmod{3}, b \equiv 6a \pmod{8} \\ C & b \equiv 2a, 12a, 22a \pmod{24}; \text{ or simultaneously } a \equiv 0 \pmod{3}, b \equiv 0\phantom{a} \pmod{8} \\ D & b \equiv 6a, 16a, 20a \pmod{24}; \text{ or simultaneously } a \equiv 0 \pmod{3}, b \equiv 2a \pmod{8} \end{array}$$

In a similar way, the criteria for the number $+21$ can be put together from the criteria for $-3$  and $-7$ ; the criteria for $-105$  from the criteria for $-1$, $-3$ , $+5$ , $-7$ , etc.

30.
Induction therefore opens up a very abundant harvest of special theorems, similar for the theorem for the number $2$. However, a common link and rigorous demonstrations are desired, since the method by which we classified the number $2$ in the first commentary does not allow further application. Now, there are various methods by which it would be possible to obtain demonstrations for particular cases, especially those which concern the distribution of quadratic residues among the complex $A$, $C$. However, we do not linger with these, since the theory should encompass all cases in general. When we started dedicating our thoughts to this matter in 1805, we soon became aware that the genuine source of the general theory was to be sought in the field of arithmetic, as we already mentioned in article 1.

Whereas higher arithmetic, in the questions hitherto treated, concerns only real integral numbers, so the theorems about biquadratic residues shine forth in the highest simplicity and genuine beauty only when the field of arithmetic is extended to imaginary quantities, so that, without restriction, the object of study consists of numbers of the form $a+b i$, where $i$ denotes the usual imaginary quantity $\sqrt{-1}$ , and $a$ , $b$  indefinitely denote all real integral numbers between $-\infty$  and $+\infty$. We shall call such numbers complex integral numbers, so that they are not opposed to real complex numbers, but are rather considered to be contained among these as a species. The present essay will present both the elementary doctrine of complex numbers and the initial elements of the theory of biquadratic residues, which we will undertake to render perfect in every respect in the subsequent continuation.

31.
In the interest of brevity and clarity, we first introduce some notation.

The field of complex numbers $a+bi$ contains

I. real numbers, where $b=0$, and, among these, depending on the nature of $a$ ,

1) zero

2) positive numbers

3) negative numbers

II. imaginary numbers, where $b$ is a non-zero number. Here again we distinguish

1) purely imaginary numbers, i . e . those for which $a=0$

2) imaginary numbers with a real part, for which neither $b$ nor $a$  equals 0.

If you like, the former can be called pure imaginary numbers, the latter can be called mixed imaginary numbers.

We use four units in this theory, $+1$, $-1$ , $+i$ , $-i$ , which are positive, negative, positive imaginary, and negative imaginary.

We will call the products of any complex number by $-1$, $+i$ , $-i$ its associates or numbers associated with it. Except for the number zero (which is its own associate), there are always four unequal associates of any number.

On the other hand, we call a complex number conjugate if it arises from a permutation of $i$ with $-i$. Therefore, among imaginary numbers, any two unequal numbers are always conjugate, while real numbers are conjugate to themselves, if it is pleasing to extend the denomination to them.

The product of a complex number with its conjugate is called the norm of that number. So, the norm of a real number is the same as its square.

In general, we have eight related numbers,

$$\begin{array}{r|r} a+bi & a-bi \\ -b+ai & -b-ai \\ -a-bi & -a+bi \\ b-ai & b+ai \end{array}$$

in which we see two quartets of associated numbers, four pairs of conjugates, and the common norm of all is $a a+b b$. However, these eight numbers are reduced to four unequal numbers when $a= \pm b$, or when one of the numbers $a$ , $b=0$.

The following are immediate consequences of the given definitions:

The conjugate of a product of two complex numbers is the product of the conjugates of those numbers.

The same holds for products with several factors, as well as for quotients.

The norm of a product of two complex numbers is equal to the product of their norms.

This theorem also extends to products with any number of factors and to quotients.

The norm of any complex number (except for zero, which is usually tacitly understood from now on) is a positive number.

There is nothing preventing our definitions from extending to fractional or even irrational values of $a$, $b$ ; but $a+bi$ is only called an integer complex number when both $a$ , $b$  are integers, and it is only rational when both $a$ , $b$  are rational.

32.
The algorithms for arithmetic operations on complex numbers are commonly known: division, through the introduction of the norm, is reduced to multiplication, since we have

$$\frac{a+b i}{c+d i}=(a+b i) \cdot \frac{c-d i}{c c+d d}=\frac{a c+b d}{c c+d d}+\frac{b c-a d}{c c+d d} \cdot i$$

Extraction of square roots is accomplished with the help of the formula

$$\surd(a+b i)= \pm(\surd \frac{\surd(a a+b b)+a}{2}+i \surd \frac{\surd(a a+b b)-a}{2})$$

if $b$ is a positive number, or with this

$$\surd(a+b i)= \pm(\surd \frac{\surd(a a+b b)+a}{2}-i \surd \frac{\surd(a a+b b)-a}{2})$$

if $b$ is a negative number. It is not necessary to dwell here on the use of the transformation of the complex quantity $a+b i$ into $r(\cos \varphi+i \sin \varphi)$  for the purpose of facilitating calculations.

33.
We call a complex integer which can be resolved into two factors which are not units, a composite complex number; conversely, a complex number is said to be prime if it admits no such resolution. From this it immediately follows that any composite real number also is a composite complex number. But a prime real number could be a composite complex number, and indeed this holds for the number $2$ and for all positive real prime numbers of the form $4n+1$  (except for the number $1$ ), since it is known that they can be decomposed into two positive squares; namely, $2=(1+i)(1-i)$, $5=(1+2i)(1-2i)$ , $13=(3+2i)(3-2i)$ , $17=(1+4i)(1-4i)$ , etc.

On the other hand, positive real prime numbers of the form $4n+3$ are always prime complex numbers. For if such a number $q$ were $=(a+bi)(\alpha+\beta i)$, it would also be $=(a-bi)(\alpha-\beta i)$ , and therefore $qq=(a a+b b)(\alpha \alpha+\beta \beta)$. But $qq$ can only be resolved into positive factors greater than unity in a single way, namely as $q\times q$, from which it would follow that $q=a a+b b=\alpha \alpha+\beta \beta$ , Q.E.D.; since a sum of two squares cannot be of the form $4n+3$.

Real negative numbers are classified as prime or composite in the same way as positive numbers, and the same holds for pure imaginary numbers.

Thus it remains for us to explain how to distinguish between prime and composite mixed imaginary numbers, as can be done by the following

A mixed imaginary integer $a+b i$ is either a complex prime number or a composite number, depending on whether its norm is a prime or a composite real number.

Proof. I. Since the norm of composite complex numbers is always a composite number, it is clear that a complex number whose norm is a prime real number must necessarily be a complex prime number. Q. E. P.

II. If the norm $a a+b b$ is a composite number, let $p$  be a positive real prime number that divides it. There are now two distinct cases to consider.

1) If $p$ is of the form $4 n+3$, it is clear that $a a+b b$  cannot be divisible by $p$  unless $p$  also divides $a$  and $b$ , so $a+b i$  will be a composite number.

2) If $p$ is not of the form $4 n+3$, it can definitely be decomposed into two squares: so let us assume that $p=\alpha \alpha+\beta \beta$ . Since we have

$$(a \alpha+b \beta)(a \alpha-b \beta)=a a(\alpha \alpha+\beta \beta)-\beta \beta(a a+b b)$$

it is divisible by $p$, and thus it must divide either the factor $a \alpha+b \beta$ or the factor $a \alpha-b \beta$. In addition, since

$$(a \alpha+b \beta)^{2}+(b \alpha-a \beta)^{2}=(a \alpha-b \beta)^{2}+(b \alpha+a \beta)^{2}=(a a+b b)(\alpha \alpha+\beta \beta)$$

and so is divisible by $p p$, it is clear that in the first case $b \alpha-a \beta$ must also be divisible by $p$ , while in the latter case $b \alpha+a \beta$  must also be divisible by $p$. Therefore, in the first case

$$\frac{a+b i}{\alpha+\beta i}=\frac{a \alpha+b \beta}{p}+\frac{b \alpha-a \beta}{p} \cdot i$$

will be a complex integer, and in the latter case

$$\frac{a+b i}{\alpha-\beta i}=\frac{a \alpha-b \beta}{p}+\frac{b \alpha+a \beta}{p} \cdot i$$

will be an integer. Therefore, since the given number is divisible either by $\alpha+\beta i$ or by $\alpha-\beta i$, and since the norm of the quotient $=\frac{a a+b b}{p}$  is different from unity by the hypothesis, it is clear that $a+b i$  is a composite complex number in both cases. Q. E. S.

34.
Therefore, the entire set of prime numbers can be exhausted by the following four species:

1) the four units, $1$, $+i$ , $-1$ , $-i$ , which, however, we will usually understand to be excluded when discussing prime numbers.

2) the number $1+i$ with its three associates $-1+i$, $-1-i$ , $1-i$.

3) positive real prime numbers of the form $4n+3$ along with their three associates.

4) complex numbers, the norms of which are real prime numbers of the form $4n+1$ greater than unity, and indeed for any given norm there will always be exactly eight such prime complex numbers, since a norm of this kind can be decomposed into only two squares in a unique way.

35.
Just as the integers are distributed into evens and odds, and the evens are further divided into evenly even and oddly even, so too does an equally essential distinction present itself among complex numbers: namely,

either they are not divisible by $1+i$, which is the case for numbers $a+bi$ such that one of $a$ , $b$  is odd and the other is even;

or they are divisible by $1+i$ but not by $2$, whenever both $a$ , $b$  are odd;

or they are divisible by $2$, whenever both $a$ , $b$ are even.

For convenience, the numbers of the first class can be called odd complex numbers, those of the second semi-even, and those of the third even.

The product of multiple complex factors will always be odd, provided all factors are odd; semi-even, whenever one factor is semi-even and the rest are odd; and even, whenever among the factors, either two are semi-even, or at least one is even.

The norm of any odd complex number is of the form $4n+1$ ; the norm of a semi-even number is of the form $8n+2$ ; and finally, the norm of an even number is the product of a number of the form $4n+1$ and a power of two which is greater than or equal to $4$.

36.
Since the connection between four associated complex numbers is analogous to the connection between two opposite real numbers (i . e . they are absolutely equally and affected by opposite signs), and among these, the positive number is usually considered as the primary one, the question arises whether a similar distinction can be established for four associated complex numbers, and whether it should be considered useful. In order to decide this, we must consider that the principle of distinction should be such that the product of two numbers, which are considered as primary among their associates, always becomes a primary number among their associates. But we are soon assured that such a principle does not exist at all unless the distinction is restricted to integers: so much so that the only useful distinction should be limited to odd numbers. For these purposes, the proposed goal can be achieved in two ways. Namely,

I. Given two numbers $a+b i$, $a^{\prime}+b^{\prime} i$ such that $a$ , $a^{\prime}$  are of the form $4 n+1$ , and $b$ , $b^{\prime}$  are even, their product will enjoy the same property, that the real part is $\equiv 1\pmod{4}$ , and the imaginary part is even. And it can be easily seen that among four odd associates, only one is of that form.

II. Given a number $a+b i$ such that $a-1$  and $b$  are either both even or both odd, then its product with a complex number of the same form will be of the same form, and it is easily seen that among four odd associates, only one is of this form.

From these two almost equally suitable principles, we will adopt the latter, namely that among four odd associated complex numbers, the one which is congruent to the positive unit modulo $2+2i$ will be considered to be primary. In this way, it will be possible to state several important theorems with greater concision. Thus, the primary complex prime numbers are $-1+2i$, $-1-2i$ , $+3+2i$ , $+3-2i$ , $+1+4i$ , $+1-4i$ , etc., and also the real numbers $-3$ , $-7$ , $-11$ , $-19$ , etc., which are always explicitly marked with a negative sign. The conjugate of a primary odd complex number will always be primary.

For semi-even and even numbers in general, a similar distinction would be too arbitrary and of little use. From the associated prime numbers $1+i$, $1-i$ , $-1+i$ , $-1-i$ , we can indeed choose one as primary over the others, but we will not extend such a distinction to composite numbers.

37.
If among the factors of a complex composite number, numbers are found which are themselves composite, and these again are resolved into their factors, it is clear that we will eventually descend to prime factors, i. e. , any composite number is resolvable into prime factors. If any non-primary numbers are found, substitute in place of each of them the product of the primary associate by $i$, $-1$ or $-i$. In this way, it is clear that any composite complex number $M$ can be reduced to the form

$$M=i^{\mu} A^{\alpha} B^{\beta} C^{\gamma} \ldots$$

such that $A$, $B$ , $C$ etc. are distinct primary complex prime numbers, and $\mu=0$, $1$ , $2$ or $3$. Concerning such resolutions, a theorem presents itself, that it can only be done in one way. This theorem might appear obvious in passing, but it certainly requires a demonstration. To which the following lays out a path

''A product $M=A^{\alpha} B^{\beta} C^{\gamma} \ldots$, where $A$ , $B$ , $C$ are distinct primary complex prime numbers, cannot be divisible by any primary complex prime number, which is not found among $A$ , $B$ , $C$ , etc. ''

Proof. Let $P$ be a primary complex prime number not contained among $A$, $B$ , $C$ , etc. , and let $p$, $a$ , $b$ , $c$ , etc. be the norms of the numbers $P$, $A$ , $B$ , $C$ , etc. It is easily seen that the norm of the number $M$ is $=a^{\alpha} b^{\beta} c^{\gamma}$  etc. , from which it follows that if $M$ were divisible by ${P}$, then its norm would be divisible by $p$. Since the norms are either real prime numbers (from the sequence $2$, $5$ , $13$ , $17$ etc . ), or squares of real prime numbers (from the sequence $9$ , $49$ , $121$  etc . ), it is clear that this cannot occur, unless $p$  is identical to some norm $a$ , $b$ , $c$ , etc. : we thus suppose $p=a$. But since $P$ and $A$  are assumed to be distinct primary complex prime numbers, it is easy to see that these cannot simultaneously hold, unless $P$  and $A$  are imaginary complex numbers, and therefore $p=a$  is an odd real prime number (not the square of a prime number). We therefore set $A=k+l i$, $P=k-l i$. It follows (by extending the concept and sign of congruence to complex integers) that we have $A \equiv 2 k\pmod{P}$, from which it is easily deduced that

$$M \equiv 2^{\alpha} k^{\alpha} B^{\beta} C^{\gamma} \ldots\pmod{P}$$

Therefore, while $M$ is supposed to be divisible by $P$ ,

$$2^{\alpha} k^{\alpha} B^{\beta} C^{\gamma} \ldots$$

will also be divisible by $P$, and hence the norm of this number,

$$=2^{2 \alpha} k^{2 \alpha} b^{\beta} c^{\gamma} \ldots$$

will be divisible by $p$. But since 2 and $k$ are not divisible by $p$, it follows that $p$  must be identical to some of the numbers $b$ , $c$ , etc. : let’s say $p=b$. From this, we conclude that either $B=k+l i$, or $B=k-l i$ , i. e. either $B=A$, or $B=P$ , both of which contradict the hypothesis.

From this theorem, another one is easily derived, namely that the resolution into prime factors can only be accomplished in a single way. This follows using reasoning entirely analogous to that which we used for real numbers in Disquisitiones Arithmeticae (art. 16); it would therefore be superfluous to dwell on it here.

38.
We now proceed to congruences of numbers with respect to complex moduli. But at the outset of this discussion, it is convenient to indicate how the domain of complex quantities can be visualized intuitively.

Just as every real quantity can be expressed in terms of a segment originating from an arbitrary starting point on a doubly infinite line, by comparing it to another arbitrary segment which is taken as a unit, and can thus also be represented by another point, so that points on one side of the starting point represent positive quantities and on the other side represent negative quantities, so can any complex quantity be represented by a point in an infinite plane, in which a line is fixed for real quantities, so that a complex quantity $x+i y$ is represented by a point whose abscissa is $=x$  and whose ordinate (taken positively on one side of the line of abscissas, and negative on the other) is $=y$. In this way, it can be said that an arbitrary complex quantity can be measured by the distance between the position of the referred point and the position of the initial point, with a positive unit denoting a determined arbitrary deflection towards a determined arbitrary direction; a negative unit denoting an equally large deflection towards the opposite direction; and finally imaginary units denoting equally large deflections towards two perpendicular directions.

In this way the metaphysics of so-called imaginary quantities is remarkably elucidated. If the initial point is denoted by $(0)$, and two complex quantities $m$ , $m^{\prime}$ are referred to the points $M$ , $M^{\prime}$ , which express their relative position to $(0)$ , the difference $m-m^{\prime}$  will be nothing but the position of the point $M$  relative to the point $M^{\prime}$ ; likewise, by representing the product $m m^{\prime}$  as the position of the point $N$  relative to $(0)$ , you will easily see that this position is determined just as much by the position of the point $M$  to $(0)$ , as the position of the point $M^{\prime}$  is determined by the position of the point corresponding to the positive unit, so that it is not inappropriate to say that the positions of the points corresponding to the complex quantities $m m^{\prime}$ , $m$ , $m^{\prime}$ , $1$  form a proportion. But we reserve a more extensive treatment of this matter for another occasion. The difficulties which are supposedly involved in the theory of imaginary quantities largely derive from unsuitable nomenclature (indeed, some have inappropriately referred to them as impossible quantities). If, starting from the concept of variations in two dimensions (which are understood most purely through spatial intuition), we had called positive quantities direct, negative quantities inverse, and imaginary quantities lateral, then clarity would succeeded over obscurity.

39.
The things that were brought forth in the preceding article referred to continuous complex quantities: in arithmetic, which deals only with integers, the schema of complex numbers will be a system of equidistant points and lines arranged in such a way that the infinite plane is divided into infinitely many equal squares. All numbers divisible by a given complex number $a+bi=m$ will also form infinitely many squares, whose sides $=\sqrt{a a+b b}$  and areas $=a a+b b$ ; the latter squares will be inclined to the former whenever neither of the numbers $a$, $b$  is $=0$. To every number not divisible by the modulus $m$, there will be a corresponding point, either situated inside such a square, or in a side adjacent to two squares; however, the latter cannot occur unless $a$ , $b$ have a common divisor. Furthermore, it is clear that numbers congruent modulo $m$ will occupy congruent positions in their squares. Hence it is easily concluded that if we collect all numbers situated within a determined square, together with all those which may lie on two of its non-opposite sides, and finally one number divisible by $m$, then we will have a complete system of incongruent residues modulo $m$ , i. e. any integer will be congruent to precisely one of them. It would not be hard to show that the number of these residues is equal to the norm of the modulus, $a a+b b$. But it seems advisable to demonstrate this weighty theorem in a purely arithmetic way.

40.
''Let $m=a+b i$ be a given complex modulus, with norm $a a+b b=p$, and assume that $a$ , $b$  are relatively prime numbers. Then any complex integer will be congruent, modulo $m$, to at least one residue from the series $0$ , $1$ , $2$ , $3 \ldots p-1$ , and not to more than one.''

Proof. I. Let $\alpha$, $\beta$ be integers such that $\alpha a+\beta b=1$. Then we have

$$i=\alpha b-\beta a+m(\beta+\alpha i)$$

Therefore, given an integral complex number $A+B i$, we have

$$A+B i=A+(\alpha b-\beta a) B+m(\beta B+\alpha B i)$$

Hence, denoting by $h$ the smallest positive residue of the number $A+(\alpha b-\beta a) B$  modulo $p$, and setting

$$A+(\alpha b-\beta a) B=h+k p=h+m(a k-b k i)$$

we get

$$A+B i=h+m(\beta B+a k+(\alpha B-b k) i)$$

or

$$A+B i \equiv h\pmod{m}. \quad \text{Q. E. P.}$$

II. If a given complex number is congruent to two real numbers $h$, $h^{\prime}$ modulo $m$ , then these will also be congruent to each other. Therefore, letting $h-h^{\prime}=m(c+d i)$, we have

$$(h-h^{\prime})(a-b i)=p(c+d i)$$

and hence

$$(h-h^{\prime}) a=p c, \quad (h-h^{\prime}) b=-p d$$

Moreover, since $a \alpha+b \beta=1$ ,

$$h-h^{\prime}=p(c \alpha-d \beta), \text{ i.e. } h \equiv h^{\prime}\pmod{p}$$

Therefore, since $h$ and $h^{\prime}$  are not equal, they cannot both be included in the complex of numbers $0$, $1$ , $2$ , $3 \ldots p-1$. Q. E. S.

41.
''Let $m=a+b i$ be a complex modulus, whose norm is $a a+b b=p$, and assume that $a$ , $b$  are not relatively prime, but instead have a greatest common divisor $\lambda$  (which we assume to be positive). Then any complex number will be congruent to one and only one residue $x+y i$ such that $x$  is one of the numbers $0,1,2,3 \ldots \frac{p}{\lambda}-1$, and $y$  is one of the numbers $0$ , $1$ , $2$ , $3 \ldots \lambda-1$ .''

Proof. I. By taking integers $\alpha, \beta$ such that $\alpha a+\beta b=\lambda$, we have $\lambda i=\alpha b-\beta a+m(\beta+\alpha i)$. Now let $A+B i$ be the given complex number, let $y$  the minimal positive residue of $B$  modulo $\lambda$, let $x$  be the minimal positive residue of $A+(\alpha b-\beta a) \cdot \frac{B-y}{\lambda}$  modulo $\frac{p}{\lambda}$ , and set

$$A+(\alpha b-\beta a) \cdot \frac{B-y}{\lambda}=x+\frac{p}{\lambda} \cdot k$$

Then

$$\begin{aligned} A+B i-(x+y i) & =\frac{p}{\lambda} \cdot k+(B-y) i-(\alpha b-\beta a) \frac{B-y}{\lambda} \\ & =\frac{p}{\lambda} \cdot k+\frac{B-y}{\lambda} \cdot m(\beta+\alpha i) \\ & =(\frac{a}{\lambda}-\frac{b}{\lambda} \cdot i) k m+\frac{B-y}{\lambda}(\beta+\alpha i) m \end{aligned}$$

which is divisible by $m$, i. e. $A+B i \equiv x+y i\pmod{m}\ $ Q. E. P.

II. Let us suppose that two complex numbers $x+y i$, $x^{\prime}+y^{\prime} i$ are congruent to the same complex number modulo $m$ , so that they will also be congruent to each other modulo $m$. Then they will also be congruent modulo $\lambda$, and thus $y \equiv y^{\prime}\pmod{\lambda}$. Therefore, if both $y$, $y^{\prime}$ are assumed to be among the numbers $0$ , $1$ , $2$ , $3 \ldots \lambda-1$ , then we must necessarily have $y=y^{\prime}$. Likewise, we must also have $x \equiv x^{\prime}\pmod{m}$, i. e. $x-x^{\prime}$ is divisible by $m$, and therefore $\frac{x-x^{\prime}}{\lambda}$  is an integer divisible by $\frac{a}{\lambda}+\frac{b}{\lambda} \cdot i$ , i. e.

$$\frac{x-x^{\prime}}{\lambda} \equiv 0\pmod{\frac{a}{\lambda}+\frac{b}{\lambda} \cdot i}$$

From this, since $\frac{a}{\lambda}$, $\frac{b}{\lambda}$ are relatively prime, it is concluded by the second part of the theorem of the previous article that $\frac{x-x^{\prime}}{\lambda}$  is also divisible by the norm of the number $\frac{a}{\lambda}+\frac{b}{\lambda} \cdot i$ , i. e. by the number $\frac{p}{\lambda \lambda}$, and therefore $x-x^{\prime}$ is divisible by $\frac{p}{\lambda}$. Therefore, if both $x$, $x^{\prime}$ are assumed to be in the complex of numbers $0$ , $1$ , $2$ , $3 \ldots \frac{p}{\lambda}-1$ , then we must necessarily have $x=x^{\prime}$ , i. e. the residues $x+y i$, $x^{\prime}+y^{\prime} i$ are identical. Q. E. S.

It is clearly also necessary to refer to the case where the modulus is a real number, in which case $b=0$ and $\lambda= \pm a$, and also where it is a pure imaginary number, in which case $a=0$  and $\lambda= \pm b$. In both cases, we have $\frac{p}{\lambda}=\lambda$.

42.
Therefore, if we sort all complex numbers into classes in such a way that numbers which are congruent with respect to a given modulus are in the same class, and incongruent numbers are assigned to different classes, then there will be exactly $p$ classes exhaustively covering the entire domain of complex integers, where $p$  denotes the norm of the modulus. If we form a complex of $p$ numbers by choosing one number from each class as in articles 40, 41, then we will have a complete system of incongruent residues. In this system, the choice of a representative from each class was based on the principle, that for any class, a residue $x+yi$ should be adopted, such that $y$  has the minimum possible non-negative value, and such that $x$  has the minimum possible non-negative value among all residues with the same minimum value of $y$. But for other purposes, it will be suitable to use different principles. Of particular note is the method where residues are adopted which, when divided by the modulus, yield the simplest possible quotients. Clearly, if $\alpha+\beta i$, $\alpha^{\prime}+\beta^{\prime} i$ , $\alpha^{\prime \prime}+\beta^{\prime \prime} i$ etc. are quotients resulting from the division of congruent numbers by the modulus, then the differences between the quantities $\alpha$, $\alpha^{\prime}$ , $\alpha^{\prime \prime}$ etc. will be whole numbers, as will be the differences between the quantities $\beta$, $\beta^{\prime}$ , $\beta^{\prime \prime}$ etc. , so it is clear that there will always be one residue for which both $\alpha$ and $\beta$  lie between the limits $0$  and $1$, with the former being included and the latter excluded: we will simply call such a residue the minimal residue. If preferable, the limits $-\frac{1}{2}$ and $+\frac{1}{2}$  may be adopted instead (with one included and the other excluded): we will call the residue which satisfies these conditions the absolute minimum.

Regarding these minimal residues, the following problems present themselves.

43.
The minimum residue of a given complex number $A+Bi$ with respect to the modulus $a+bi$, whose norm is $=p$ , can found in the following way. If $x+yi$ is the minimal residue to be found, then $(x+yi)(a-bi)$  will be the minimal residue of the product $(A+Bi)(a-bi)$  with respect to the modulus $(a+bi)(a-bi)$, i. e. with respect to the modulus $p$. Therefore, assuming

$$a A+ b B = F p + f, \quad a B - b A = G p + g,$$

so that $f$, $g$ are the minimum residues of the numbers $aA + bB$ , $aB - bA$  with respect to the modulus $p$ , then

$$x+yi=\frac{f+gi}{a-bi}$$

or

$$\begin{aligned} & x=\frac{af-bg}{p}=A-aF+bG \\ & y=\frac{ag+bf}{p}=B-aG-bF \end{aligned}$$

Clearly, the minimum residues $f$, $g$ should be taken either within the limits $0$  and $p-1$ , or within $-\frac{1}{2}p$  and $\frac{1}{2}p$ , depending on whether the simply minimal or the absolutely minimal residue is desired.

44.
The construction of a complete system of minimal residues for a given modulus can be accomplished in several ways. The first method proceeds by first determining the limits within which the real parts must lie, and then assigning limits for the imaginary parts for each value within these limits. The general criterion for a minimal residue $x+yi$ modulo $a+bi$  consists in the conditions that both $ax+by=\xi$  and $ay-bx=\eta$  must lie within the limits $0$  and $aa+bb$, whenever we deal with simply minimal residues, or lie within the limits $-\frac{1}{2}(aa+bb)$  and $\frac{1}{2}(aa+bb)$  whenever absolutely minimal residues are desired, with one of the limits excluded. Specific rules are required to distinguishing cases that are brought about by the variety of signs of the numbers $a$, $b$ , but since the the solution of this presents no difficulty, it has been deferred and we shall refrain from lingering on it here: a single example will suffice to explain the nature of the method.

For the modulus $5+2i$, the simply minimal residues $x+yi$ must be prepared in such a way that both $5x+2y=\xi$  and $5y-2x=\eta$  are among the numbers $0, 1, 2, 3, \ldots, 28$. The equation $29x=5\xi-2\eta$ shows that the positive values of $x$  cannot exceed $\frac{5 \cdot 28}{29}$, and by considering the sign, the negative values cannot exceed $\frac{2 \cdot 28}{29}$. Therefore, the admissible values of $x$ are $-1$, $0$ , $1$ , $2$ , $3$ , $4$. For $x=-1$, $2y$ must be among the numbers $5$ , $6$ , $7 \ldots 33$ , and $5y$  must be among $-2$ , $-1$ , $0$ , $1 \ldots 26$. Hence, the minimum value of $y$ is $+3$, and the maximum is $+5$. Treating the remaining values of $x$ similarly, the following schema for all minimal residues arises: $$ \begin{array}{r|l} x & y \\ \hline -1 & 3, 4, 5 \\ 0 & 0, 1, 2, 3, 4, 5 \\ 1 & 1, 2, 3, 4, 5, 6 \\ 2 & 1, 2, 3, 4, 5, 6 \\ 3 & 2, 3, 4, 5, 6 \\ 4 & 2, 3, 4 \\ \end{array} $$

In a similar manner, for the absolutely minimal residues, $\xi$ and $\eta$  must be among the numbers $-14$, $-13$ , $-12 \ldots+14$ ; hence $29 x$  cannot be outside the limits $-7.14$  and $+7.14$ , and therefore $x$  must be among the numbers $-3$ , $-2$ , $-1$ , $0$ , $1$ , $2$ , $3$. For $x=-3$, $2 y=\xi-5 x=\xi+15$ will be among the numbers $1$ , $2$ , $3 \ldots 29$ , however $5 y=\eta+2 x=\eta-6$  will be among $-20$ , $-19$ , $-18 \ldots+8$ : hence it follows that for $y$  only the value $+1$  is possible. Proceeding in the same way for the other values of $x$, we have the following schema for all absolutely minimal residues:

$$ \begin{array}{r|l} x & y \\ \hline -3 & +1 \\ -2 & -2, -1, 0, +1, +2 \\ -1 & -3, -2, -1, 0, +1, +2 \\ 0 & -2, -1, 0, +1, +2 \\ +1 & -2, -1, 0, +1, +2, +3 \\ +2 & -2, -1, 0, +1, +2 \\ +3 & -1 \\ \end{array} $$

45.
In applications of the second method, it is convenient to distinguish two cases.

In the first case, where $a$ and $b$  do not have a common divisor, let $\alpha a+\beta b=1$, and let $k$  be the minimal positive residue of $\beta a-\alpha b$  modulo $p$. Then the identities

$$a(\beta a-\alpha b)=\beta p-b(\alpha a+\beta b), \quad b(\beta a-\alpha b)=-\alpha p+a(\alpha a+\beta b)$$

show that $a k \equiv-b$, $b k \equiv a \pmod{p}$. Therefore, if we assume that $a x+b y=\xi$, $a y-b x=\eta$ as above, then we have $\eta \equiv k \xi$ , $\xi \equiv -k \eta \pmod{p}$. So all numbers $\xi+\eta i$ corresponding to simply minimal residues $x+y i$  are obtained when the values $0$, $1$ , $2$ , $3 \ldots p-1$  are successively taken for $\xi$ , and the minimal positive residues of the products $k \xi$  modulo $p$  are taken for $\eta$. Likewise the simply minimal residues will be obtained, but in a different order, if the values $0$, $1$ , $2$ , $3 \ldots p-1$ are taken for $\eta$  and the minimum residues of the products $-k \eta$  are taken for $\xi$. From each $\xi+\eta i$, the corresponding $x+y i$ are given by the formula

$$x+y i=\frac{\xi+\eta i}{a-b i}=\frac{a \xi-b \eta}{p}+\frac{a \eta+b \xi}{p} \cdot i$$

Now, it is clear that when $\eta$ increases by unity, $\xi$  will undergo an increase of $k$  or a decrease of $p-k$, and thus $x+y i$  will become

$$ \frac{a-k b}{p}+\frac{a k+b}{p} \cdot i \text{ or } \frac{a-k b}{p}+b+(\frac{a k+b}{p}-a) \cdot i$$

an observation which serves to facilitate the construction.

Finally, it is clear that if the absolutely minimal residues of $x+yi$ are desired, these instructions are only to be changed in such a way that the values of $\xi$  are subsequently assigned to be between the limits $-\frac{1}{2} p$  and $+\frac{1}{2} p$, while for $\eta$  one should obtain the absolutely minimal residues of the products $k\xi$. Here is a table of the absolute minimum residues for the modulus $5+2i$ arranged in this way:

Simply minimal residues. $$ \begin{array}{r|r||r|r||r|r} \xi+\eta i & x+y i & \xi+\eta i & x+y i & \xi+\eta i & x+y i \\ \hline 0 & 0 & 10+25 i & +5 i & 20+21 i & +2+5 i \\ 1+17 i & -1+3 i & 11+13 i & +1+3 i & 21+9 i & +3+3 i \\ 2+5 i & +i & 12+i & +2+i & 22+26 i & +2+6 i \\ 3+22 i & +1+4 i & 13+18 i & +1+4 i & 23+14 i & +3+4 i \\ 4+10 i & +2 i & 14+6 i & +2+2 i & 24+2 i & +4+2 i \\ 5+27 i & -1+5 i & 15+23 i & +1+5 i & 25+19 i & +3+5 i \\ 6+15 i & +3 i & 16+11 i & +2+3 i & 26+7 i & +4+3 i \\ 7+3 i & +1+i & 17+28 i & +1+6 i & 27+24 i & +3+6 i \\ 8+20 i & +4 i & 18+16 i & +2+4 i & 28+12 i & +4+4 i \\ 9+8 i & +1+2 i & 19+4 i & +3+2 i & & \\ \end{array} $$ Absolutely minimal residues. $$ \begin{array}{r|r||r|r||r|r} \xi+\eta i & x+y i & \xi+\eta i & x+y i & \xi+\eta i & x+y i \\ \hline -14-6 i & -2-2 i & -4-10 i & -2 i & +5-2 i & +1 \\ -13+11 i & -3+i & -3+7 i & -1+i & +6-14 i & +2-2 i \\ -12-i & -2-i & -2-5 & -i & +7+3 i & +1+i \\ -11-13 i & -1-3 i & -1+12 i & -1+2 i & +8-9 i & +2-i \\ -10+4 i & -2 & 0 & 0 & +9+8 i & +1+2 i \\ -9-8 i & -1-2 i & +1-12 i & +1-2 i & +10-4 i & +2 \\ -8+9 i & -2+i & +2+5 i & +i & +11+13 i & +1+3 i \\ -7-3 i & -1-i & +3-7 i & +1-i & +12+i & +2+i \\ -6+14 i & -2+2 i & +4+10 i & +2 i & +13-11 i & +3-i \\ -5+2 i & -1 & & & +14+6 i & +2+2 i \\ \end{array} $$

In the second case, where $a$, $b$ are not coprime, it is easy to reduce to the previous case. Let $\lambda$ be the greatest common divisor of the numbers $a$, $b$ , and let $a=\lambda a^{\prime}$ , $b=\lambda b^{\prime}$. Let $F$ denote an indefinite minimal residue for the modulus $\lambda$, insofar as it is considered as a complex number, i.e., it represents an indefinite number $x+yi$  such that $x$ , $y$  are either between $0$  and $\lambda$  or between $-\frac{1}{2}\lambda$  and $\frac{1}{2}\lambda$  (depending on whether simply or absolutely minimal residues are in question). Let $F^{\prime}$ denote an indefinite minimal residue for the modulus $a^{\prime}+b^{\prime}i$. Then $(a^{\prime}+b^{\prime}i)F+F^{\prime}$ will be an indefinite minimal residue for the modulus $a+bi$, and the complete system of these residues will emerge as all $F$  are combined with all $F^{\prime}$.

46.
Two complex numbers are said to be prime to each other if they do not admit any common divisors other than units. But whenever such common divisors are present, the one with the maximum norm is called the greatest common divisor.

If the resolution of two numbers into prime factors is given, the determination of the greatest common divisor is carried out entirely in the same way as for real numbers (Disquiss. Ar. art. 18). At the same time it becomes clear from this that all the common divisors of the two given numbers must be divisible by the greatest common divisor found in this way. Since it is already evident that the three associated numbers are also common divisors, it follows that there will always be four greatest common divisors, and no more, and their norm will be a multiple of the norm of any other common divisor.

If the factorization of two given numbers into prime factors is not known, the greatest common divisor can be found using a similar algorithm as for real numbers. Let $m$, $m^{\prime}$ be the two given numbers, and form a repeated division series $m^{\prime \prime}$ , $m^{\prime \prime \prime}$ , etc., such that $m^{\prime \prime}$  is the absolutely minimal residue of $m$  with respect to the modulus $m^{\prime}$ , $m^{\prime \prime \prime}$  is the absolutely minimal residue of $m^{\prime}$  with respect to the modulus $m^{\prime \prime}$ , and so on. Denoting the norms of the numbers $m$, $m^{\prime}$ , $m^{\prime \prime}$ , $m^{\prime \prime \prime}$ , etc., by $p$ , $p^{\prime}$ , $p^{\prime \prime}$ , $p^{\prime \prime \prime}$ , etc., we have $\frac{p^{\prime \prime}}{p^{\prime}}$ as the norm of the quotient $\frac{m^{\prime \prime}}{m^{\prime}}$ , and therefore, by the definition of absolutely minimal residue, it is certainly not greater than $\frac{1}{2}$ ; the same holds for $\frac{p^{\prime \prime \prime}}{p^{\prime \prime}}$  etc. Therefore, the positive real integers $p^{\prime}$ , $p^{\prime \prime}$ , $p^{\prime \prime \prime}$ , etc., will form a continuously decreasing series, which necessarily reaches $0$  at some point, or, equivalently, in the series $m$ , $m^{\prime}$ , $m^{\prime \prime}$ , $m^{\prime \prime \prime}$ , etc., we will eventually reach a term that measures the preceding without residue. Let this term be $m^{(n+1)}$, and suppose that

$$\begin{aligned} & m=k m^{\prime}+m^{\prime \prime} \\ & m^{\prime}=k^{\prime} m^{\prime \prime}+m^{\prime \prime \prime} \\ & m^{\prime \prime}=k^{\prime \prime} m^{\prime \prime \prime}+m^{\prime \prime \prime \prime} \end{aligned}$$

etc., up to

$$m^{(n)}=k^{(n)} m^{(n+1)}$$

By going through these equations in reverse order, it is clear that $m^{(n+1)}$ divides each preceding term $m^{(n)} \ldots m^{\prime \prime}$, $m^{\prime}$ , $m$ ; going through the same equations in direct order, it is clear that any common divisor of the numbers $m$ , $m^{\prime}$  also divides each subsequent term. The former conclusion shows that $m^{(n+1)}$ is a common divisor of the numbers $m$, $m^{\prime}$ ; the latter shows that this divisor is the greatest.

Moreover, whenever the final residue $m^{(n+1)}$ turns out to be equal to one of the four units $1$, $-1$ , $i$ , $-i$ , this will indicate that $m$  and $m^{\prime}$  are relatively prime.

47.
If the equations of the foregoing article, except for the last one, are combined in such a way that $m^{\prime \prime}, m^{\prime \prime \prime}$, $m^{\prime \prime \prime \prime} \ldots m^{(n)}$ are eliminated, there arises an equation of the form

$$m^{(n+1)}=h m+h^{\prime} m^{\prime}$$

where $h$, $h^{\prime}$ will be integers. Indeed, if we use the notation introduced in ''Disquiss. Ar.'' art. 27 then

$$\begin{aligned} & h= \pm\left[k^{\prime}, k^{\prime \prime}, k^{\prime \prime \prime} \ldots k^{(n-1)}\right]= \pm\left[k^{(n-1)}, k^{(n-2)} \ldots k^{\prime \prime}, k^{\prime}\right] \\ & h^{\prime}=\mp\left[k, k^{\prime}, k^{\prime \prime}, k^{\prime \prime \prime} \ldots k^{(n-1)}\right]=\mp\left[k^{(n-1)}, k^{n-2)} \ldots k^{\prime \prime}, k^{\prime}, k\right] \end{aligned}$$

where the upper or lower signs hold, depending on whether $n$ is even or odd. We state this theorem as follows:

The greatest common divisor of two complex numbers $m$, $m^{\prime}$ can be reduced to the form $h m+h^{\prime} m^{\prime}$ , in such a way that $h$ , $h^{\prime}$  are integers.

This is clearly valid not only for the greatest common divisor to which the algorithm in the previous article led, but also for the three associated divisors, for which one should replace the coefficients $h$, $h^{\prime}$ with either $hi$ , $h^{\prime}i$  or $-h$ , $-h^{\prime}$ , or $-hi$ , $-h^{\prime}i$.

Therefore, whenever the numbers $m$, $m^{\prime}$ are relatively prime, the equation

$$1 = hm + h^{\prime}m^{\prime}$$

can be satisfied.

Let us consider e. g. the numbers $31+6i=m$ and $11-20i=m^{\prime}$. Here we find

$$\begin{array}{clccl} k&=\phantom{+1-\;} i,&\quad& m^{\prime \prime}&=+11-5 i \\ k^{\prime}&=+1-i, &\quad& m^{\prime \prime \prime}&=+\phantom{0}5-4 i \\ k^{\prime \prime}&=+2, &\quad& m^{\prime \prime \prime \prime}&=+\phantom{0}1+3 i \\ k^{\prime \prime \prime}&=-1-2 i, &\quad& m^{\prime \prime \prime \prime}&=\phantom{+00}+i \\ k^{\prime \prime \prime \prime}&=+3-i &\quad&& \end{array}$$

and thus

$$\begin{aligned} & {\left[k^{\prime}, k^{\prime \prime}, k^{\prime \prime \prime}\right]=-6-5i} \\ & {\left[k, k^{\prime}, k^{\prime \prime}, k^{\prime \prime \prime}\right]=+4-10i} \end{aligned}$$

and therefore

$$m^{\prime \prime \prime \prime \prime}=i=(6+5i)m+(4-10i)m^{\prime}$$

as well as

$$1=(5-6i)m+(-10-4i)m^{\prime}$$

which is confirmed by calculation.

48.
By all of the above, everything required for the theory of congruences of the first degree in the arithmetic of complex numbers has been prepared; but since it does not essentially differ from that which holds for the arithmetic of real numbers, and which is copiously set out in the Disquisitiones Arithmeticae, it will suffice to set down the principal points here.

I. The congruence $m t \equiv 1\pmod{m^{\prime}}$ is equivalent to the indeterminate equation $m t+m^{\prime} u=1$, and if this is satisfied by the values $t=h, u=h^{\prime}$ , then its general solution is exhibited by $t \equiv h\pmod{m^{\prime}}$ ; the condition for solvability is that the modulus $m^{\prime}$  does not have a common divisor with the coefficient $m$.

II. The solution of the congruence $a x+b \equiv c\pmod{M}$ in the case where $a$, $M$  are relatively prime, depends on the solution of

$$a t \equiv 1\pmod{M}$$

and if this is satisfied by $t=h$, the general solution is given in the formula

$$x \equiv(c-b) h\pmod{M}$$

III. In the case where $a$, $M$ have a common divisor $\lambda$ , the congruence $a x+b \equiv c\pmod{M}$  is equivalent to

$$\frac{a}{\lambda} \cdot x \equiv \frac{c-b}{\lambda}\pmod{\frac{M}{\lambda}}$$

Therefore, when the greatest common divisor of the numbers $a$, $M$ is adopted for $\lambda$ , the solution of the proposed congruence is reduced to the preceding case, and for this to be solvable it is clearly necessary and sufficient that $\lambda$  also divides the difference $c-b$.

49.
So far we have only touched on elementary matters, yet it was not permissible to omit the logical connections. In more advanced investigations, the arithmetic of complex numbers is similar to the arithmetic of real numbers, in that more elegant and simpler theorems emerge, if we only consider such moduli which are prime numbers: in fact, the extension to composite moduli is usually more lengthy than difficult, and involves more labor than skill. Therefore, in the following, we will primarily deal with prime moduli.

50.
Let $X$ denote a function of the variable $x$  of the form

$$A x^{n}+B x^{n-1}+C x^{n-2}+\text{etc.}+M x+N$$

where $n$ is a positive real integer, $A$, $B$ , $C$ , etc. are real or imaginary integers, and $m$ is a complex integer. Any integer that, when substituted for $x$, yields a value of $X$ which is divisible by $m$ , we will call a root of the congruence $X \equiv 0\pmod{m}$. Roots which are congruent with respect to the modulus will not be considered distinct.

When the modulus is a prime number, such a congruence of order $n$ cannot admit more than $n$  distinct solutions. Letting $\alpha$ be an arbitrary integer (complex), $X$  can be divided by $x-\alpha$  and thereby reduced to the indefinite form $X=(x-\alpha) X^{\prime}+h$, where $h$  is an integer and $X^{\prime}$  is a function of degree $n-1$  with integer coefficients. Now, whenever $\alpha$ is a root of the congruence $X \equiv 0\pmod{m}$, it is clear that $h$  will be divisible by $m$ , and therefore we obtain indefinitely $X \equiv(x-\alpha) X^{\prime}\pmod{m}$.

Now, if $\beta$ is a given integer, and $X^{\prime}$  is reduced to the form $(x-\beta) X^{\prime \prime}+h^{\prime}$, then $X^{\prime \prime}$  will be a function of degree $n-2$  with integral coefficients. However, if $\beta$ is assumed to be a root of congruence ${X} \equiv 0$, it must also satisfy $(\beta-\alpha) X^{\prime} \equiv 0$  and $X^{\prime} \equiv 0$ , since the roots $\alpha$ , $\beta$  are incongruent. Hence, it follows that $h^{\prime}$ must be divisible by $m$, or indefinitely, $X \equiv(x-\alpha)(x-\beta) X^{\prime \prime}\pmod{m}$.

Similarly, with the introduction of a third root $\gamma$ incongruent to the previous ones, we will have indefinitely $X \equiv(x-\alpha)(x-\beta)(x-\gamma) X^{\prime \prime \prime}$, such that $X^{\prime \prime \prime}$  is a function of order $n-3$  with integral coefficients. This process can be further extended, and it is evident that the coefficient of the highest term in each function is $=A$, which is assumed to be indivisible by $m$. Otherwise, the congruence $X \equiv 0$ would essentially have a lower degree. Therefore, whenever there are $n$ incongruent roots, say $\alpha, \beta, \gamma \ldots \nu$, we will have indefinitely

$$X \equiv A(x-\alpha)(x-\beta)(x-\gamma) \ldots(x-\nu)\pmod{m}$$

Hence, the substitution of new values which are not congruent to one of $\alpha, \beta, \gamma \ldots \nu$ will produce a value of $X$  which is not divisible by $m$, and the truth of the theorem follows naturally.

Moreover, this demonstration essentially agrees with that which we presented in ''Disq. Ar.'' art. 43, with every step being equally valid for complex numbers as for real numbers.

51.
For the most part, the results presented in the third section of the Disquisitiones Arithmeticae concerning residues of powers also hold true, with slight modifications, in the arithmetic of complex numbers. Indeed, the proofs of the theorems can often be retained. Nevertheless, in order to provide a complete account, we will present the main theorems and establish them with concise proofs, in which it should always be understood that the modulus is a prime number.

''Let $k$ denote an integer not divisible by the modulus $m$. If the norm of $m$ is $=p$, then $k^{p-1} \equiv 1 \pmod{m}$ .''

Proof. Let $a$, $b$ , $c$ , etc. be a complete system of incongruent residues for the modulus $m$. Remove the residue divisible by $m$, and denote the resulting complex by $C$ , so that the multitude of $C$ is $=p-1$. Let $C^{\prime}$ be the complex of products $k a$, $k b$ , $k c$ , etc. By hypothesis, none of these products will be divisible by $m$ , so each of them will be congruent to a residue in the complex $C$. Set $a k \equiv a^{\prime}$, $b k \equiv b^{\prime}$ , $c k \equiv c^{\prime}$ , etc. $\pmod{m}$, where the numbers $a^{\prime}$ , $b^{\prime}$ , $c^{\prime}$ , etc. are found in the complex $C$ : let us denote the complex of numbers $a^{\prime}$, $b^{\prime}$ , $c^{\prime}$ , etc. by $C^{\prime \prime}$. Let $P$, $P^{\prime}$ , $P^{\prime \prime}$ be the products of individual numbers of the complexes $C$ , $C^{\prime}$ , $C^{\prime \prime}$ , respectively, that is,

$$\begin{aligned} & P=a b c \ldots \\ & P^{\prime}=k^{p-1} a b c \ldots=k^{p-1} P \\ & P^{\prime \prime}=a^{\prime} b^{\prime} c^{\prime} \ldots \end{aligned}$$

Since the numbers of the complex $C^{\prime \prime}$ are congruent to the numbers of the complex $C^{\prime}$, $P^{\prime \prime} \equiv P^{\prime}$  or $P^{\prime \prime} \equiv k^{p-1} P$. But since it is easy to see that any two numbers of the complex $C^{\prime \prime}$ are incongruent with each other, and thus all of them are distinct, the complex of numbers $C^{\prime \prime}$  must agree completely with the complex of numbers $C$, with only the order changed, whence $P^{\prime \prime}=P$. Thus, $(k^{p-1}-1) P$ will be divisible by $m$, and thus, since $m$  is a prime number that does not divide any of the factors of $P$ , $k^{p-1}-1$  will necessarily have to be divisible by $m$. Q. E. D.

52.
If $k$ denotes, as in the preceding article, an integer not divisible by the modulus $m$, and $t$  denotes the smallest exponent (other than 0) for which $k^{t} \equiv 1\pmod{m}$ , then $t$  will be a divisor of any other exponent $u$  for which $k^{u} \equiv 1\pmod{m}$ .

Proof. Suppose $t$ is not a divisor of $u$, and let $g t$  be the multiple of $u$  that is just greater than $u$ , so that $g t-u$  is a positive integer less than $t$. From $k^{t} \equiv 1$, $k^{u} \equiv 1$ , it follows that $0 \equiv k^{g t}-k^{u} \equiv k^{u}(k^{g t-u}-1)$ , so $k^{g t-u} \equiv 1$ , that is, a power of $k$ with exponent less than $t$  is equivalent to 1, contrary to the hypothesis.

As a corollary, it follows that $t$ must divide the number $p-1$.

We will call numbers $k$ for which $t=p-1$, primitive roots for the modulus $m$ : we will show that they in fact exist.

53.
Let the number $p-1$ be resolved into its prime factors, so that we have

$$p-1=a^{\alpha} b^{\beta} c^{\gamma} \ldots$$

where $a$, $b$ , $c$ , etc. are distinct real positive prime numbers. Let $A$, $B$ , $C$ , etc. be integers (complex) not divisible by $m$, which do not satisfy the respective congruences

$$x^{\frac{p-1}{a}} \equiv 1, x^{\frac{p-1}{b}} \equiv 1, x^{\frac{p-1}{c}} \equiv 1 \text{ etc.}$$

modulo $m$. The existence of $A$, $B$ , $C$ , etc. is clearly guaranteed by the theorem of article 50. Finally, let $h$ be congruent, modulo $m$, to the product

$$A^{\frac{p-1}{a^{\alpha}}} B^{\frac{p-1}{b^{\beta}}} C^{\frac{p-1}{c^{\gamma}}} \ldots$$

Then I claim that $h$ will be a primitive root.

Proof. Let $t$ denote the exponent of the lowest power $h^{t}$  which is congruent to unity. If $h$ were not a primitive root, then $t$  would be a proper divisor of $p-1$, or equivalently $\frac{p-1}{t}$  would be an integer greater than unity. Evidently, this integer will have its real prime factors among $a$, $b$ , $c$ , etc. : let us therefore suppose (which is allowed), that $\frac{p-1}{t}$ is divisible by $a$, and set $p-1=a t u$. Then, since $h^{t} \equiv 1$, we also have $h^{t u} \equiv 1$ or

$$A^{\frac{p-1}{a^{\alpha}} \cdot \frac{p-1}{a}} B^{\frac{p-1}{b^{\beta}} \cdot \frac{p-1}{a}} C^{\frac{p-1}{a^{\gamma}} \cdot \frac{p-1}{a}} \ldots \equiv 1$$

But evidently $\frac{p-1}{a b^{\beta}}$ is an integer, so

$$B^{\frac{p-1}{b^{\beta}} \cdot \frac{p-1}{a}}=(B^{p-1})^{\frac{p-1}{a b^{\beta}}} \equiv 1$$

similarly,

$$C^{\frac{p-1}{c^{\gamma}} \cdot \frac{p-1}{a}} \equiv 1\text{, and so on; hence we must have }A^{\frac{p-1}{a^{\alpha}} \cdot \frac{p-1}{a}} \equiv 1$$

Next, let a positive integer $\lambda$ be determined so that

$$\lambda b^{\beta} c^{\gamma} \ldots \equiv 1\pmod{a}$$

which can be done, since the prime number $a$ does not divide $b^{\beta} c^{\gamma} \ldots$, and set $\lambda b^{\beta} c^{\gamma} \ldots=1+a \mu$. Then it is clear that

$$A^{\lambda \cdot \frac{p-1}{a^{\alpha}} \cdot \frac{p-1}{a}} \equiv 1,\text{ or, since }\lambda \cdot \frac{p-1}{a^{\alpha}} \cdot \frac{p-1}{a} = (1+a \mu) \frac{p-1}{a} = (p-1) \mu + \frac{p-1}{a}$$

we have $A^{(p-1) \mu} \cdot A^{\frac{p-1}{a}} \equiv 1$, and hence, since we automatically have $A^{(p-1) \mu} \equiv 1$ , we also have $A^{\frac{p-1}{a}} \equiv 1$ , contrary to the hypothesis. Therefore, the assumption that $t$ is a proper divisor of $p-1$  is inconsistent, and so $h$  must necessarily be a primitive root.

54.
Let $h$ denote a primitive root modulo $m$, with norm $=p$. Then the terms of the sequence

$$1, h, h^{2}, h^{3}, \ldots, h^{p-2}$$

will be incongruent to each other. Hence we easily conclude that any integer not divisible by the modulus must be congruent to one of these, or in other words, it must exhibit a complete system of incongruent residues excluding zero. The exponent of the power to which a given number is congruent can be called its index, while $h$ can be called the base. Here are some examples in which we have given the absolutely minimal residue for each index.

First Example.

$m=5+4 i, \quad p=41, \quad h=1+2 i$

Example 2.

$m=7, p=49, h=1+2 i$

55.
We add some observations about primitive roots and indices, omitting the proofs for the sake of simplicity.

I. Indices which are congruent modulo $p-1$ correspond to residues which are congruent modulo $m$  and vice versa.

II. The residues corresponding to the indices which are relatively prime to $p-1$ are primitive roots and vice versa.

III. If a primitive root $h$ is accepted as the base, and the index of another primitive root $h^{\prime}$  is $t$, and $t^{\prime}$  is the index of $h$  when $h^{\prime}$  is taken as the base, then $t t^{\prime} \equiv 1\pmod{p-1}$ ; and if the indices of any other number in these two systems are $u$ , $u^{\prime}$  respectively, then $t u^{\prime} \equiv u$ , $t^{\prime} u \equiv u^{\prime}\pmod{p-1}$.

IV. While the numbers $1$, $1+i$ and their three associates (being too meager) are excluded from the moduli we consider, the remaining prime numbers are those which we referred to as the third and fourth species in article 34. The norms of the latter will be prime numbers of the form $4n+1$ ; the norms of the former will be the squares of real prime numbers: in both cases, therefore, $p-1$ will be divisible by $4$.

V. Denoting the index of the number $-1$ by $u$, we will have $2 u \equiv 0\pmod{p-1}$ , and therefore either $u \equiv 0$  or $u \equiv \frac{1}{2}(p-1)$ : but since the index $0$  corresponds to the residue $+1$ , the index of the number $-1$  must necessarily be $\frac{1}{2}(p-1)$.

VI. Likewise, denoting the index of the number $i$ by $u$, we will have $2 u \equiv \frac{1}{2}(p-1) \pmod{p-1}$ , and therefore either $u \equiv \frac{1}{4}(p-1)$  or $u \equiv \frac{3}{4}(p-1)$. But this ambiguity depends on our choice of a primitive root. Specifically, if the primitive root $h$ is taken as the base and the index of the number $i$  is $\frac{1}{4}(p-1)$, then the index will become $\frac{3}{4}(p-1)$  when $h^{\mu}$  is taken as the base, where $\mu$  denotes a positive integer of the form $4 n+3$  which is relatively prime to $p-1$ , e.g. the number $p-2$ , and vice versa. Therefore, with different choices of primitive root, the number $i$ will have the index $\frac{1}{4}(p-1)$  for one base, and the index $\frac{3}{4}(p-1)$  for the other, and for the latter base, $-i$  will clearly have the index $\frac{3}{4}(p-1)$, and for the former, it will have the index $\frac{1}{4}(p-1)$.

$\text{VII.}$ When the modulus is a positive real prime of the form $4 n+3$, say $=q$ , and thus $p=q q$ , the indices of all real numbers will be divisible by $q+1$ ; for denoting the index of the real number $k$  by $t$ , we will have, since $k^{q-1} \equiv 1\pmod{q}$ , $(q-1) t \equiv 0\pmod{q q-1}$ , and therefore $\frac{t}{q+1}$  will be an integer. Likewise, the indices of purely imaginary numbers like $ki$ will be divisible by $\frac{1}{2}(q+1)$. It is therefore clear that only mixed numbers can be primitive roots for such moduli.

$\text{VIII.}$ On the contrary, for a modulus $m$  which is a prime complex mixed number (whose norm $p$  is a prime real number of the form $4 n+1$ ), all primitive roots can be chosen from among the real numbers, among which a complete system of incongruent residues can be demonstrated (article 40). It is clear that any real number which is a primitive root for the complex modulus $m$ will at the same time be a primitive root modulo $p$  in the arithmetic of the real numbers, and vice versa.

56.
The theory of quadratic residues and non-residues in the arithmetic of complex numbers is contained within the theory of biquadratic residues, but before we discuss this, we will separately present its remarkable theorems here. For the sake of brevity, however, we will speak here only about the principal case, in which the modulus is a complex prime number (odd).

Let $m$ be such a modulus, and let $p$  be its norm. It is clear that any given integer (which is always understood to be indivisible by $m$ ) will either be congruent to a quadratic residue modulo $m$ or not, depending on whether its index, taken with respect to some primitive root as a base, is even or odd. In the former case, that integer is said to be a quadratic residue modulo $m$, and in the latter case, it is said to be a non-residue. It is concluded from this that among the $p-1$ numbers that constitute a complete system of incongruent residues (indivisible by $m$ ), half are quadratic residues and the other half are quadratic non-residues. For any other number outside this system, the same character is attributed to it as to the number which is congruent to it and belongs to the system.

It follows from this that the product of two quadratic residues, as well as the product of two quadratic non-residues, is a quadratic residue. On the other hand, the product of a quadratic residue with a quadratic non-residue results in a quadratic non-residue. Generally, the product of any number of factors is a quadratic residue or a non-residue, depending on whether the number of quadratic non-residues among the factors is even or odd.

The following general criterion for distinguishing quadratic residues from quadratic non-residues immediately presents itself:

A number $k$, which is not divisible by the modulus, is a quadratic residue or non-residue depending on whether $k^{\frac{1}{2}(p-1)} \equiv 1$ or $k^{\frac{1}{2}(p-1)} \equiv -1 \pmod{m}$.

The truth of this theorem immediately follows from the fact that, no matter which primitive root is taken for the base, the index of the power $k^{\frac{1}{2}(p-1)}$ will be either $\equiv 0$  or $\equiv \frac{1}{2}(p-1)$, depending on whether the index of the number $k$  is even or odd.

57.
It is indeed easy, given a modulus, to divide the system of incongruent residues into two classes, namely quadratic residues and non-residues, by which means at the same time all other numbers are automatically assigned to these classes. However, a much more profound inquiry is required to develop criteria that distinguish the moduli for which a given number is a quadratic residue from those for which it is a non-residue.

As regards the real units $+1$ and $-1$, these are actually squares in the arithmetic of complex numbers, and therefore they are also quadratic residues for any modulus. From the criterion in the preceding article, it follows equally easily that the number $i$ (and similarly $-i$ ) is a quadratic residue for any modulus whose norm is of the form $8n+1$, and a quadratic non-residue for any modulus whose norm is of the form $8n+5$. Since clearly it makes no difference whether the number $m$ or any of the associated numbers $im$, $-m$ , $-im$  is adopted as the modulus, it may be assumed, according to article 36, II, that the modulus is a primary associate, and hence by stipulating that the modulus $=a+bi$ , that $a$  is odd and $b$  is even. Thus, since it is always the case that $a a\equiv 1\pmod{8}$, and $b b$ is either $\equiv 0$  or $\equiv 4\pmod{8}$ , depending on whether $b$  is also even or is odd, it is clear that the numbers $+i$  and $-i$  are quadratic residues of the modulus in the former case, and non-residues in the latter.

58.
Since the character of a composite number (whether it is a quadratic residue or non-residue), depends on the characters of the factors, it will be sufficient to limit the development of criteria for distinguishing the moduli for which a given number $k$ is a quadratic residue or non-residue, to values of $k$  which are prime numbers, and moreover to those among them which are primary associates. In this investigation, induction immediately provides particularly elegant theorems.

Let us begin with the number $1+i$, which is found to be a quadratic residue modulo

$-1+2 i$, $+3-2 i$ , $-5-2 i$ , $-1-6 i$ , $+5+4 i$ , $+5-4 i$ , $-7$ , $+7+2 i$ , $-5+6 i$ , etc.

and a quadratic non-residue modulo

$-1-2 i$, $-3$ , $+3+2 i$ , $+1+4 i$ , $+1-4 i$ , $-5+2 i$ , $-1+6 i$ , $+7-2 i$ , $-5-6 i$ , $-3+8 i$ , $-3-8 i$ , $+5+8 i$ , $+5-8 i$ , $+9+4 i$ , $+9-4 i$ , etc.

If we carefully examine the above lists, in which we have always recorded the primary associate, we straightforwardly observe that the moduli $a+bi$ for which $a+b \equiv +1 \pmod{8}$  are all in the former class, and the moduli for which $a+b \equiv -3 \pmod{8}$  are all in the latter class. If we had chosen $-m$ as the modulus instead of the primary associate $m$, the criteria would need to be modified, so that moduli for which $a+b \equiv -1\pmod{8}$  would be in the former class, and moduli for which $a+b \equiv +3 \pmod{8}$  would be in the latter class. Therefore, if the induction has not failed, in general, denoting the primary number by $a+bi$, where $a$ is odd and $b$  is even, $1+i$  will be a quadratic residue or quadratic non-residue, depending on whether $a+b \equiv \pm 1$  or $\equiv \pm 3 \pmod{8}$.

The same rule applies to the number $-1-i$ as for the number $1+i$. Conversely, considering $1-i$ as the product of $-i$  and $1+i$, it is evident that the number $1-i$  has the same character as $1+i$  when $b$  is even, and the opposite character when $b$  is odd. Hence, it can be easily inferred that $1-i$ is a quadratic residue modulo the primary number $a+b i$  whenever $a-b \equiv \pm 1$, and it is a quadratic non-residue when $a-b \equiv \pm 3\pmod{8}$ , assuming as always that $a$  is odd and $b$  is even.

Moreover, this second proposition can also be deduced from the previous one, with the help of the following more general theorem, which we state as follows:

In the theory of quadratic residues, the characteristic of the number $\alpha+\beta i$ with respect to the modulus $a+b i$  is the same as that of the number $\alpha-\beta i$  with respect to the modulus $a-b i$.

The proof of this theorem is found in the fact that each modulus has the same norm $p$, and that as many times as $(\alpha+\beta i)^{\frac{1}{2}(p-1)}-1$ is divisible by $a+b i$ , $(\alpha-\beta i)^{\frac{1}{2}(p-1)}-1$  must also be divisible by $a-b i$ ; and as many times as $(\alpha+\beta i)^{\frac{1}{2}(p-1)}+1$  is divisible by $a+b i$ , $(\alpha-\beta i)^{\frac{1}{2}(p-1)}+1$  must also be divisible by $a-b i$.

59.
Let us proceed to odd prime numbers.

We find that the number $-1+2 i$ is a quadratic residue modulo $+3+2 i$, $+1-4 i$ , $-5+2 i$ , $-5-2 i$ , $-1-6 i$ , $+7-2 i$ , $-3+8 i$ , $+5+8 i$ , $+5-8 i$ , $+9+4 i$ , etc.

and it is a non-residue modulo $-1-2 i$, $-3$ , $+3-2 i$ , $+1+4 i$ , $-1+6 i$ , $+5+4 i$ , $+5-4 i$ , $-7$ , $+7+2 i$ , $-5+6 i$ , $-5-6 i$ , $-3-8 i$ , $+9-4 i$ , etc.

When we reduce the moduli of the former class to their absolutely minimal residues modulo $-1+2 i$, we obtain only $+1$ and $-1$. Namely, $+3+2 i \equiv -1$, $+1-4 i \equiv -1$ , $-5+2 i \equiv +1$ , $-5-2 i \equiv -1$ , etc.

On the other hand, all moduli of the latter class are found to be congruent to $+i$ or $-i$  with respect to the modulus $-1+2 i$.

Now, the numbers $+1$ and $-1$  are quadratic residues modulo $-1+2 i$, whereas $+i$  and $-i$  are non-residues. Hence, as far as induction is concerned, the theorem is as follows: The number $-1+2 i$ is a quadratic residue or non-residue modulo the prime number $a+b i$, depending on whether $a+bi$  is a quadratic residue or non-residue modulo $-1+2 i$ , provided that $a+b i$  is the primary number among its four associates, that is, if $a$  is odd and $b$  is even.

Furthermore, from this theorem, analogous theorems naturally follow concerning the numbers $+1-2 i$, $-1-2 i$ , $+1+2 i$.

60.
By performing a similar induction for the numbers $-3$ and $+3$, we find that each of them is a quadratic residue modulo $+3+2 i$ , $+3-2 i$ , $-1+6 i$ , $-1-6 i$ , $-7$ , $-5+6 i$ , $-5-6 i$ , $-3+8 i$ , $-3-8 i$ , $+9+4 i$ , $+9-4 i$  etc.

and each is a quadratic non-residue modulo $-1+2 i$, $-1-2 i$ , $+1+4 i$ , $+1-4 i$ , $-5+2 i$ , $-5-2 i$ , $+5+4 i$ , $+5-4 i$ , $+7+2 i$ , $+7-2 i$ , $+5+8 i$ , $+5-8 i$ etc.

The former are all congruent to one of the four numbers $+1$, $-1$ , $+i$ , $-i$ modulo $3$ ; whereas the latter are all congruent to one of $+1+i$ , $+1-i$ , $-1+i$ , $-1-i$. The former are precisely the quadratic residues modulo $3$, whereas the latter are the quadratic non-residues.

Therefore, this induction shows us that the primary number $a+b i$, assuming $a$ is odd and $b$  is even, has the same relation with the number $-3$  (and also with $+3$ ) as $-3$  does with $a+bi$ , with regard to whether each is a quadratic residue or non-residue modulo the other.

Extending a similar induction to other primary numbers, we find that this most elegant law of reciprocity is confirmed everywhere, and we are brought to the following fundamental theorem concerning quadratic residues in the arithmetic of complex numbers.

''Let $a+b i$, $A+B i$ be primary numbers, so that $a$ , $A$  are odd and $b$ , $B$  are even. Then either both of them are quadratic residues of the other, or both of them are quadratic non-residues of the other.''

Despite the great simplicity of the theorem, its proof is pressed by great difficulties, which, however, we do not dwell on here, since the theorem itself is only a special case of a more general theorem, which almost exhausts the theory of biquadratic residues. Let us now move on to this.

61.
The concepts expounded in article 2 of the previous treatise regarding biquadratic residues and nonresidues can be extended to the arithmetic of complex numbers, and similarly, here as there, our examination is limited to moduli that are prime numbers; furthermore, it will generally be understood tacitly that the modulus should be taken such that it is the primary number among its associates, namely $\equiv 1$ modulo $2+2i$, and also that the numbers whose character is in question (regarding whether they are biquadratic residues or non-residues), are not divisible by the modulus.

Thus, given a modulus, the numbers not divisible by it can be divided into three classes, with the first containing the biquadratic residues, the second containing the biquadratic non-residues which are quadratic residues, and the third containing the quadratic non-residues.

But here too it is better to establish two classes in place of the third, so that in total there are four.

Whichever primitive root is taken as the base, the biquadratic residues will have indices divisible by $4$, or of the form $4n$ ; the biquadratic non-residues which are quadratic residues will have indices of the form $4n+2$ ; finally, the indices of quadratic non-residues will be partly of the form $4n+1$ , and partly of the form $4n+3$. In this way, four classes indeed arise, but the distinction between the latter two classes are not absolute, and rather depend on the choice of primitive root; for it is easy to see that, given a quadratic non-residue, its index will have the form $4n+1$ for half of the primitive roots, and for the other half the index will be of the form $4n+3$. In order to remove this ambiguity, we will always suppose that a primitive root is adopted for which the index $\frac{1}{4}(p-1)$ corresponds to the number $+i$  (cf. article 55, VI). In this way, a classification arises, which we can describe more concisely in a way that does not involve primitive roots.

The first class contains the numbers $k$ for which $k^{\frac{1}{4}(p-1)} \equiv 1$ ; these numbers are the biquadratic residues.

The second class contains those for which $k^{\frac{1}{4}(p-1)} \equiv i$.

The third class contains those for which $k^{\frac{1}{4}(p-1)} \equiv-1$.

Lastly, the fourth class contains those for which $k^{\frac{1}{4}(p-1)} \equiv-i$.

The third class will include biquadratic non-residues which are quadratic residues; the quadratic non-residues will be distributed between the second and fourth.

We assign the respective numbers of these classes as biquadratic characters $0$, $1$ , $2$ , $3$. If the character $\lambda$ of the number $k$  modulo $m$  is defined to be the exponent of the power of $i$  to which the number $k^{\frac{1}{2}(p-1)}$  is congruent, then it is clear that characters which are equivalent modulo $4$  are to be considered equivalent. However, this notion is limited for the time being to moduli which are prime numbers: in the continuation of these discussions, we will show how it can also be adapted to composite moduli.

62.
To make it easier to construct a comprehensive induction for the characters of numbers, we attach a concise table here, by the help of which the character of any given number with respect to a modulus whose norm does not exceed the value 157 can be easily obtained, provided that attention is paid to the following observations.

Since the character of a composite number is equal (or rather, congruent modulo $4$ ) to the sum of the characters of its individual factors, it suffices to compute the characters of all prime numbers for the given modulus. Moreover, since the characters of the units $-1$, $i$ , $-i$ are clearly congruent to the numbers $\frac{1}{2}(p-1)$ , $\frac{1}{4}(p-1)$ , $\frac{3}{4}(p-1)$  modulo $4$ , it is also sufficient to have exhibited the characters of numbers which are primary among their associates. Furthermore, since numbers which are congruent modulo $m$ have the same character, it suffices to include in the table the characters of those numbers which are contained in the system of absolutely minimal residues modulo $m$. Finally, by reasoning similar to that of article 58, if the character of a number $A+B i$ is $\lambda$  for the modulus $a+b i$, and the character of the number $A-B i$  is $\lambda^{\prime}$  for the modulus $a-b i$ , then we always have $\lambda \equiv-\lambda^{\prime}\pmod{4}$ , or equivalently, $\lambda+\lambda^{\prime}$  is divisible by $4$. Therefore, it suffices to include moduli for which $b$ is either $0$  or positive in the table.

Thus if we seek e. g. the character of the number $11-6 i$ with respect to the modulus $-5-6 i$, we substitute $11+6 i$ , $-5+6 i$  for the given numbers; then we determine (article 43) the absolutely minimal residue of the number $11+6 i$  modulo $-5+6 i$ , which is $-1-4 i=-1 \times(1+4 i)$ ; therefore, since the character of $-1$  with respect to the modulus $-5+6 i$  is $30$ , and the character of the number $1+4 i$ , from the table, is 2, it follows that the character of the number $11+6 i$  with respect to the modulus $-5+6 i$  will be $32$  or $0$ , and consequently, by the final observation, the character of the number $11-6 i$  with respect to the modulus $-5-6 i$  will also be $0$. Similarly, if we seek the character of the number $-5+6 i$ with respect to the modulus $11+6 i$, its absolutely minimal residue $1-5 i$  is resolved into the factors $-i$ , $1+i$ , $3-2 i$ , which correspond to characters $117$ , $0$ , $1$ , whence the sought character will be $118$  or $2$ ; the number $-5-6 i$  will have the same character with respect to the modulus $11-6 i$. $$ \begin{array}{l|c|l} \text{Modulus.} & \text{Character.} & \text{Number.} \\ \hline -3 & 3 & \phantom{+}1+i \\ +3+2 i & 3 & \phantom{+}1+i \\ +1+4 i & 1 & -1+2 i \\ & 3 & \phantom{+}1+i \\ -5+2 i& 0 & -1-2 i \\ & 1 & \phantom{+}1+i \\ & 2 & -1+2 i \\ -1+6 i & 0 & -3 \\ &1&1+i, -1+2i \\ -1+6 i & 2 & -1-2 i \\ +5+4 i& 0 & \phantom{+}1+i \\ & 1 & -3 \\ & 3 & -1+2 i, -1-2 i \\ -7 & 0 & -3 \\ & 1 & -1+2 i, -3-2 i \\ & 2 & \phantom{+}1+i \\ & 3 & -1-2 i \\ +7+2 i & 0 & \phantom{+}1+i, 3+2 i,  3-2 i,  1-4 i \\ & 1 & -3 \\ & 2 & -1-2 i, 1+4 i \\ & 3 & -1+2 i \\ -5+6 i & 0 & \phantom{+}1+i, -3, 3+2 i, 3-2 i \\ & 1 & \phantom{+}1-4 i \\ & 2 & \phantom{+}1+4 i \\ & 3 & -1+2 i, -1-2 i \\ -3+8 i & 0 & -1+2 i, 3-2 i,  1-4 i \\ & 1 & \phantom{+}1+i, 3+2 i \\ & 2 & -3 \\ & 3 & -1-2 i, 1+4 i, -5+2 i \\ +5+8 i & 0 & -1-2 i \\ & 1 & -5-2 i, -1+6 i \\ & 2 & -1+2 i, 3-2 i \\ & 3 & \phantom{+}1+i, -3, 3+2 i, 1+4 i,  1-4 i \\ +9+4 i & 0 & -1+2 i, 3+2 i \\ & 1 & \phantom{+}1+i, -1-2 i, 3-2 i \\ & 2 & -3, 1+4 i \\ & 3 & \phantom{+}1-4 i, -5+2 i \\ -1+10 i & 0 & \phantom{+}1+i, -1+2 i, -1-2 i, 3+2 i \\ & 1 & -3 \\ & 2 & \phantom{+}3-2 i, -5+2 i, 5-4 i \\ & 3 & \phantom{+}1+4 i, 1-4 i \\ +3+10 i & 1 & \phantom{+}1+i, -1-2 i, 1-4 i \\ & 2 & -3, 3+2 i, 1+4 i, -5-2 i \\ & 3 & -1+2 i, 3-2 i \\ -7+8 i & 0 & \phantom{+}1+i, -7 \\ & 1 & \phantom{+}3+2 i, 3-2 i, 1-4 i, -5-2 i \\ & 2 & -1-2 i, 1+4 i, -5+2 i, -1-6 i \\ & 3 & -1+2 i, -3, -1+6 i \\ -11 & 0 & -3 \\ & 1 & \phantom{+}1+i, 3-2 i, 1+4 i, -5+2 i, 5+4 i \\ & 2 & -1+2 i, -1-2 i \\ & 3 & \phantom{+}3+2 i, 1-4 i, -5-2 i, 5-4 i \\ -11+4 i & 0 & \phantom{+}1+i, -1+2 i, 3+2 i, 5+4 i \\ & 1 & -1-2 i, -1+6 i \\ & 2 & -5+2 i \\ & 3 & -3, 3-2 i, 1+4 i, 1-4 i, -5-2 i \\ +7+10 i & 0 & \phantom{+}1+4 i, 1-4 i, -1+6 i, -1-6 i \\ & 1 & -1+2 i, 3+2 i, -5+2 i \\ & 2 & \phantom{+}1+i, 3-2 i \\ & 3 & -1-2 i, -3, -5-2 i \\ +11+6 i & 0 & \phantom{+}1+i, -1+2 i, -3, 1+4 i, 1-4 i, -7 \\ & 1 & -1-2 i, 3+2 i, 3-2 i \\ & 2 & -5-2 i, -1+6 i, -5-4 i \\ & 3 & -5+2 i, 5+4 i, 7-2 i \\ \end{array} $$

63.
We shall now endeavor to discover, by induction, common properties of moduli for which a given prime number has the same character. We always assume that the moduli are primary among their associates, meaning that they are of the form $a+b i$, where either $a \equiv 1$ , $b \equiv 0$ , or $a \equiv 3$ , $b \equiv 2\pmod{4}$.

With respect to the number $1+i$, from which we begin the induction, the law is more easily grasped if we separate the moduli of the former type (for which $a \equiv 1$ , $b \equiv 0$ ) from the moduli of the latter type (for which $a \equiv 3$ , $b \equiv 2$ ). With the help of the table in the previous article, we find the result

$$ \begin{array}{c|l} \text{character }&\text{ moduli of the first kind.} \\ \hline 0 & \phantom{+}5+4 i, -7+8 i, -7-8 i, -11+4 i \\ 1 & \phantom{+}1-4 i, -3+8 i, -3-8 i, 9+4i, -11 \\ 2 & \phantom{+}5-4 i, -7, -11-4 i \\ 3 & -3, 1+4 i, 5+8 i,  5-8 i,  9-4 i \\ \end{array} $$

If we consider these seventeen examples attentively, we find that for all of them the character is $\equiv \frac{1}{4}(a-b-1)\pmod{4}$.

Likewise, we have the result

$$ \begin{array}{c|l} \text{character} & \text{moduli of the second kind} \\ \hline 0 & \phantom{+}3-2 i, -1-6 i, 7+2 i, -5+6 i, -1+10 i,  11+6 i \\ 1 & -5+2 i, -1+6 i, 7-2 i, -1-10 i,  3+10 i \\ 2 & -1+2 i, -5-2 i, 3-10 i,  7+10 i \\ 3 & -1-2 i, 3+2 i, -5-6 i,  7-10 i,  11-6 i \\ \end{array} $$

In all of these twenty examples, with a little attention, we find that the character is $\equiv \frac{1}{4}(a-b-5)\pmod{4}$.

One can easily condense these two rules into one that can be applied to both types of moduli, by observing that $\frac{1}{4} b b$ is $\equiv 0\pmod{4}$  for moduli of the former type, and $\equiv 1\pmod{4}$  for moduli of the latter type. Thus the character of the number $1+i$ with respect to any prime modulus is $\equiv \frac{1}{4}(a-b-1-b b)\pmod{4}$.

It is convenient to note here, that since $(b+1)^{2}$ is always of the form $8 n+1$, or $\frac{1}{4}(2 b+b b)$  is even, this character will be even or odd, depending on whether $\frac{1}{4}(a+b-1)$  is even or odd, which accords with the rule for the quadratic character stated in article 58.

Since $\frac{1}{4}(a-b-1)$, $\frac{1}{4}(a-b+3)$ are integers, of which one is even and the other odd, their product will be even, so $\frac{1}{8}(a-b-1)(a-b+3) \equiv 0\pmod{4}$. Hence, in place of the above expression for the biquadratic character, the following can also be adopted

$$\frac{1}{4}(a-b-1-b b)-\frac{1}{8}(a-b-1)(a-b+3)=\frac{1}{8}(-a a+2 a b-3 b b+1)$$

This formula also recommends itself by the fact that it is not restricted to primary moduli, but only assumes that $a$ is odd and $b$  is even. It is clear that under this assumption, either $a+b i$ or $-a-b i$  will be primary among its associates, and the value of this formula will be the same for both moduli.

64.
Departing from the last rule extracted in the previous article, we find

$$ \begin{array}{c|l} \text{numbers} &\text{ character }\equiv \\ \hline -1+i & \frac{1}{8}(a a+2 a b-b b-1) \\ -1-i & \frac{1}{8}(-a a+2 a b+b b+1) \\ +1-i & \frac{1}{8}(a a+2 a b+3 b b-1) \\ \end{array} $$

This immediately implies that the character of $i$ is $\frac{1}{4}(a a+b b-1)$, and the character of $-1$  is$\frac{1}{2}(a a+b b-1) \equiv \frac{1}{2} b b$ , since $a a-1$  is always of the form $8n$. Clearly these four rules, even if they have so far been borrowed from induction, are so interconnected that as soon as the demonstration of one is complete, the other three are demonstrated simultaneously. There is scarcely any need to mention that in these rules we only assume $a$ to be odd and $b$  to be even.

If you do not mind using formulas restricted to primary moduli, we can use them in the following way. It is

$$ \begin{array}{c|l} \text{numbers} &\text{ character }\equiv \\ \hline -1+i & \frac{1}{4}(-a-b+1-b b) \\ -1-i & \frac{1}{4}(a-b-1+b b) \\ +1-i & \frac{1}{4}(-a-b+1+b b) \\ \end{array} $$

The simplest formulas emerge if, as we did at the beginning of our induction, we distinguish between moduli of the first and second kind. That is, the character is

$$ \begin{array}{c|c|c} \text{numbers} & \text{for moduli of the first kind} & \text{for moduli of the second kind} \\ \hline -1+i & \frac{1}{4}(-a-b+1) & \frac{1}{4}(-a-b-3) \\ -1-i & \frac{1}{4}(a-b-1) & \frac{1}{4}(a-b+3) \\ +1-i & \frac{1}{4}(-a-b+1) & \frac{1}{4}(-a-b+5) \\ \end{array} $$

65.
For the number $-1+2 i$, to which we now proceed, we will use the same distinction between moduli $a+b i$ for which $a \equiv 1$ , $b \equiv 0$ , and those for which $a \equiv 3$ , $b \equiv 2$. The table in article 62 shows that, with respect to this number, we have the result

$$ \begin{array}{c|l} \text{character} & \text{moduli of the first kind} \\ \hline 0 & -3+8 i, +5-8 i, +9+4 i, -11+4 i \\ 1 & +1+4 i, +5-4 i, -7, -3-8 i \\ 2 & +1-4 i, +5+8 i, -7-8 i, -11 \\ 3 & -3, +5+4 i, +9-4 i, -7+8 i, -11-4 i \\ \end{array} $$

Reducing each of these moduli to their absolutely minimal residues modulo $-1+2 i$, we observe that all those corresponding to character $0$ are congruent to $1$ ; those corresponding to character 1 are congruent to $i$ ; those with character 2 become congruent to $-1$ ; finally, all those with character 3 become congruent to $-i$. Now the characters of the numbers $1$, $i$ , $-1$ , $-i$ with respect to the modulus $-1+2 i$  are themselves $0$ , $1$ , $2$ , $3$  respectively, thus in each of these 17 examples the character of the number $-1+2 i$  with respect to the modulus of the first kind $a+b i$  is identical to the character of this number with respect to the modulus $-1+2 i$.

Likewise, from the table, we have the result

$$ \begin{array}{c|l} \text{character} & \text{moduli of the second kind} \\ \hline 0 & +3+2 i, -5-2 i, -1+10 i, -1-10 i, +11+6 i \\ 1 & +3-2 i, -1+6 i, -5-6 i, +7+10 i, +7-10 i \\ 2 & -5+2 i, -1-6 i, +7-2 i \\ 3 & -1-2 i, +7+2 i, -5+6 i, +3+10 i, +3-10 i, +11-6 i \\ \end{array} $$

Reducing these moduli to their minimal residues modulo $-1+2 i$, those corresponding to characters $0$ , $1$ , $2$ , $3$ are found to be congruent to the numbers $-1$ , $-i$ , $+1$ , $+i$  respectively; however, if $-1+2 i$  is adopted as the modulus, these same numbers corresponding to the characters $2$ , $3$ , $0$ , $1$  respectively. Therefore, in all these 19 examples, the character of $-1+2 i$ with respect to a modulus of the second kind differs by two units from the character of this number with respect to $-1+2 i$.

Moreover, it is easily understood that the situation will be completely similar with respect to the number $-1-2 i$.

66.
We omit the distinction between moduli of the first and second kind for the number $-3$, since experience shows that it is superfluous here. The result is thus

$$ \begin{array}{c|l} \text{characterem} & \text{modulis} \\ \hline 0 & -1+6 i, -1-6 i, -7, -5+6 i, -5-6 i, -11, 11+6 i, 11-6 i \\ 1 & -1-2 i, 1-4 i, -5+2 i,  5+4 i,  7+2 i,  5-8 i, -1+10 i, -7-8 i, -11-4 i,  7-10 i \\ 2 & 3+2 i, 3-2 i, -3+8 i, -3-8 i,  9+4 i,  3+10 i,  3-10 i \\ 3 & -1+2 i, 1+4 i, -5-2 i,  5-4 i,  7-2 i,  5+8 i, -1-10 i, -7+8 i, -11+4 i,  7+10 i \\ \end{array} $$

Reducing these moduli to their minimal residues modulo $3$, we see that those corresponding to the character $0$ become either $\equiv 1$  or $\equiv -1$ ; those with character $1$  become either $\equiv 1-i$  or $\equiv -1+i$ ; those with the character $2$  become either $\equiv i$  or $\equiv -i$ ; and finally, those with character $3$  become either $\equiv 1+i$  or $\equiv -1-i$. From this induction, we conclude that the character of the number $-3$ with respect to a prime modulus which is primary among its associates, is identical to the character of that number modulo $3$, or equivalently modulo $-3$.

67.
By carrying out a similar induction with respect to other prime numbers, we find that the numbers $3 \pm 2i$, $-1 \pm 6i$ , $7 \pm 2i$ , $-5 \pm 6i$ , etc. , are subject to theorems similar to those which we found in article 65 for the number $-1+2i$ ; on the other hand, the numbers $1 \pm 4i$, $5 \pm 4i$ , $-3 \pm 8i$ , $5 \pm 8i$ , $9 \pm 4i$ , etc. , behave just like the number $-3$. Therefore, induction leads to a most elegant theorem, which, following the theory of quadratic residues in the arithmetic of real numbers, may be called the Fundamental Theorem of the theory of biquadratic residues, namely:

''Let $a+bi$, $a^{\prime}+b^{\prime}i$ be distinct numbers which are primary among their associates, i. e. , which are congruent to unity modulo $2+2i$. Then the biquadratic character of the number $a+bi$ with respect to the modulus $a^{\prime}+b^{\prime}i$  will be identical with the character of the number $a^{\prime}+b^{\prime}i$  with respect to the modulus $a+bi$, if one or both of the numbers $a+bi$ , $a^{\prime}+b^{\prime}i$ , is of the first kind i. e. , is congruent to unity modulo $4$ : on the other hand, the characters will differ by two units if neither of the numbers $a+bi$, $a^{\prime}+b^{\prime}i$ is of the first kind, i. e. , if both are congruent to the number $3+2i$ modulo 4.''

Despite the simplicity of this theorem, its demonstration should be considered among the most hidden mysteries of the higher arithmetic, so that, at least for now, it can be unravelled only through the most subtle investigations, which would far exceed the limits of the present discussion. Therefore, we reserve the publication of this proof, as well as the development of the connection between this theorem and those which we began to establish by induction at the beginning of this discussion, for a third discussion. In the place of a conclusion, however, we will now present what is required for the proof of the theorems proposed in articles 63, 64.

68.
We begin with the prime numbers $a+b i$, for which $b=0$ (the third kind in article 34), where (so that the number will be primary among its associates) $a$  must be a negative real prime number of the form $-(4n+3)$ , for which we write $-q$ , such as $-3$ , $-7$ , $-11$ , $-19$  etc. Denoting by $\lambda$ the character of the number $1+i$  with respect to this modulus, we must have

$$i^{\lambda} \equiv (1+i)^{\frac{1}{4}(qq-1)} \equiv 2^{\frac{1}{8}(qq-1)} \cdot i^{\frac{1}{8}(qq-1)}\pmod{q}$$

But it is known that 2 is a quadratic residue or non-residue modulo $q$, depending on whether $q$ is of the form $8n+7$  or of the form $8n+3$ , from which we infer, in general,

$$2^{\frac{1}{2}(q-1)} \equiv (-1)^{\frac{1}{4}(q+1)} \equiv i^{\frac{1}{2}(q+1)}\pmod{q}$$

and raising this to the $\frac{1}{4}(q+1)^{th}$ power,

$$2^{\frac{1}{8}(qq-1)} \equiv i^{\frac{1}{8}(q+1)^{2}}\pmod{q}$$

Therefore, the preceding equation takes the form

$$i^{\lambda} \equiv i^{\frac{1}{8}(q+1)^{2}+\frac{1}{8}(qq-1)} \equiv i^{\frac{1}{4}(qq+q)}\pmod{q}$$

from which it follows that

$$\lambda \equiv \frac{1}{4}(qq+q) \equiv \frac{1}{4}(q+1)^{2}-\frac{1}{4}(q+1)\pmod{4}$$

or since we have $\frac{1}{4}(q+1)^{2} \equiv 0\pmod{4}$, $\lambda \equiv -\frac{1}{4}(q+1) \equiv \frac{1}{4}(a-1)\pmod{4}$. Which is the theorem of article 63, for the case $b=0$.

69.
Far more difficult are the moduli $a+b i$ for which $b$  is not equal to $0$  (numbers of the fourth kind in article 34), and various investigations need to be carried out before treating these cases. We will denote the norm $a a+b b$, which will be a prime number of the form $4n+1$ , by $p$.

Let $S$ be the complex of all simply minimal residues for the modulus $a+bi=m$, excluding $0$ , such that the multitude of numbers contained in $S$  is $=p-1$. Let $x+yi$ denote an indefinite number of this system, and suppose that $ax+by=\xi$, $ay-bx=\eta$. Then $\xi$, $\eta$ will be integers between the limits $0$  and $p$  exclusive: in the present case, where $a$ , $b$  are prime to one another, the formulas of article 45, namely $\eta \equiv k \xi$ , $\xi \equiv-k \eta\pmod{p}$ , show that neither of the numbers $\xi$ , $\eta$  can be $=0$  unless the other simultaneously vanishes, and thus $x=0$ , $y=0$ , a combination which we have already dismissed. Therefore, the criterion for the number $x+yi$ to be contained in $S$  is that the four numbers $\xi$, $\eta$ , $p-\xi$ , $p-\eta$  are positive.

Furthermore, we observe that for no such numbers can $\xi=\eta$ hold; for it would then follow that $p(x+y)=a(\xi+\eta)+b(\xi-\eta)=2a\xi$, which is absurd, as none of the factors $2$ , $a$ , $\xi$  is divisible by $p$. By similar reasoning, the equation $p(x-y+a+b)=2a\xi+(a+b)(p-\xi-\eta)$ shows that $\xi+\eta$  cannot be equal to $p$. Therefore, since the numbers $\xi-\eta$, $p-\xi-\eta$ must be either positive or negative, we can subdivide the system $S$  into four complexes $C$ , $C^{\prime}$ , $C^{\prime\prime}$ , $C^{\prime\prime\prime}$ , as follows:

$$ \begin{array}{c|c} \text{the complex} & \text{contains the numbers for which} \\ \hline C & \xi-\eta \text{ positivus, }p-\xi-\eta \text{ positivus }\\ C^{\prime} & \xi-\eta \text{ positivus, }p-\xi-\eta \text{ negativus } \\ C^{\prime \prime} & \xi-\eta \text{ negativus, }p-\xi-\eta \text{ negativus }\\ C^{\prime \prime \prime} & \xi-\eta \text{ negativus, }p-\xi-\eta \text{ positivus }\\ \end{array} $$

Therefore, the criterion for a number to be in the complex $C$ is properly sixfold, namely, six numbers $\xi$, $\eta$ , $p-\xi$ , $p-\eta$ , $\xi-\eta$ , $p-\xi-\eta$  must be positive; but clearly, conditions 2, 5, and 6 already imply the remaining ones. Similar considerations apply to the complexes $C^{\prime}$, $C^{\prime\prime}$ , $C^{\prime\prime\prime}$ , so that the complete criteria are threefold, namely,

$$ \begin{array}{c|lll} \text{for the complex} & \text{these numbers must be positive}  \\ \hline C & \eta, \xi-\eta, p-\xi-\eta \\ C^{\prime} & p-\xi, \xi-\eta, \xi+\eta-p   \\ C^{\prime \prime} & p-\eta, \eta-\xi, \xi+\eta-p   \\ C^{\prime \prime \prime} & \xi, \eta-\xi, p-\xi-\eta \\ \end{array} $$

Moreover, even without our guidance, anyone will easily understand that, in the graphical representation of complex numbers (see article 39), the numbers of the system $S$ are contained within a square, whose sides connect points representing the numbers $0$, $a+b i$ , $(1+i)(a+b i)$ , $i(a+b i)$ , and the subdivision of the system $S$  corresponds to the partition of the square by diagonal lines. However, we prefer to use purely arithmetic reasoning here, leaving the illustration through figurative intuition to the knowledgeable reader for the sake of brevity.

70.
If four complex numbers $r=x+yi$, $r^{\prime}=x^{\prime}+y^{\prime}i$ , $r^{\prime \prime}=x^{\prime \prime}+y^{\prime \prime}i$ , $r^{\prime \prime \prime}=x^{\prime \prime \prime}+y^{\prime \prime \prime}i$ are connected in such a way that $r^{\prime}=m+ir$ , $r^{\prime \prime}=m+ir^{\prime}$  $=(1+i)m-r$ , $r^{\prime \prime \prime}=m+ir^{\prime \prime}=im-ir$ , and it is assumed that $r$  belongs to the complex $C$ , then the remaining $r^{\prime}$ , $r^{\prime \prime}$ , $r^{\prime \prime \prime}$  respectively will belong to the complexes $C^{\prime}$ , $C^{\prime \prime}$ , $C^{\prime \prime \prime}$. For if we assume $\xi=ax+by$, $\eta=ay-bx$ , $\xi^{\prime}=ax^{\prime}+by^{\prime}$ , $\eta^{\prime}=ay^{\prime}-bx^{\prime}$ , $\xi^{\prime \prime}=ax^{\prime \prime}+by^{\prime \prime}$ , $\eta^{\prime \prime}=ay^{\prime \prime}-bx^{\prime \prime}$ , $\xi^{\prime \prime \prime}=ax^{\prime \prime \prime}+by^{\prime \prime \prime}$ , $\eta^{\prime \prime \prime}=ay^{\prime \prime \prime}-bx^{\prime \prime \prime}$ , we find

$$\begin{aligned} \eta=p-\xi^{\prime}&=p-\eta^{\prime \prime}=\xi^{\prime \prime \prime} \\ \xi-\eta=\xi^{\prime}+\eta^{\prime}-p&=\eta^{\prime \prime}-\xi^{\prime \prime}=p-\xi^{\prime \prime \prime}-\eta^{\prime \prime \prime} \\ p-\xi-\eta=\xi^{\prime}-\eta^{\prime}&=\xi^{\prime \prime}+\eta^{\prime \prime}-p=\eta^{\prime \prime \prime}-\xi^{\prime \prime \prime} \end{aligned}$$

and hence, with the help of the criteria above, the truth of the theorem follows automatically. Moreover, if $r=m+ir^{\prime \prime \prime}$, then it is easy to see that, if $r$ is assumed to belong to $C^{\prime}$ , then numbers $r^{\prime}$ , $r^{\prime \prime}$ , $r^{\prime \prime \prime}$  respectively belong to $C^{\prime \prime}$ , $C^{\prime \prime \prime}$ , $C$ ; if it belongs to $C^{\prime \prime}$ , then they belong to $C^{\prime \prime \prime}$ , $C$ , $C^{\prime}$ ; and finally, if it belongs to $C^{\prime \prime \prime}$ , then they belong to $C$ , $C^{\prime}$ , $C^{\prime \prime}$.

It follows that in each of the complexes $C$, $C^{\prime}$ , $C^{\prime \prime}$ , $C^{\prime \prime \prime}$ an equal multitude of numbers is found, namely $\frac{1}{4}(p-1)$.

71.
''Let $k$ be an integer not divisible by $m$. If each number in the complex $C$ is multiplied by $k$, and the simply minimal residues of the products modulo $m$  are distributed among the complexes $C$ , $C^{\prime}$ , $C^{\prime \prime}$ , $C^{\prime \prime \prime}$ , and the multitudes of each of these complexes are denoted by $c$ , $c^{\prime}$ , $c^{\prime \prime}$ , $c^{\prime \prime \prime}$  respectively, then the character of the number $k$  with respect to the modulus $m$  will be $\equiv c^{\prime}+2 c^{\prime \prime}+3 c^{\prime \prime \prime}\pmod{4}$ .''

Proof. Let $c$ be the number of minimal residues $\alpha$, $\beta$ , $\gamma$ , $\delta$ , etc. belonging to $C$ ; let $c^{\prime}$ be the number of minimal residues $m+i \alpha^{\prime}$, $m+i \beta^{\prime}$ , $m+i \gamma^{\prime}$ , $m+i \delta^{\prime}$ , etc. belonging to $C^{\prime}$ ; let $c^{\prime \prime}$ be the number of minimal residues $(1+i) m-\alpha^{\prime \prime}$, $(1+i) m-\beta^{\prime \prime}$ , $(1+i) m-\gamma^{\prime \prime}$ , $(1+i) m-\delta^{\prime \prime}$ , etc. belonging to $C^{\prime \prime}$ ; and finally, let $c^{\prime \prime \prime}$ be the number of minimal residues $i m-i \alpha^{\prime \prime \prime}$, $i m-i \beta^{\prime \prime \prime}$ , $i m-i \gamma^{\prime \prime \prime}$ , $i m-i \delta^{\prime \prime \prime}$ , etc. belonging to $C^{\prime \prime \prime}$. Now let us consider four products, namely


 * 1) the product of all $\frac{1}{4}(p-1)$  numbers from the complex $C$ ;
 * 2) the product of all numbers obtained from these upon multiplying them by $k$ ;
 * 3) the product of the minimal residues of these products, i . e ., of numbers $\alpha$ , $\beta$ , $\gamma$ , $\delta$ , etc . , $m+i \alpha^{\prime}$ , $m+i \beta^{\prime}$  etc . etc . ;
 * 4) the product of all $c+c^{\prime}+c^{\prime \prime}+c^{\prime \prime \prime}$  numbers $\alpha$, $\beta$ , $\gamma$ , $\delta$  etc . , $\alpha^{\prime}$ , $\beta^{\prime}$ , $\gamma^{\prime}$ , $\delta^{\prime}$  etc . , $\alpha^{\prime \prime}$ , $\beta^{\prime \prime}$ , $\gamma^{\prime \prime}$ , $\delta^{\prime \prime}$  etc . , $\alpha^{\prime \prime \prime}$ , $\beta^{\prime \prime \prime}$ , $\gamma^{\prime \prime \prime}$ , $\delta^{\prime \prime \prime}$  etc.

Denoting these four products $P$, $P^{\prime}$ , $P^{\prime \prime}$ , $P^{\prime \prime \prime}$ respectively, it is clear that

$$P^{\prime}=k^{\frac{1}{4}(p-1)} P, \quad P^{\prime} \equiv P^{\prime \prime}, \quad P^{\prime \prime} \equiv P^{\prime \prime \prime} i^{c^{\prime}+2 c^{\prime \prime}+3 c^{\prime \prime \prime}}\pmod{m}$$

and thus

$$P k^{\frac{1}{4}(p-1)} \equiv P^{\prime \prime \prime} i^{c^{\prime}+2 c^{\prime \prime}+3 c^{\prime \prime \prime}}\pmod{m}$$

But it is easy to see that the numbers $\alpha^{\prime}$, $\beta^{\prime}$ , $\gamma^{\prime}$ , $\delta^{\prime}$ , etc. , $\alpha^{\prime \prime}$, $\beta^{\prime \prime}$ , $\gamma^{\prime \prime}$ , $\delta^{\prime \prime}$ , etc. , $\alpha^{\prime \prime \prime}$, $\beta^{\prime \prime \prime}$ , $\gamma^{\prime \prime \prime}$ , $\delta^{\prime \prime \prime}$ , etc. all belong to complex $C$, and are distinct from each other and from the numbers $\alpha$ , $\beta$ , $\gamma$ , $\delta$ etc. , just as these very numbers are distinct from each other. Therefore, all these numbers taken together, and disregarding order, must be entirely identical with all of the numbers constituting $C$. From this we deduce that $P=P^{\prime \prime \prime}$, and therefore

$$P k^{\frac{1}{4}(p-1)} \equiv P i^{c^{\prime}+2 c^{\prime \prime}+3 c^{\prime \prime \prime}}\pmod{m}$$

Finally, since each factor of the product $P$ is not divisible by $m$, we may conclude

$$k^{\frac{1}{4}(p-1)} \equiv i^{c^{\prime}+2 c^{\prime \prime}+3 c^{\prime \prime \prime}}\pmod{m}$$

and thus $c^{\prime}+2 c^{\prime \prime}+3 c^{\prime \prime \prime}$ will be the character of the number $k$  with respect to the modulus $m$. Q. E. D.

72.
To apply the general theorem of the preceding article to the number $1+i$, it is necessary to subdivide the complex $C$ again into two smaller complexes $G$  and $G^{\prime}$. To the complex $G$ we will assign all numbers $x+yi$  such that $ax+by = \xi$  is less than $\frac{1}{2}p$, and to the complex $G^{\prime}$  we will assign those for which $\xi$  is greater than $\frac{1}{2}p$. We denote the multitude of numbers contained in the complexes $G$, $G^{\prime}$ respectively by $g$ , $g^{\prime}$ , so that $g+g^{\prime} = \frac{1}{4}(p-1)$.

The complete criterion for a number to belong to $G$ will therefore be that the three numbers $\eta$, $\xi-\eta$ , $p-2\xi$  are positive: indeed, the third condition for the complex $C$ , according to which $p-\xi-\eta$  must be positive, is implicitly contained in these, since $p-\xi-\eta = (\xi-\eta) + (p-2\xi)$. Similarly, the complete criterion for a number to belong to $G^{\prime}$ will consist in the positivity of the three numbers $\eta$, $p-\xi-\eta$ , $2\xi-p$.

Hence it is easily concluded that the product of any number from the complex $G$ with $1+i$  belongs to the complex $C^{\prime\prime\prime}$ ; for if we set

$$(x+yi)(1+i) = x^{\prime}+y^{\prime}i, \text{ and } ax^{\prime}+by^{\prime}=\xi^{\prime}, ay^{\prime}-bx^{\prime}=\eta^{\prime}$$

then we find

$$\xi^{\prime} = \xi-\eta, \eta^{\prime}-\xi^{\prime}=2\eta, p-\xi^{\prime}-\eta^{\prime}=p-2\xi$$

i. e. the criterion for the number $x+yi$ to be belong the complex $G$  is identical to the criterion for the number $x^{\prime}+y^{\prime}i$  to belong to the complex $C^{\prime\prime\prime}$.

It can be shown in a completely similar way that the product of any number from the complex $G^{\prime}$ with $1+i$  belongs to the complex $C^{\prime\prime}$.

Therefore, if in the preceding article we assign the value $1+i$ to $k$, we will have $c=0$ , $c^{\prime}=0$ , $c^{\prime\prime}=g^{\prime}$ , $c^{\prime\prime\prime}=g$ , and therefore for the character of the number $1+i$  we will have $3g+2g^{\prime} = \frac{1}{2}(p-1)+g$. And whereas the characters of the numbers $i$, $-1$ , are $\frac{1}{4}(p-1)$ , $\frac{1}{2}(p-1)$ , the characters of the numbers $-1+i$ , $-1-i$ , $1-i$ respectively will be $\frac{3}{4}(p-1)+g$ , $g$ , $\frac{1}{4}(p-1)+g$. Therefore, the whole essence of the matter now turns on the investigation of the number $g$.

73.
What we have explained in articles 69-72 is completely independent of the assumption that $m$ is a primary number: from now on, however, we will at least assume that $a$  is odd and $b$  is even, and further that $a$, $b$ , and $a-b$  are positive numbers. First of all, it is necessary to establish the limits of the values of $x$ in the complex $G$.

Setting $a y-b x=\eta$, $(a+b) x-(a-b) y=\zeta$ , $p-2 a x-2 b y=\theta$ , the criterion for a number $x+yi$ to belong to the complex $G$  consists of three conditions, that $\eta$ , $\zeta$ , and $\theta$  are positive numbers. Since $p x=(a-b) \eta+a \zeta$, $p(a-2 x)=a \theta+2 b \eta$ , it is clear that $x$ and $2a-x$  must be positive numbers, i. e. , $x$ should be equal to one of the numbers $1$, $2$ , $3\ldots \frac{1}{2}(a-1)$. Furthermore, since $(a-b) \theta=2 b \zeta+p(a-b-2 x)$, it is evident that as long as $x$ is less than $\frac{1}{2}(a-b)$ , the second condition (that $\zeta$  must be positive) already implies the third condition (that $\theta$  must be positive); conversely, whenever $x$  is greater than $\frac{1}{2}(a-b)$ , the second condition is already contained in the third condition. Therefore, if $x$ is equal to one of the values $1$, $2$ , $3\ldots \frac{1}{2}(a-b-1)$ , it is only necessary to require that $\eta$  and $\zeta$  are positive, i. e. , that $y$ is greater than $\frac{b x}{a}$  and less than $\frac{(a+b) x}{a-b}$. Therefore, for a given value of $x$, there will be

$$\left[\frac{(a+b) x}{a-b}\right]-\left[\frac{b x}{a}\right]$$

values of $x+yi$, if we use brackets in the same sense that we have already used them elsewhere (compare Theorematis arithm. dem. nova art. 4 and Theorematis fund . in doctr. de residuis quadr. etc . Algorithm. nov. art. 3). On the other hand, for the values of $x$ being $\frac{1}{2}(a-b+1)$, $\frac{1}{2}(a-b+3)\ldots \frac{1}{2}(a-1)$ , it will suffice to reconcile the positive values of $\eta$  and $\theta$ , i. e. , that $y$ is greater than $\frac{b x}{a}$  and less than $\frac{p-2 a x}{2 b}$  or $\frac{1}{2} b+\frac{a a-2 a x}{2 b}$. Therefore, for such a given value of $x$, the numbers $x+yi$ will be present

$$\left[\frac{1}{2} b+\frac{a a-2 a x}{2 b}\right]-\left[\frac{b x}{a}\right]$$

Hence, we conclude that the multitude of numbers in the complex $G$ is

$$g=\Sigma\left[\frac{(a+b) x}{a-b}\right]+\Sigma\left[\frac{1}{2} b+\frac{a a-2 a x}{2 b}\right]-\Sigma\left[\frac{b x}{a}\right]$$

where, in the first term, the summation should extend over all integral values of $x$ from $1$  to $\frac{1}{2}(a-b-1)$, in the second from $\frac{1}{2}(a-b+1)$  to $\frac{1}{2}(a-1)$ , and in the third from $1$  to $\frac{1}{2}(a-1)$.

If we use the symbol $\varphi$ in the same sense as in loc. cit. (cf. Theorematis fund .  etc . Algor. nov. art. 3), so that

$$\varphi(t, u)=\left[\frac{u}{t}\right]+\left[\frac{2 u}{t}\right]+\left[\frac{3 u}{t}\right] \ldots+\left[\frac{t^{\prime} u}{t}\right]$$

where $t$, $u$ denote arbitrary positive numbers, and $t^{\prime}$  is the number $\left[\frac{1}{2} t\right]$ , then the first term is $=\varphi(a-b, a+b)$ , the third $=-\varphi(a, b)$ ; but the second is

$$=\frac{1}{4} b b+\Sigma\left[\frac{a a-2 a x}{2 b}\right]$$

However, by writing the terms in reverse order, we have

$$\Sigma\left[\frac{a a-2 a x}{2 b}\right]=\left[\frac{a}{2 b}\right]+\left[\frac{3 a}{2 b}\right]+\left[\frac{5 a}{2 b}\right]+\ldots+\left[\frac{(b-1) a}{2 b}\right]=\varphi(2 b, a)-\varphi(b, a)$$

Therefore, our formula takes the following form:

$$g=\varphi(a-b, a+b)+\varphi(2 b . a)-\varphi(a, b)-\varphi(b, a)+\frac{1}{4} b b$$

Let us consider the first term $\varphi(a-b, a+b)$, which is immediately transformed into $\varphi(a-b, 2 b)+1+2+3+\text{etc.}+\frac{1}{2}(a-b-1)$ or into

$$\varphi(a-b, 2 b)+\frac{1}{8}((a-b)^{2}-1)$$

Then, since by the general theorem we have $\varphi(t, u)+\varphi(u, t)=\left[\frac{1}{2} t\right] \cdot\left[\frac{1}{2} u\right]$ when $t, u$  are positive relatively prime integers, we have

$$\varphi(a-b, 2 b)=\frac{1}{2} b(a-b-1)-\varphi(2 b, a-b)$$

and thus

$$\varphi(a-b, a+b)=\frac{1}{8}(a a+2 a b-3 b b-4 b-1)-\varphi(2 b, a-b)$$

Let us arrange the parts of $\varphi(2 b, a-b)$ in the following manner

$$\begin{aligned} & {\left[\frac{a-b}{2 b}\right]+\left[\frac{3(a-b)}{2 b}\right]+\left[\frac{5(a-b)}{2 b}\right]+\text{etc.}+\left[\frac{(b-1)(a-b)}{2 b}\right] } \\ + & {\left[\frac{a-b}{b}\right]+\left[\frac{2(a-b)}{b}\right]+\left[\frac{3(a-b)}{b}\right]+\text{etc.}+\left[\frac{\frac{1}{2} b(a-b)}{b}\right] } \end{aligned}$$

The second series is evidently

$$=\varphi(b, a-b)=\varphi(b, a)-1-2-3-\text{etc.}-\frac{1}{2} b=\varphi(b, a)-\frac{1}{8}(b b+2b)d$$

We represent the first series in reverse order of terms as follows:

$$\left[\frac{1}{2}(a+1-b)-\frac{a}{2 b}\right]+\left[\frac{1}{2}(a+3-b)-\frac{3a}{2 b}\right]+\left[\frac{1}{2}(a+5-b)-\frac{5a}{2b}\right]+\text{etc.}+\left[\frac{1}{2}(a-1)-\frac{(b-1)a}{2b}\right]$$

This expression, where $t$ denotes an integer and $u$  denotes a fraction, is transformed, since we generally have $[t-u]=t-1-[u]$, into the following

$$\begin{aligned} & \frac{1}{8}b(2a-4-b)-\left[\frac{a}{2b}\right]-\left[\frac{3a}{2b}\right]-\left[\frac{5a}{2b}\right]-\text{etc.}-\left[\frac{(b-1)a}{2b}\right] \\ = & \frac{1}{8}b(2a-4-b)-\varphi(2b,a)+\varphi(b,a) \end{aligned}$$

Hence,

$$\varphi(2 b, a-b)=2 \varphi(b, a)-\varphi(2 b, a)+\frac{1}{4} b(a-3-b)$$

and therefore,

$$\varphi(a-b, a+b)=\varphi(2 b, a)-2 \varphi(b, a)+\frac{1}{8}(a a-b b+2 b-1)$$

Substituting this value into the formula for $g$ given above, and also using the fact that $\varphi(a, b)+\varphi(b, a)=\frac{1}{4} b(a-1)$ , we obtain

$$g=2 \varphi(2 b, a)-2 \varphi(b, a)+\frac{1}{8}(a a-2 a b+b b+4 b-1)$$

74.
The case where $a$, $b$ remain positive and $a-b$  is negative or $b-a$  is positive can be completely resolved by very similar reasoning. The equations $p(a-2x) = 2b\eta + a\theta$, $p(b-a+2x) = 2b\zeta + (b-a)\theta$ show that $\frac{1}{2}a-x$  and $x+\frac{1}{2}(b-a)$  are positive, and so $x$  must be equal to one of the numbers $-\frac{1}{2}(b-a-1)$ , $-\frac{1}{2}(b-a-3)$ , $-\frac{1}{2}(b-a-5) \ldots +\frac{1}{2}(a-1)$. Furthermore, from the equation $px+(b-a)\eta = a\zeta$, it follows that for negative values of $x$ , the condition for $\eta$ to be positive, is already contained in the condition for $\zeta$  to be positive, but the contrary happens whenever a positive value is assigned to $x$. Hence, the values of $y$ for a given negative value of $x$  must lie between $\frac{(a+b)x}{a-b}$  and $\frac{p-2ax}{2b}$, while for a positive value of $x$ , they must lie between $\frac{bx}{a}$  and $\frac{p-2ax}{2b}$. For $x=0$ it is clear that these limits are $0$  and $\frac{p-2ax}{2b}$, with the value $y=0$  being excluded. Thus, we deduce

$$g = -\Sigma\left[\frac{(a+b)x}{a-b}\right]+\Sigma\left[\frac{1}{2}b + \frac{a a-2ax}{2b}\right]-\Sigma\left[\frac{bx}{a}\right]$$

where in the first term, the summation extends over all negative values of $x$ from $-1$  down to $-\frac{1}{2}(b-a-1)$ ; in the second term, over all values of $x$  from $a-\frac{1}{2}(b-a-1)$  up to $\frac{1}{2}(a-1)$ ; and in the third, over all positive values of $x$  from $1$  up to $\frac{1}{2}(a-1)$. Thus, the first summation becomes $-\varphi(b-a, b+a)$, the second becomes $\frac{1}{4}b b + \varphi(2b, a) - \varphi(b, a)$ as in the preceding article, and finally the third becomes $-\varphi(a, b)$ , giving us

$$g = -\varphi(b-a, b+a) + \varphi(2b, a) - \varphi(b, a) - \varphi(a, b) + \frac{1}{4}b b$$

In a similar manner as in the previous article, we find

$$\begin{aligned} \varphi(b-a, b+a) & = \varphi(b-a, 2b) - \frac{1}{8}\left((b-a)^2-1\right) \\ & = \frac{1}{8}\left(3b b - 2ab - a a - 4b + 1\right) - \varphi(2b, b-a) \end{aligned}$$

and also

$$\varphi(2b, b-a)=\varphi(2b, a)-2\varphi(b, a)+\frac{1}{4}b(b-1-a)$$

thus

$$\varphi(b-a, b+a) = 2\varphi(b, a) - \varphi(2b, a) + \frac{1}{8}\left(b b - a a - 2b + 1\right)$$

and finally

$$g = 2\varphi(2b, a) - 2\varphi(b, a) + \frac{1}{8}\left(a a - 2ab + b b + 4b - 1\right)$$

It has therefore been shown that the same formula holds for $g$, whether $a-b$ is positive or negative, provided that $a$ , $b$  are positive.

75.
In order to obtain further a reduction, we set

$$\begin{aligned} & L=\left[\frac{a}{2 b}\right]+\left[\frac{2 a}{2 b}\right]+\left[\frac{3 a}{2 b}\right]+\text{etc.}+\left[\frac{\frac{1}{2} b a}{2 b}\right] \\ & M=\left[\frac{(\frac{1}{2} b+1) a}{2 b}\right]+\left[\frac{(\frac{1}{2} b+2) a}{2 b}\right]+\left[\frac{(\frac{1}{2} b+3) a}{2 b}\right]+\text{etc.}+\left[\frac{b a}{2 b}\right] \\ & N=\left[\frac{a+b}{2 b}\right]+\left[\frac{2 a+b}{2 b}\right]+\left[\frac{3 a+b}{2 b}\right]+\text{etc.}+\left[\frac{\frac{1}{2} b a+b}{2 b}\right] \end{aligned}$$

Since it is easily seen that in general, $[u]+\left[u+\frac{1}{2}\right]=[2 u]$, for any arbitrary real quantity $u$ , we have $L+N=\varphi(b, a)$ , and since it is clear that $L+M=\varphi(2 b, a)$ , we obtain

$$\varphi(2 b, a)-\varphi(b, a)=M-N$$

Moreover, it is obvious that the sum of the first term of the series $N$ with the penultimate term of the series $M$, for example $\left[\frac{a+b}{2 b}\right]+\left[\frac{(b-1) a}{2 b}\right]$  becomes $=\frac{1}{2}(a-1)$ , and the same sum is produced by the second term of the series $N$  with the antepenultimate series $M$ , and so on. Therefore, since the ultimate term of the series $M$ also becomes $=\frac{1}{2}(a-1)$, and the ultimate term of the series $N$  will be $=\left[\frac{a+2}{4}\right]=\frac{1}{4}(a \mp 1)$ , with the upper or lower sign depending on whether $a$  is of the form $4 n+1$  or $4 n-1$. Thus we have

$$M+N=\frac{1}{4}(a-1) b+\frac{1}{4}(a \mp 1)$$

and therefore

$$\varphi(2 b, a)-\varphi(b, a)=\frac{1}{4}(a-1) b+\frac{1}{4}(a \mp 1)-2 N$$

Setting $a \mp 1=4 n$, where $n$ is an integer, the formula for $g$  found in articles 73 and 74 becomes

$$g=\frac{1}{8}((a+b)^{2}-1)+2 n-4 N$$

But since we have $1=16 n n-8 a n+a a$ here, this formula can also be expressed in the following way:

$$g=\frac{1}{8}(-a a+2 a b+b b+1)+4(\frac{1}{2}(a+1) n-n n-N)$$

Therefore, since $g$ is the character of the number $-1-i$  modulo $a+b i$, this character becomes $\equiv \frac{1}{8}(-a a+2 a b+b b+1)\pmod{4}$ , which is the theorem obtained above by induction (article 64), and hence the theorems concerning the characters of the numbers $1+i$ , $1-i$ , $-1+i$  naturally follow. Therefore, these four theorems, for the case where $a$ and $b$  are positive, are now rigorously demonstrated.

76.
If $a$ remains positive and $b$  is negative, let $b=-b^{\prime}$, so that $b^{\prime}$  is positive. Since it has already been proved that the character of the number $-1-i$ modulo $a+b^{\prime} i$  is $\equiv \frac{1}{8}(-a a+2 a b^{\prime}+b^{\prime} b^{\prime}+1)\pmod{4}$, by the theorem in article 62 the character of the number $-1+i$  for the modulus $a-b^{\prime} i$  will be $\equiv \frac{1}{8}(a a-2 a b^{\prime}-b^{\prime} b^{\prime}-1)$ , that is, the character of the number $-1+i$  for the modulus $a+b i$  becomes $\equiv \frac{1}{8}(a a+2 a b-b b-1)$ : but this is the same theorem as that mentioned in article 64, from which the three remaining characters $1+i$ , $1-i$ , $-1-i$  are automatically determined. Therefore, these theorems have also been proved for the case where $b$ is negative, and thus for all cases where $a$  is positive.

Finally, if $a$ is negative, let $a=-a^{\prime}, b=-b^{\prime}$. Then, by what has already been proved, the character of the number $1+i$ with respect to the modulus $a^{\prime}+b^{\prime} i$  is $\equiv \frac{1}{8}(-a^{\prime} a^{\prime}+2 a^{\prime} b^{\prime}-3 b^{\prime} b^{\prime}+1)\pmod{4}$, and it makes no difference as to whether we have the number $a^{\prime}+b^{\prime} i$  or its opposite $-a^{\prime}-b^{\prime} i$  in place of the modulus; it is clear that the character of the number $1+i$  with respect to the modulus $a+b i$  is $\equiv \frac{1}{8}(-a a+2 a b-3 b b+1)$ , and the same is valid for the characters of the numbers $1-i$ , $-1+i$ , $-1-i$.

From all this, it is clear that the demonstration of the theorems concerning the characters of the numbers $1+i$, $1-i$ , $-1+i$ , $-1-i$ (arts. 63. 64) is no longer subject to any limitation.