* Your assessment is very important for improving the workof artificial intelligence, which forms the content of this project
Download ON THE DIVISIBILITY OF THE CLASS NUMBER OF
Survey
Document related concepts
Vincent's theorem wikipedia , lookup
Mathematical proof wikipedia , lookup
Georg Cantor's first set theory article wikipedia , lookup
Factorization wikipedia , lookup
List of important publications in mathematics wikipedia , lookup
Brouwer fixed-point theorem wikipedia , lookup
Fundamental theorem of calculus wikipedia , lookup
Four color theorem wikipedia , lookup
Wiles's proof of Fermat's Last Theorem wikipedia , lookup
Fermat's Last Theorem wikipedia , lookup
Fundamental theorem of algebra wikipedia , lookup
Quadratic form wikipedia , lookup
Transcript
ON THE DIVISIBILITY OF THE CLASS NUMBER OF QUADRATIC FIELDS N. C. ANKENY AND S. CHOWLA 1. Introduction. It is well known that there exist infinitely many quadratic extensions of the rationale each with class number divisible by 2. In facf, if the discriminant of the field contains more than two prime factors, then 2 divides the class number. Max Gut [ l ] generalized this result to show that there exist infinitely many quadratic imaginary fields each with class number divisible by 3. In this present paper we prove that there exist infinitely many quadratic imaginary fields each with class number divisible by g where g is any given rational integer. The method extends to yield certain results about quadratic real fields, but these are not as sharp as on quadratic imaginary fields. 2. Theorem. In the following we may assume without loss of generality that g is positive, sufficiently large, and even. LEMMA 1. Denote by N the number of square-free 2 integers ι l/z 3 S - * , where 2 | x, 0 < x < ( 2 . 3 ^ ) . Then, for g sufficiently large, JV > — - 25 Proof. Denote by d the expression (1) d = tf- where (2) 2 I * , 0 <x < Received September 28, 1953. Pacific J. Math. 5 (1955), 321-324 321 of the form 322 N. C. ANKENY AND S. CHOWLA The number of such d is 1(2.3S-1)172 + 0 ( 1 ) . 2 As 2 I x, none of the d's are divisible by 2. The number of d divisible by 3, and, hence, by 9, is less than i(2.3S-ι)1/2+O(l). 6 For p an odd prime greater than 3, the number of d divisible by p 2 is less than — ( 2 . 3 £ " ι ) 1 / 2 + 2. 2 2p Hence the number of square-free d is N > -(2.3«-1)1/2-i(2.3^1)1/2 +O ( l ) ^ Σ 2 6 P >5 — 2p 2 ( 2 . 3 « " ι ) 1 / 2 + 2) 4 p>5 P by the prime-number theorem. Hence 3 THEOREM 1. For the square-free we have g \ h% where h denotes the class 4/ integers \g / d which 25 satisfy (1) and (2) number of the field R (\/ -c? ). Proof. Consider the quadratic extension of the rationale /?(γ~cί). Since where x is prime to 3 as d is square free, we see that ON THE DIVISIBILITY OF THE CLASS NUMBER OF QUADRATIC FIELDS 323 2 x Hence, by the well-known criterion for the splitting of rational primes in quadratic extensions, ( 3 ) = P ι P 2 by 3 in R(yf^d), and Pu where ( 3 ) denotes the principal ideal generated P2 are two distinct conjugate prime i d e a l s in L e t m be the l e a s t positive R{y/~d). R(\/~d). integer such that P™ i s a principal ideal in If possible let m < g, and P™ =(Cί) for some integer Cί G / ? / ^ Since 2 I g, we have 2 | x9 and, by ( 1 ) , d = 1 (mod 4 ) . Then Cί = u + vy —d for rational integers u and v. Then ( 3 m ) = P™P2m = U + vy/^d) (u - υy/^d) = (u2 + v2d), or Zm=u2 (3) +v2d. By ( 1 ) a n d ( 2 ) , w e h a v e d > 3 & " 1 ; b u t if m < g, ( 3 ) i m p l i e s 3Z ι >u2 + v2d, so υ = 0. But then or which is false as P t , P 2 are two distinct prime ideals in R{\/-d) 2 Thus we have shown that m >_ g; but as 3# = x + d9 m = g. Hence, there exists in R(y/~d) a prime ideal ? ! whose gth power but none lower is a principal ideal. This immediately implies g | h. 3. Application. To show that there exist infinitely many fields each with class number divisible by g, we proceed as follows. Theorem 1 shows that there are at least (1/25) 3^ with class number divisible by g. Let gt = gχ be such that the class number of none of these fields is divisible by g t Then, as before, we find at least (1/25) 3 fields with class number divisible by g t These fields must be distinct from the previous fields. Repeating this method we see there exist infinitely many quadratic fields with class number divisible 324 N. C. ANKENY AND S. CHOWLA by g. 4. A further result. We shall prove: THEOREM 2. If H is square free number of the form d = n2& + 1, where n > 4, then g \ h, where h is the class number of the field R {yd). Proof. We need only outline the proof of Theorem 2, as in most aspects it is very similar to the proof of Theorem 1. We first show that ( * ) = « « ' in R(yfl)t where 21, 21' are two relatively prime conjugate ideals. We then show that u2 - dv2 {u, v integers) represents no integer other than 0 and 1 whose absolute value is less than yd. This follows from the fact that d is of the form d-w2 + 1. Hence the least power of 21 which is a principal ideal is the gth power. This immediately implies g \ h. The interest of Theorem 2 is somewhat lessened by the fact that it is unknown at present if there exists an infinite number of square-free numbers of the form n2^ + 1. Hence we are unable to prove a theorem similar to Theorem 1 with regard to quadratic real extensions of the rationals. REFERENCE 1. Max Gut, Kubische Klassenkorper uber quadratischimaginaren Grundkorpern, Nieuw Arch. Wiskunde (2) 23 (1951), 185-189. JOHNS HOPKINS UNIVERSITY, UNIVERSITY OF COLORADO