Now let f'=(a', b', c') be any definite form 'with a' positive and determinant - A. The root of a'z2j-b'z-4-c' =0 which is represented by a point in the positive half-plane is

and this is a reduced point if either

w= A1

(i.) b' <a'<c;

(u.) b' =a', a'<c

(iii.) a' =c', 0<b'§ a'.

Cases (ii.) and (iii.) oply occur when the representative point on Cfhe bounda of V. A orm whose representative point is re uce is said to rliie a reduced form. It follows from the geometrical theory that every form is equivalent to a reduced form, and that there are as many distinct classes of positive forms of determinant-A as there are reduced forms. The total number of reduced forms is limited, because in case (i.) we have A =4ac -b'> 3112, so that b </ %A, while 4a2<¢}ac< A+b2<§ »A; in case (ii.) /;=4ac-a'=>3a2, or else a =b =c =/ 55; in case (iii.) A =4a2-b2> 3b2,4a2 =A-|-bz <§ A, or else a=-b =c=/ § A. With the help of these inequalities a complete set of reduced forms can be found by trial, and the number of classes determined. The latter cannot exceed Q; A; it is in general much less. With an indefinite form (a, b, c) we may associate the representative circle

a(x2+y2) +bx+c=o,

which cuts the axis of x in two real points. The form is said to be reduced if this circle cuts V; the condition for this is a(a =1= 'kb-l-c) <0, which can be expressed in the form 3a2+(a=b)2 <D, and it is hence clear that the absolute values of a, b, and therefore of c, are limited. As before, there are a limited number of reduced forms, but they are not all non-equivalent. In fact they arrange themselves, according to a law which is not very difficult to discover, in cycles or periods, each of which is associated with a particular class. The main result is the same as before: that the number of classes is finite, and that for each class we can find a representative form by a finite process of calculation.

34. Problem of Representation.-It is required to find out whether a given number rn' can be represented by the given form (a', b', c'). One condition is clearly that the divisor of the form must be a factor of m'. Suppose this is the case; and let m, (a, b, c) be the quotients of rn' and (a', b', c') be the divisor in question. Then we have now to discover whether m can be represented by the primitive form (a, b, c). First of all we will consider proper representations m= (11, b, 0) (a, W

where a, 'y are co-primes. Determine integers 13,5 such that a6 -/37 = 1, and apply to (a, b, c) the substituticni < ';' ; the new form will be (m, n, I), where

rt'-4rnl=D=b2-4ac.

Consequently rt'=D (mod 4m), and D must be a quadratic residue of m. Unless this condition is satisfied, there is no proper representation of m by any form of determinant D. Suppose, however, that n2=D (mod 4m) is soluble and that nl, rn, &c. are its roots. Taking any one of these, say ut, we can find out whether (rn, ng, li) and (a, b, c) are equivalent; if they are, there is a substitution Q which converts the latter into the former, and then m =aa2 -I-ba'y+c'y2. As to derived representations, if m= (a, b, c) (tx, ty)2, then rn must have the square factor tl, and rn/F=(a, b, c) (x, y)2; hence everything may be made to depend on proper representation by primitive orms.

35. Automorphs. The Pellian Equation.-A primitive form (a, b, c) is, by definition, equivalent to itself; but it may be so in more ways than one. In order that (a, b, c) may be transformed into itself by the substitution <f;' , it is necessary and sufficient that (at, B) (Ht-l-bu), -cu

-y, 6 au, § (t-bu)

where (t, u) is an integral solution of

F - Du' =4.

If D is negative and -D> 4, the only solutions are t= =1=2, u=0; D= -3 gives (=2, 0), (==1, =1); D= -4 gives (=|=2, o), (0, ii). On the other hand, if D> 0 the number of solutions is infinite and if (11, 141) is the solution for which t, u have their least positive ilalues, all the other positive solutions may be found from 1. n D D "

5i§ L= &?/~ (»=2, s,4.—)-The

substitutions by which (a, b, c) is transformed into itself are called its auto morphs. In the case when D=0 (mod 4) we have t==2T, u=2U, D =4N, and (T, U) any solution of

T2 - NU2 = 1.

This is usually called the Pellian equation, though it should properly be associated with Fermat, who first perceived its importance. The minimum solution can be found by converting / N into a periodic continued fraction.

The form (a, b, c) may be improperly equivalent to itself; in this case all its improper auto morphs can be expressed in the form K, (K-l-b})/2a

