From Wikisource

[index]

Jump to: navigation, search

On the expression of a number in the form $a x 2 + b y 2 + c z 2 + d u 2$
by Srinivasa Ramanujan

Information about this edition

Published in the Proceedings of the Cambridge Philosophical Society 19 (1917–1920), 11–21

[ page ]

On the expression of a number in the form $a x 2 + b y 2 + c z 2 + d u 2$

By S. Ramanujan, B.A., Trinity College. (Communicated by Mr G. H. Hardy.)

[Received 10 September 1916; read October 30, 1916.]

1.

It is well known that all positive integers can be expressed as the sum of four squares. This naturally suggests the question: For what positive integral values of $a$ , $b$ , $c$ , $d$ can all positive integers be expressed in the form

a x 2 + b y 2 + c z 2 + d u 2

?

(1·1)

I prove in this paper that there are only $55$ sets of values of $a$ , $b$ , $c$ , $d$ for which this is true.

The more general problem of finding all sets of values of $a$ , $b$ , $c$ , $d$ for which all integers with a finite number of exceptions can be expressed in the form (1·1), is much more difficult and interesting. I have considered only very special cases of this problem, with two variables instead of four; namely the cases in which (1·1) has one of the special forms

a (x 2 + y 2 + z 2) + b u 2

(1·2),

and

a (x 2 + y 2) + b (z 2 + u 2)

(1·3).

These two cases are comparatively easy to discuss. In this paper I give the discussion of (1·2) only, reserving that of (1·3) for another paper.

2.

Let us begin with the first problem. We can suppose, without loss of generality, that

$a\leq b\leq c\leq d$

(2·1).

If  $a > 1$ , then  $1$  cannot be expressed in the form (1·1); and so

a = 1

(2·2).

If  $b > 2$ , then  $2$  is an exception; and so

$1\leq b\leq 2$

(2·3).

We have therefore only to consider the two cases in which (1·1) has one or other of the forms

$x^2+y^2+cz^2+du^2,\qquad x^2+2y^2+cz^2+du^2.$

In the first case, if $c > 3$ , then $3$ is an exception; and so

$1\leq c\leq 3$

(2·31).

In the second case, if  $c > 5$ , then  $5$  is an exception; and so

$2\leq c\leq 5$

(2·32).

We can now distinguish $7$ possible cases.

(2·41) $x 2 + y 2 + z 2 + d u 2$

If $d > 7$ , $7$ is an exception; and so

$1\leq d\leq 7$

(2·411).

(2·42) $x 2 + y 2 + 2 z 2 + d u 2$

[ page ] If $d > 14$ , $14$ is an exception; and so

$2\leq d\leq 14$

(2·421).

(2·43) $x 2 + y 2 + 3 z 2 + d u 2$

If $d > 6$ , $6$ is an exception; and so

$3\leq d\leq 6$

(2·431).

(2·44) $x 2 + 2 y 2 + 2 z 2 + d u 2$

If $d > 7$ , $7$ is an exception; and so

$2\leq d\leq 7$

(2·441).

(2·45) $x 2 + 2 y 2 + 3 z 2 + d u 2$

If $d > 10$ , $10$ is an exception; and so

$3\leq d\leq 10$

(2·451).

(2·46) $x 2 + 2 y 2 + 4 z 2 + d u 2$

If $d > 14$ , $14$ is an exception; and so

$4\leq d\leq 14$

(2·461).

(2·47) $x 2 + 2 y 2 + 5 z 2 + d u 2$

If $d > 10$ , $10$ is an exception; and so

$5\leq d\leq 10$

(2·471).

We have thus eliminated all possible sets of values of $a$ , $b$ , $c$ , $d$ , except the following 55:

1,	1,	1,	1	1,	2,	3,	5	1,	2,	4,	8
1,	1,	1,	2	1,	2,	4,	5	1,	2,	5,	8
1,	1,	2,	2	1,	2,	5,	5	1,	1,	2,	9
1,	2,	2,	2	1,	1,	1,	6	1,	2,	3,	9
1,	1,	1,	3	1,	1,	2,	6	1,	2,	4,	9
1,	1,	2,	3	1,	2,	2,	6	1,	2,	5,	9
1,	2,	2,	3	1,	1,	3,	6	1,	1,	2,	10
1,	1,	3,	3	1,	2,	3,	6	1,	2,	3,	10
1,	2,	3,	3	1,	2,	4,	6	1,	2,	4,	10
1,	1,	1,	4	1,	2,	5,	6	1,	2,	5,	10
1,	1,	2,	4	1,	1,	1,	7	1,	1,	2,	11
1,	2,	2,	4	1,	1,	2,	7	1,	2,	4,	11
1,	1,	3,	4	1,	2,	2,	7	1,	1,	2,	12
1,	2,	3,	4	1,	2,	3,	7	1,	2,	4,	12
1,	2,	4,	4	1,	2,	4,	7	1,	1,	2,	13
1,	1,	1,	5	1,	2,	5,	7	1,	2,	4,	13
1,	1,	2,	5	1,	1,	2,	8	1,	1,	2,	14
1,	2,	2,	5	1,	2,	3,	8	1,	2,	4,	14
1,	1,	3,	5

