Page 1 Next

Displaying 1 – 20 of 55

Showing per page

Ternary quadratic forms with rational zeros

John Friedlander, Henryk Iwaniec (2010)

Journal de Théorie des Nombres de Bordeaux

We consider the Legendre quadratic forms ϕ a b ( x , y , z ) = a x 2 + b y 2 - z 2 and, in particular, a question posed by J–P. Serre, to count the number of pairs of integers 1 a A , 1 b B , for which the form ϕ a b has a non-trivial rational zero. Under certain mild conditions on the integers a , b , we are able to find the asymptotic formula for the number of such forms.

The conductor of a cyclic quartic field using Gauss sums

Blair K. Spearman, Kenneth S. Williams (1997)

Czechoslovak Mathematical Journal

Let Q denote the field of rational numbers. Let K be a cyclic quartic extension of Q . It is known that there are unique integers A , B , C , D such that K = Q A ( D + B D ) , where A is squarefree and odd , D = B 2 + C 2 is squarefree , B > 0 , C > 0 , G C D ( A , D ) = 1 . The conductor f ( K ) of K is f ( K ) = 2 l | A | D , where l = 3 , if D 2 ( mod 4 ) or D 1 ( mod 4 ) , B 1 ( mod 2 ) , 2 , if D 1 ( mod 4 ) , B 0 ( mod 2 ) , A + B 3 ( mod 4 ) , 0 , if D 1 ( mod 4 ) , B 0 ( mod 2 ) , A + B 1 ( mod 4 ) . A simple proof of this formula for f ( K ) is given, which uses the basic properties of quartic Gauss sums.

The distribution of square-free numbers of the form [ n c ]

Xiaodong Cao, Wenguang Zhai (1998)

Journal de théorie des nombres de Bordeaux

It is proved that the sequence [ n c ] ( n = 1 , 2 , ) contains infinite squarefree integers whenever 1 < c < 61 36 = 1 . 6944 , which improves Rieger’s earlier range 1 < c < 1 . 5 .

The Divisibility Modulo 4 of Kloosterman Sums over Finite Fields of Characteristic 3

Sin, Changhyon (2011)

Serdica Journal of Computing

Recently Garashuk and Lisonek evaluated Kloosterman sums K (a) modulo 4 over a finite field F3m in the case of even K (a). They posed it as an open problem to characterize elements a in F3m for which K (a) ≡ 1 (mod4) and K (a) ≡ 3 (mod4). In this paper, we will give an answer to this problem. The result allows us to count the number of elements a in F3m belonging to each of these two classes.

Currently displaying 1 – 20 of 55

Page 1 Next