(fc-bk)/26, -)

where K2—DA” =4ac. In particular, if bac (mod a) the form (a, b, c) is improperly equivalent to itself. A form improperly equivalent to itself is said to be ambiguous.

36. Characters of a form or class. Genera.—Let (a, b, c) be any primitive form; we have seen above (§ 32) that if a., (3, 'y, 6 are any integers

4(f1<1' -l-i>¢w+cv”)(<l/32 +1255-I-c5') = 5” ~ (015 -Bv)'D where b' =2aaB+b(a6-Q-/3'y) -I-2c'y5. Now the expressions in brackets on the left hand may denote any two numbers rn, rt representable by the form (a, b, c); the formula shows that 4mn is a residue of D, and hence mn is a residue of every odd prime factor of D, and if p is any such factor the symbols and will have the same value. Putting (a, b, c) = f, this common value is denoted by and called a quadratic character (or simply character) of f with respect to p. Since a is representable by f (x = I, y=0) the value is the same as For example, if D = -140, the scheme of characters for the six reduced primitive forms, and therefore for the classes they (Q) (§)

(I, 0. 35) + +

@d=2»9)

(51 0| "

(3, 12, 12)-In

certain cases there are supplementary characters of the type represent, is

<%I> and , and the characters are discriminated according as an odd or even power of p is contained in D; but in every .case there are certain combinations of characters (in number one-half of all possible combinations) which form the total characters of actually existing classes. Classes which have the same total character are said to belong to the same genus. Each genus of the same order contains the same number of classes.

For any determinant D we have a principal primitive class for which all the characters are -I-; this is represented by the principal form (I, 0, -n) or (I, I, -n) according as D is of the form 4n or 4rL-l-I. The corresponding genus is called the principal genus. Thus, when D= -140, it appears from the table above that in the primitive order there are two genera, each containing three classes; and the non-existent total characters are + - and - -i-. 37. Composition.—Considering X, Y as given lineo-linear functions of (x, y), (x', y') defined by the equations X = 1>oxx'+i>i»o;' +1>2x'y 'l-Psyy

Y = qow'+q1xy +q2x'y+qayy

we may have identically, in x, y, x', y', (A, B, C) (X. Y)2=(<1.b, C) (vm/)2><(¢1', b',0') (x', y') and, this being so, the form (A, B, C) is said to be compounded of the two forms (a, b. c), (a', b', c'), the order of composition being indifferent. In order that two forms may admit of composition into a third, it is necessary and sufficient that their determinants be in the ratio of two squares. The most important case is that of two primitive forms ¢>, X of the same determinant; these can be compounded into a form denoted by ox or X¢ which is also primitive and of the same determinant as ¢> or X. If A, B, C are the classes to which ¢>, X, ox respectively belong, then any form of A compounded with any form of B gives rise to a form belonging to C. For this reason we write C=AB =BA, and speak of the multiplication or composition of classes. The principal class is usually denoted by I, because when compounded with any other class A it gives this same class A. The total number of primitive classes being finite, h, say, the series A, A”, A3, &c., must be recurring, and there will be a least exponent e such that A” = I. This exponent is a factor of h, so that every class satisfies A"= I. Composition is associative as well as commutative, that is to say, (AB)C=A(BC); hence the symbols Al, A2, . . .Ai for the h different classes detine an Abelian group (see GROUPS) of order h, which is representable by one or more base-classes Bi, BQ. . . . Bt in such a way that each class A is enumerated once and only once by putting

A=BfB2'/ .B, " (x fm, yén, . zip)

with mn. p == h, and B, "f = BQ" = . = Bti' = I. Moreover, the bases may be so chosen that m is a multiple of n, n of the next correspond mg

index, and so on. The same thing may be said with regard