[ page ]Of these 55 forms, the 12 forms

1,	1,	1,	2	1,	1,	2,	4	1,	2,	4,	8
1,	1,	2,	2	1,	2,	2,	4	1,	1,	3,	3
1,	2,	2,	2	1,	2,	4,	4	1,	2,	3,	6
1,	1,	1,	4	1,	1,	2,	8	1,	2,	5,	10

have been already considered by Liouville and Pepin^[1].

3.

I shall now prove that all integers can be expressed in each of the 55 forms. In order to prove this we shall consider the seven cases (2·41)—(2·47) of the previous section separately. We shall require the following results concerning ternary quadratic arithmetical forms.

The necessary and sufficient condition that a number cannot be expressed in the form

x 2 + y 2 + z 2

(3·1)

is that it should be of the form

$4^\lambda(8\mu+7),\quad(\lambda=0,1,2\ \ldots,\mu=0,1,2,\ldots)$

(3·11).

Similarly the necessary and sufficient conditions that a number cannot be expressed in the forms

$x^2+\ y^2+2z^2$

(3·2),

$x^2+\ y^2+3z^2$

(3·3),

x 2 + 2 y 2 + 2 z 2

(3·4),

x 2 + 2 y 2 + 3 z 2

(3·5),

x 2 + 2 y 2 + 4 z 2

(3·6),

x 2 + 2 y 2 + 5 z 2

(3·7),

are that it should be of the forms

4 λ (16μ + 14)

(3·21),

$9^\lambda(\ 9\mu+\ 6)$

(3·31),

$4^\lambda(\ 8\mu+\ 7)$

(3·41),

4 λ (16μ + 10)

(3·51),

4 λ (16μ + 14)

(3·61),

25 λ (25μ + 10)

or

25 λ (25μ + 15)

^[2]

(3·71).

[ page ]The result concerning $x 2 + y 2 + z 2$ is due to Cauchy: for a proof see Landau, Handbuch der Lehre von der Verteilung der Primzahlen, p. 550. The other results can be proven in an analogous manner. The form $x 2 + y 2 + 2 z 2$ has been considered by Lebesgue, and the form $x 2 + y 2 + 3 z 2$ by Dirichlet. For references see Bachmann, Zahlentheorie, vol. iv, p. 149.

4.

We proceed to consider the seven cases (2·41)—(2·47). In the first case we have to show that any number $N$ can be expressed in the form

N = x 2 + y 2 + z 2 + d u 2

(4·1),

 $d$  being any integer between  $1$  and  $7$  inclusive.

If $N$ is not of the form $4 λ (8μ + 7)$ , we can satisfy (4·1) with $u = 0$ . We may therefore suppose that $N = 4 λ (8μ + 7)$ .

First, suppose that $d$ has one of the values $1$ , $2$ , $4$ , $5$ , $6$ . Take $u = 2 λ$ . Then the number

N - d u 2 = 4 λ (8μ + 7 - d)

is plainly not of the form  $4 λ (8μ + 7)$ , and is therefore expressible in the form  $x 2 + y 2 + z 2$ .

Next, let $d = 3$ . If $μ = 0$ , take $u = 2 λ$ . Then

N - d u 2 = 4 λ + 1

.

[ page ]If $\mu\geq 1$ , take $u = 2 λ + 1$ . Then

N - d u 2 = 4 λ (8μ - 5)

.

In neither of these cases is  $N - d u 2$  of the form  $4 λ (8μ + 7)$ , and therefore in either case it can be expressed in the form  $x 2 + y 2 + z 2$ .

Finally, let $d = 7$ . If $μ$ is equal to $0$ , $1$ , or $2$ , take $u = 2 λ$ . Then $N - d u 2$ is equal to $0$ , $2.4 λ + 1$ , or $4 λ + 2$ . If $\mu\geq 3$ , take $u = 2 λ + 1$ . Then

N - d u 2 = 4 λ (8μ - 21)

.

Therefore in either case  $N - d u 2$  can be expressed in the form  $x 2 + y 2 + z 2$ .

Thus in all cases $N$ is expressible in the form (4·1). Similarly we can dispose of the remaining cases, with the help of the results stated in § 3. Thus in discussing (2·42) we use the theorem that every number not of the form (3·21) can be expressed in the form (3·2). The proofs differ only in detail, and it is not worth while to state them at length.

5.

We have seen that all integers without any exception can be expressed in the form

m (x 2 + y 2 + z 2) + n u 2

(5·1),

when

$m=1,\quad 1\leq n\leq 7$ ,

