Supplement to some results on pseudosquares

被引:18
作者
Lukes, RF
Patterson, CD
Williams, HC
机构
[1] Department of Computer Science, University of Manitoba, Winnipeg
[2] Xilinx Development Corporation, Edinburgh EH16 6TJ
关键词
D O I
10.1090/S0025-5718-96-00678-3
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
If p is an odd prime, the pseudosquare Lp is defined to be the least positive nonsquare integer such that Lp = 1 (mod 8) and the Legendre symbol (Lp/q) = 1 for all odd primes q ≤ p. In this paper we first discuss the connection between pseudosquares and primality testing We then describe a new numerical sieving device which was used to extend the table of known pseudosquares up to L271. We also present several numerica results concerning the growth rate of the pseudosquares, results which so far confirm that Lp > e√p/2, an inequality that must hold under the extended Riemann Hypothesis.
引用
收藏
页码:S25 / S27
页数:3
相关论文
共 24 条
[1]   ON DISTINGUISHING PRIME-NUMBERS FROM COMPOSITE NUMBERS [J].
ADLEMAN, LM ;
POMERANCE, C ;
RUMELY, RS .
ANNALS OF MATHEMATICS, 1983, 117 (01) :173-206
[2]  
ADLEMAN LM, 1992, LECTURE NOTES MATH, V1512
[3]  
[Anonymous], ARS COMBINATORIA
[4]  
[Anonymous], 1933, B AM MATH SOC
[5]   SIEVE ALGORITHMS FOR PERFECT POWER TESTING [J].
BACH, E ;
SORENSON, J .
ALGORITHMICA, 1993, 9 (04) :313-328
[6]  
BACH E, 1993, MATH COMPUT, V61, P69, DOI 10.1090/S0025-5718-1993-1195432-5
[7]  
BACH E, 1990, MATH COMPUT, V55, P355, DOI 10.1090/S0025-5718-1990-1023756-8
[8]  
BEEGER NGW, 1946, SCI NAT PHYS MATH, V16, P93
[9]  
BEEGER NGW, 1929, NIEUW ARCH WISK, V16, P37
[10]  
BRONSON ND, 1994, P S APPL MATH, V48, P547