Results 1 
2 of
2
A Problem Concerning a Character Sum
, 1999
"... this paper we exhibit some techniques which were successful in producing, for each k such that 3 k 2000, a value for p such that S(k) > 0. 1. INTRODUCTION ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
this paper we exhibit some techniques which were successful in producing, for each k such that 3 k 2000, a value for p such that S(k) > 0. 1. INTRODUCTION
A Problem Concerning a Character Sum (Extended Abstract)
"... ? ) E. Teske 1 and H.C. Williams ??2 1 Technische Universitat Darmstadt Institut fur Theoretische Informatik Alexanderstrae 10, 64283 Darmstadt Germany 2 University of Manitoba Dept. of Computer Science Winnipeg, MB Canada R3T 2N2 Abstract. Let p be a prime congruent to 1 modulo 4, n p ..."
Abstract
 Add to MetaCart
? ) E. Teske 1 and H.C. Williams ??2 1 Technische Universitat Darmstadt Institut fur Theoretische Informatik Alexanderstrae 10, 64283 Darmstadt Germany 2 University of Manitoba Dept. of Computer Science Winnipeg, MB Canada R3T 2N2 Abstract. Let p be a prime congruent to 1 modulo 4, n p the Legendre symbol and S(k) = P p 1 n=1 n k n p . The problem of nding a prime p such that S(3) > 0 was one of the motivating forces behind the development of several of Shanks' ideas for computing in algebraic number elds, although neither he nor D. H. and Emma Lehmer were ever successful in nding such a p. In this extended abstract we summarize some techniques which were successful in producing, for each k such that 3 k 2000, a value for p such that S(k) > 0. 1 Introduction Let d denote a fundamental discriminant of an imaginary quadratic eld IK = Q( p d ) and let h(d) denote the class number of IK. Let p be a prime ( 3(mod 4)), n p the Legendre symbol and S...