and

$m=1,\quad n=1$ .

We shall now consider the values of $m$ and $n$ for which all integers with a finite number of exceptions can be expressed in the form (5·1).

In the first place $m$ must be $1$ or $2$ . For, if $m > 2$ , we can choose an integer $ν$ so that

$nu^2\not\equiv\nu\pmod{m}$

for all values of  $u$ . Then

$\frac{(m\mu+\nu)-nu^2}{m}$ ,

where  $μ$  is any positive integer, is not an integer; and so  $m μ + ν$  can certainly not be expressed in the from (5·1).

We have therefore only to consider the two cases in which $m$ is $1$ or $2$ . First let us consider the form

x 2 + y 2 + z 2 + n u 2

(5·2).

I shall show that, when $n$ has any of the values

1,4,9,17,25,36,68,100

(5·21),

[ page ]or is of any of the forms

$4k+2,\quad 4k+3,\quad 8k+5,\quad 16k+12,\quad 32k+20\quad$

(5·22),

then all integers save a finite number, and in fact all integers from  $4 n$  onwards at any rate, can be expressed in the form (5·2); but that for the remaining values of  $n$  there is an infinity of integers which cannot be expressed in the form required.

In proving the first result we need obviously only consider numbers of the form $4 λ (8μ + 7)$ greater than $n$ , since otherwise we may take $u = 0$ . The numbers of this form less than $n$ are plainly among the exceptions.

6.

I shall consider the various cases which may arise in order of simplicity.

(6·1) $n\equiv 0\pmod{8}$ .

There are an infinity of exceptions. For suppose that

N = 8μ + 7

.

Then the number

$N-nu^2\equiv 7\pmod{8}$

cannot be expressed in the form  $x 2 + y 2 + z 2$ .

(6·2) $n\equiv 2\pmod{4}$ .

There is only a finite number of exceptions. In proving this we may suppose that $N = 4 λ (8μ + 7)$ . Take $u = 1$ . Then the number

N - n u 2 = 4 λ (8μ + 7) - n

is congruent to  $1$ ,  $2$ ,  $5$ , or  $6$  to modulus  $8$ , and so can be expressed in the form  $x 2 + y 2 + z 2$ .

Hence the only numbers which cannot be expressed in the form (5·2) in this case are the numbers of the form $4 λ (8μ + 7)$ not exceeding $n$ .

(6·3) $n\equiv 5\pmod{8}$ .

There is only a finite number of exceptions. We may suppose again that $N = 4 λ (8μ + 7)$ . First, let $\lambda\neq 1$ . Take $u = 1$ . Then

$N-nu^2=4^\lambda(8\mu+7)-n\equiv 2\ \mathit{or}\ 3\pmod{8}$ .

If  $λ = 1$  we cannot take  $u = 1$ , since

$N-n\equiv 7\pmod{8}$ ;

so we take  $u = 2$ . Then

$N-nu^2=4^\lambda(8\mu+7)-4n\equiv 8\pmod{32}$ .

In either of these cases  $N - n u 2$  is of the form  $x 2 + y 2 + z 2$ .

Hence the only numbers which cannot be expressed in the form (5·2) are those of the form

4 λ (8μ + 7)

not exceeding

n

, and those of the form

4(8μ + 7)

lying between

n

and

4 n

.[ page ]

(6·4) $n\equiv 3\pmod{4}$ .

There is only a finite number of exceptions. Take

N = 4 λ (8μ + 7)

.

If , take  $u = 1$ . Then

$N-nu^2\equiv 1\ \mathit{or}\ 5\pmod{8}$ .

If  $λ = 0$ , take  $u = 2$ . Then

$N-nu^2\equiv 3\pmod{8}$ .

In either case the proof is completed as before.

In order to determine precisely which are the exceptional numbers, we must consider more particularly the numbers between $n$ and $4 n$ for which $λ = 0$ . For these $u$ must be $1$ , and

$N-nu^2\equiv 0\pmod{4}$ .

But the numbers which are multiples of  $4$  and which cannot be expressed in the form  $x 2 + y 2 + z 2$  are the numbers

$4^\kappa(8\nu+7),\quad(\kappa=1,2,3,\ldots,\,\nu=0,1,2,3,\ldots)$ .

The exceptions required are therefore those of the numbers

n + 4 κ (8ν + 7)

(6·41)

which lie between  $n$  and  $4 n$  and are of the form

8μ + 7

(6·42).

Now in order that (6·41) may be of the form (6·42), $κ$ must be $1$ if $n$ is of the form $8 k + 3$ and $κ$ may have any of the values $2,3,4,\ldots$ if $n$ is of the form $8 k + 7$ . Thus the only numbers which cannot be expressed in the form (5·2), in this case, are those of the form $4 λ (8μ + 7)$ less than $n$ and those of the form

$n+4^\kappa(8\nu+7),\quad(\nu=0,1,2,3,\ldots)$ ,

lying between  $n$  and  $4 n$ , where  $κ = 1$  if  $n$  is of the form  $8 k + 3$ , and  $κ > 1$  if  $n$  is of the form  $8 k + 7$ .

(6·5) $n\equiv 1\pmod{8}$ .

In this case we have to prove that

(i) if $n\geq 33$ , there is an infinity of integers which cannot be expressed in the form (5·2);

(ii) if $n$ is $1$ , $9$ , $17$ , or $25$ , there is only a finite number of exceptions.

In order to prove (i) suppose that $N = 7.4 λ$ . Then obviously $u$ cannot be zero. But if $u$ is not zero $u 2$ is always of the form $4 κ (8ν + 1)$ . Hence

N - n u 2 = 7.4 λ - n .4 κ (8ν + 1)

.

Since ,  $λ$  must be greater than or equal to  $κ + 2$ , to ensure that the right-hand side shall not be negative. Hence

N - n u 2 = 4 κ (8 k + 7)

,

[ page ]

where

$k=14.4^{\lambda-\kappa-2}-n\nu-\frac{1}{8}(n+7)$

is an integer; and so

N - n u 2

is not of the form

x 2 + y 2 + z 2

.

In order to prove (ii) we may suppose, as usual, that

N = 4 λ (8μ + 7)

.

If  $λ = 0$ , take  $u = 1$ . Then

$N-nu^2=8\mu+7-n\equiv 6\pmod{8}$ .

If , take  $u = 2 λ - 1$ . Then

	$N - n u 2 = 4 λ - 1 (8 k + 3)$ ,
where	$k=4(\mu+1)-\frac{1}{8}(n+7)$ .

In either case the proof may be completed as before. Thus the only numbers which cannot be expressed in the form (5·2), in this case, are those of the form

8μ + 7

not exceeding

n

. In other words, there is no exception when

n = 1

;

7

is the only exception when

n = 9

;

7

and

15

are the only exceptions when

n = 17

;

7

,

15

and

23

are the only exceptions when

n = 25

.

(6·6) $n\equiv 4\pmod{32}$ .

By arguments similar to those used in (6·5), we can show that

(i) if $n\geq 132$ , there is an infinity of integers which cannot be expressed in the form (5·2);

(ii) if $n$ is equal to $4$ , $36$ , $68$ , or $100$ , there is only a finite number of exceptions, namely the numbers of the form $4 λ (8μ + 7)$ not exceeding $n$ .

(6·7) $n\equiv 20\pmod{32}$ .

By arguments similar to those used in (6·3), we can show that the only numbers which cannot be expressed in the form (5·2) are those of the form $4 λ (8μ + 7)$ not exceeding $n$ , and those of the form $42 (8μ + 7)$ lying between $n$ and $4 n$ .

(6·8) $n\equiv 12\pmod{16}$ .

By arguments similar to those used in (6·4), we can show that the only numbers which cannot be expressed in the form (5·2) are those of the form $4 λ (8μ + 7)$ less than $n$ , and those of the form

$n+4^\kappa(8\mu+7),\quad(\nu=0,1,2,3,\ldots)$ ,

lying between  $n$  and  $4 n$ , where  $κ = 2$  if  $n$  is of the form  $4(8 k + 3)$  and  $κ > 2$  if  $n$  is of the form  $4(8 k + 7)$ .

We have thus completed the discussion of the form (5·2), and determined the exceptional values of $N$ precisely whenever they are in finite number.

7.

We shall proceed to consider the form

2(x 2 + y 2 + z 2) + n u 2

(7·1).

[ page ]In the first place, $n$ must be odd; otherwise the odd numbers cannot be expressed in this form. Suppose then that $n$ is odd. I shall show that all integers save a finite number can be expressed in the form (7·1); and that the numbers which cannot be so expressed are

(i) the odd numbers less than $n$ ,

(ii) the numbers of the form $4 λ (16μ + 14)$ less than $4 n$ ,

(iii) the numbers of the form $n + 4 λ (16μ + 14)$ greater than $n$ and less than $9 n$ ,

(iv) the numbers of the form

$cn+4^\kappa(16\nu+14),\quad(\nu=0,1,2,3,\ldots)$ ,

greater than  $9 n$  and less than  $25 n$ , where  $c = 1$  if ,  $c = 9$  if ,  $κ = 2$  if , and  $κ > 2$  if .

First, let us suppose $N$ even. Then, since $n$ is odd and $N$ is even, it is clear that $u$ must be even. Suppose then that

$u=2v,\quad N=2M$ .

We have to show that  $M$  can be expressed in the form

x 2 + y 2 + z 2 + 2 n v 2

(7·2).

Since , it follows from (6·2) that all integers except those which are less than  $2 n$  and of the form  $4 λ (8μ + 7)$  can be expressed in the form (7·2). Hence the only even integers which cannot be expressed in the form (7·1) are those of the form  $4 λ (16μ + 14)$  less than  $4 n$ .

This completes the discussion of the case in which $N$ is even. If $N$ is odd the discussion is more difficult. In the first place, all odd numbers less than $n$ are plainly among the exceptions. Secondly, since $n$ and $N$ are both odd, $u$ must also be odd. We can therefore suppose that

$N=n+2M,\quad u^2=1+8\Delta$ ,

where  $Δ$  is an integer of the form , so that  $Δ$  may assume the values . And we have to consider whether  $n + 2 M$  can be expressed in the form

2(x 2 + y 2 + z 2) + n (1 + 8Δ)

,

or  $M$  in the form

x 2 + y 2 + z 2 + 4 n Δ

(7·3).

If $M$ is not of the form $4 λ (8μ + 7)$ , we can take $Δ = 0$ . If it is of this form, and less than $4 n$ , it is plainly an exception. These numbers give rise to the exceptions specified in (iii) of section 7. We may therefore suppose that $M$ is of the form $4 λ (8μ + 7)$ and greater than $4 n$ .[ page ]

8.

In order to complete the discussion, we must consider the three cases in which $n\equiv 1\pmod{8}$ , $n\equiv 5\pmod{8}$ , and $n\equiv 3\pmod{4}$ separately.

(8·1) $n\equiv 1\pmod{8}$ .

If $λ$ is equal to $0$ , $1$ , or $2$ , take $Δ = 1$ . Then

M - 4 n Δ = 4 λ (8μ + 7) - 4 n

is one of the forms

$8\nu+3,\quad 4(8\nu+3),\quad 4(8\nu+6)$ .

If $\lambda\geq 3$ we cannot take $Δ = 1$ , since $M - 4 n Δ$ assumes the form $4(8ν + 7)$ ; so we take $Δ = 3$ . Then

M - 4 n Δ = 4 λ (8ν + 7) - 12 n

is of the form  $4(8ν + 5)$ . In either of these cases  $M - 4 n Δ$  is of the form  $x 2 + y 2 + z 2$ . Hence the only values of  $M$ , other than those already specified, which cannot be expressed in the form (7·3), are those of the form

$4^\kappa(8\nu+7),\quad(\nu=0,1,2,\ldots,\kappa>2)$ ,

lying between  $4 n$  and  $12 n$ . In other words, the only numbers greater than  $9 n$  which cannot be expressed in the form (7·1), in this case, are the numbers of the form

$n+4^\kappa(8\nu+7),\quad(\nu=0,1,2,\ldots,\kappa>2)$ ,

lying between  $9 n$  and  $25 n$ .

(8·2) $n\equiv 5\pmod{8}$ .

If $\lambda\neq 2$ , take $Δ = 1$ . Then

M - 4 n Δ = 4 λ (8μ + 7) - 4 n

is one of the forms

$8\nu+3,\quad 4(8\nu+2),\quad 4(8\nu+3)$ .

If $λ = 2$ , we cannot take $Δ = 1$ , since $M - 4 n Δ$ assumes the form $4(8ν + 7)$ ; so we take $Δ = 3$ . Then

M - 4 n Δ = 4 λ (8μ + 7) - 12 n

is of the form

4(8ν + 5)

. In either of these cases

M - 4 n Δ

is of the form

x 2 + y 2 + z 2

. Hence the only values of

M

, other than those already specified, which cannot be expressed in the form (7·3), are those of the form

16(8μ + 7)

lying between

4 n

and

12 n

. In other words, the only numbers greater than

9 n

which cannot be expressed in the form (7·1), in this case, are the numbers of the form

n + 4 2 (16μ + 14)

lying between

9 n

and

25 n

.[ page ]

(8·3) $n\equiv 3\pmod{4}$ .

If $\lambda\neq 1$ , take $Δ = 1$ . Then

M - 4 n Δ = 4 λ (8μ + 7) - 4 n

is one of the forms

$8\nu+3,\quad 4(4\nu+1)$ .

If  $λ = 1$ , take  $Δ = 3$ . Then

M - 4 n Δ = 4(8μ + 7) - 12 n

is of the form  $4(4ν + 2)$ . In either of these cases  $M - 4 n Δ$  is of the form  $x 2 + y 2 + z 2$ .

This completes the proof that there is only a finite number of exceptions. In order to determine what they are in this case, we have to consider the values of $M$ , between $4 n$ and $12 n$ , for which $Δ = 1$ and

$M-4n\Delta=4(8\mu+7-n)\equiv 0\pmod{16}$ .

But the numbers which are multiples of  $16$  and which cannot be expressed in the form  $x 2 + y 2 + z 2$  are the numbers

$4^\kappa(8\nu+7),\quad(\kappa=2,3,4,\ldots,\,\nu=0,1,2,\ldots)$ .

The exceptional values of $M$ required are therefore those of the numbers

4 n + 4 κ (8ν + 7)

(8·31)

which lie between  $4 n$  and  $12 n$  and are of the form

4(8μ + 7)

(8·32).

But in order that (8·31) may be of the form (8·32),  $κ$  must be  $2$  if  $n$  is of the form  $8 k + 3$ , and  $κ$  may have any of the values  if  $n$  is of the form  $8 k + 7$ . It follows that the only numbers greater than  $9 n$  which cannot be expressed in the form (7·1), in this case, are the numbers of the form

$9n+4^\kappa(16\nu+14),\quad(\nu=0,1,2,\ldots)$ ,

lying between  $9 n$  and  $25 n$ , where  $κ = 2$  if  $n$  is of the form  $8 k + 3$ , and  $κ > 2$  if  $n$  is of the form  $8 k + 7$ .

This completes the proof of the results stated in section 7.

↑ There are a large number of short notes by Liouville in vols. v–viii of the second series of his journal. See also Pepin, ibid., ser. 4, vol vi, pp. 1–67. The object of the work of Liouville and Pepin is rather different from mine, viz. to determine, in a number of special cases, explicit formulae for the number of representations, in terms of other arithmetical functions.
↑ Results (3·11)—(3·71) may tempt us to suppose that there are similar simple results for the form ax² + by² + cz², whatever are the values of a, b, c. It appears, however, that in most cases there are no such simple results. For instance, the numbers which are not of the form x² + 2y² + 10z² are those belonging to one or other of the four classes $25^\lambda(8\mu+7),\quad 25^\lambda(25\mu+5),\quad 25^\lambda(25\mu+15),\quad 25^\lambda(25\mu+20).$ Here some of the numbers of the first class belong also to one of the next three classes. Again, the even numbers which are not of the form x² + y² + 10z² are the numbers

$4 λ (16μ + 6)$ ,
```
while the odd numbers that are not of that form, viz.  do not seem to obey any simple law.
```
I have succeeded in finding a law in the following six simple cases:

$\begin{array}{rcrcr}x^2&+&y^2&+&4z^2,\\ x^2&+&y^2&+&5z^2,\\ x^2&+&y^2&+&6z^2,\\ x^2&+&y^2&+&8z^2,\\ x^2&+&2y^2&+&6z^2,\\ x^2&+&2y^2&+&8z^2.\end{array}$
```
The numbers which are not of these forms are the numbers
```
$4 λ (8μ + 7)$ or $(8μ + 3)$ ,
$4 λ (8μ + 3)$ ,
$9 λ (9μ + 3)$ ,
$4 λ (16μ + 14)$ , $(16μ + 6)$ , or $(4μ + 3)$ ,
$4 λ (8μ + 5)$ ,
$4 λ (8μ + 7)$ or $(8μ + 5)$ .

This work is in the public domain in the United States because it was published before January 1, 1923.

The author died in 1920, so this work is also in the public domain in countries and areas where the copyright term is the author's life plus 80 years or less. This work may also be in the public domain in countries and areas with longer native copyright terms that apply the rule of the shorter term to foreign works.

[0] There are a large number of short notes by Liouville in vols. v–viii of the second series of his journal. See also Pepin, ibid., ser. 4, vol vi, pp. 1–67. The object of the work of Liouville and Pepin is rather different from mine, viz. to determine, in a number of special cases, explicit formulae for the number of representations, in terms of other arithmetical functions.

[1] Results (3·11)—(3·71) may tempt us to suppose that there are similar simple results for the form $a x 2 + b y 2 + c z 2$ , whatever are the values of $a$ , $b$ , $c$ . It appears, however, that in most cases there are no such simple results. For instance, the numbers which are not of the form $x 2 + 2 y 2 + 10 z 2$ are those belonging to one or other of the four classes $25^\lambda(8\mu+7),\quad 25^\lambda(25\mu+5),\quad 25^\lambda(25\mu+15),\quad 25^\lambda(25\mu+20).$ Here some of the numbers of the first class belong also to one of the next three classes. Again, the even numbers which are not of the form $x 2 + y 2 + 10 z 2$ are the numbers

$4 λ (16μ + 6)$ ,

while the odd numbers that are not of that form, viz. $3, 7, 21, 31, 33, 43, 67, 79, 87, 133, 217, 219, 223, 253, 307, 391, \ldots$ do not seem to obey any simple law.

I have succeeded in finding a law in the following six simple cases:

$\begin{array}{rcrcr}x^2&+&y^2&+&4z^2,\\ x^2&+&y^2&+&5z^2,\\ x^2&+&y^2&+&6z^2,\\ x^2&+&y^2&+&8z^2,\\ x^2&+&2y^2&+&6z^2,\\ x^2&+&2y^2&+&8z^2.\end{array}$

The numbers which are not of these forms are the numbers

$4 λ (8μ + 7)$ or $(8μ + 3)$ ,

$4 λ (8μ + 3)$ ,

$9 λ (9μ + 3)$ ,

$4 λ (16μ + 14)$ , $(16μ + 6)$ , or $(4μ + 3)$ ,

$4 λ (8μ + 5)$ ,

$4 λ (8μ + 7)$ or $(8μ + 5)$ .

[1]

[2]

On the expression of a number in the form 𝑎𝑥²+𝑏𝑦²+𝑐𝑧²+𝑑𝑢²

From Wikisource

On the expression of a number in the form $a x 2 + b y 2 + c z 2 + d u 2$

1.

2.

(2·41) $x 2 + y 2 + z 2 + d u 2$

(2·42) $x 2 + y 2 + 2 z 2 + d u 2$

(2·43) $x 2 + y 2 + 3 z 2 + d u 2$

(2·44) $x 2 + 2 y 2 + 2 z 2 + d u 2$

(2·45) $x 2 + 2 y 2 + 3 z 2 + d u 2$

(2·46) $x 2 + 2 y 2 + 4 z 2 + d u 2$

(2·47) $x 2 + 2 y 2 + 5 z 2 + d u 2$

3.

4.

5.

6.

(6·1) $n\equiv 0\pmod{8}$ .

(6·2) $n\equiv 2\pmod{4}$ .

(6·3) $n\equiv 5\pmod{8}$ .

(6·4) $n\equiv 3\pmod{4}$ .

(6·5) $n\equiv 1\pmod{8}$ .

(6·6) $n\equiv 4\pmod{32}$ .

(6·7) $n\equiv 20\pmod{32}$ .

(6·8) $n\equiv 12\pmod{16}$ .

7.

8.

(8·1) $n\equiv 1\pmod{8}$ .

(8·2) $n\equiv 5\pmod{8}$ .

(8·3) $n\equiv 3\pmod{4}$ .

Views

Personal tools

Search

Navigation

Toolbox

Print/export

1,	1,	1,	1	1,	2,	3,	5	1,	2,	4,	8
1,	1,	1,	2	1,	2,	4,	5	1,	2,	5,	8
1,	1,	2,	2	1,	2,	5,	5	1,	1,	2,	9
1,	2,	2,	2	1,	1,	1,	6	1,	2,	3,	9
1,	1,	1,	3	1,	1,	2,	6	1,	2,	4,	9
1,	1,	2,	3	1,	2,	2,	6	1,	2,	5,	9
1,	2,	2,	3	1,	1,	3,	6	1,	1,	2,	10
1,	1,	3,	3	1,	2,	3,	6	1,	2,	3,	10
1,	2,	3,	3	1,	2,	4,	6	1,	2,	4,	10
1,	1,	1,	4	1,	2,	5,	6	1,	2,	5,	10
1,	1,	2,	4	1,	1,	1,	7	1,	1,	2,	11
1,	2,	2,	4	1,	1,	2,	7	1,	2,	4,	11
1,	1,	3,	4	1,	2,	2,	7	1,	1,	2,	12
1,	2,	3,	4	1,	2,	3,	7	1,	2,	4,	12
1,	2,	4,	4	1,	2,	4,	7	1,	1,	2,	13
1,	1,	1,	5	1,	2,	5,	7	1,	2,	4,	13
1,	1,	2,	5	1,	1,	2,	8	1,	1,	2,	14
1,	2,	2,	5	1,	2,	3,	8	1,	2,	4,	14
1,	1,	3,	5

1,	1,	1,	2	1,	1,	2,	4	1,	2,	4,	8
1,	1,	2,	2	1,	2,	2,	4	1,	1,	3,	3
1,	2,	2,	2	1,	2,	4,	4	1,	2,	3,	6
1,	1,	1,	4	1,	1,	2,	8	1,	2,	5,	10

1,	1,	1,	1	1,	2,	3,	5	1,	2,	4,	8
1,	1,	1,	2	1,	2,	4,	5	1,	2,	5,	8
1,	1,	2,	2	1,	2,	5,	5	1,	1,	2,	9
1,	2,	2,	2	1,	1,	1,	6	1,	2,	3,	9
1,	1,	1,	3	1,	1,	2,	6	1,	2,	4,	9
1,	1,	2,	3	1,	2,	2,	6	1,	2,	5,	9
1,	2,	2,	3	1,	1,	3,	6	1,	1,	2,	10
1,	1,	3,	3	1,	2,	3,	6	1,	2,	3,	10
1,	2,	3,	3	1,	2,	4,	6	1,	2,	4,	10
1,	1,	1,	4	1,	2,	5,	6	1,	2,	5,	10
1,	1,	2,	4	1,	1,	1,	7	1,	1,	2,	11
1,	2,	2,	4	1,	1,	2,	7	1,	2,	4,	11
1,	1,	3,	4	1,	2,	2,	7	1,	1,	2,	12
1,	2,	3,	4	1,	2,	3,	7	1,	2,	4,	12
1,	2,	4,	4	1,	2,	4,	7	1,	1,	2,	13
1,	1,	1,	5	1,	2,	5,	7	1,	2,	4,	13
1,	1,	2,	5	1,	1,	2,	8	1,	1,	2,	14
1,	2,	2,	5	1,	2,	3,	8	1,	2,	4,	14
1,	1,	3,	5

1,	1,	1,	2	1,	1,	2,	4	1,	2,	4,	8
1,	1,	2,	2	1,	2,	2,	4	1,	1,	3,	3
1,	2,	2,	2	1,	2,	4,	4	1,	2,	3,	6
1,	1,	1,	4	1,	1,	2,	8	1,	2,	5,	10

On the expression of a number in the form 𝑎𝑥²+𝑏𝑦²+𝑐𝑧²+𝑑𝑢²

From Wikisource

On the expression of a number in the form ax2 + by2 + cz2 + du2

1.

2.

(2·41) x2 + y2 + z2 + du2

(2·42) x2 + y2 + 2z2 + du2

(2·43) x2 + y2 + 3z2 + du2

(2·44) x2 + 2y2 + 2z2 + du2

(2·45) x2 + 2y2 + 3z2 + du2

(2·46) x2 + 2y2 + 4z2 + du2

(2·47) x2 + 2y2 + 5z2 + du2

3.

4.

5.

6.

(6·1) .

(6·2) .

(6·3) .

(6·4) .

(6·5) .

(6·6) .

(6·7) .

(6·8) .

7.

8.

(8·1) .

(8·2) .

(8·3) .

Views

Personal tools

Search

Navigation

Toolbox

Print/export

On the expression of a number in the form $a x 2 + b y 2 + c z 2 + d u 2$

(2·41) $x 2 + y 2 + z 2 + d u 2$

(2·42) $x 2 + y 2 + 2 z 2 + d u 2$

(2·43) $x 2 + y 2 + 3 z 2 + d u 2$

(2·44) $x 2 + 2 y 2 + 2 z 2 + d u 2$

(2·45) $x 2 + 2 y 2 + 3 z 2 + d u 2$

(2·46) $x 2 + 2 y 2 + 4 z 2 + d u 2$

(2·47) $x 2 + 2 y 2 + 5 z 2 + d u 2$

(6·1) $n\equiv 0\pmod{8}$ .

(6·2) $n\equiv 2\pmod{4}$ .

(6·3) $n\equiv 5\pmod{8}$ .

(6·4) $n\equiv 3\pmod{4}$ .

(6·5) $n\equiv 1\pmod{8}$ .

(6·6) $n\equiv 4\pmod{32}$ .

(6·7) $n\equiv 20\pmod{32}$ .

(6·8) $n\equiv 12\pmod{16}$ .

(8·1) $n\equiv 1\pmod{8}$ .

(8·2) $n\equiv 5\pmod{8}$ .

(8·3) $n\equiv 3\pmod{4}$ .

1,	1,	1,	1	1,	2,	3,	5	1,	2,	4,	8
1,	1,	1,	2	1,	2,	4,	5	1,	2,	5,	8
1,	1,	2,	2	1,	2,	5,	5	1,	1,	2,	9
1,	2,	2,	2	1,	1,	1,	6	1,	2,	3,	9
1,	1,	1,	3	1,	1,	2,	6	1,	2,	4,	9
1,	1,	2,	3	1,	2,	2,	6	1,	2,	5,	9
1,	2,	2,	3	1,	1,	3,	6	1,	1,	2,	10
1,	1,	3,	3	1,	2,	3,	6	1,	2,	3,	10
1,	2,	3,	3	1,	2,	4,	6	1,	2,	4,	10
1,	1,	1,	4	1,	2,	5,	6	1,	2,	5,	10
1,	1,	2,	4	1,	1,	1,	7	1,	1,	2,	11
1,	2,	2,	4	1,	1,	2,	7	1,	2,	4,	11
1,	1,	3,	4	1,	2,	2,	7	1,	1,	2,	12
1,	2,	3,	4	1,	2,	3,	7	1,	2,	4,	12
1,	2,	4,	4	1,	2,	4,	7	1,	1,	2,	13
1,	1,	1,	5	1,	2,	5,	7	1,	2,	4,	13
1,	1,	2,	5	1,	1,	2,	8	1,	1,	2,	14
1,	2,	2,	5	1,	2,	3,	8	1,	2,	4,	14
1,	1,	3,	5

1,	1,	1,	2	1,	1,	2,	4	1,	2,	4,	8
1,	1,	2,	2	1,	2,	2,	4	1,	1,	3,	3
1,	2,	2,	2	1,	2,	4,	4	1,	2,	3,	6
1,	1,	1,	4	1,	1,	2,	8	1,	2,	5,	10