The continuing search for Wieferich primes

被引：22

作者：

Knauer, J ^{[1
]}

Richstein, J

机构：

[1] Simon Fraser Univ, Dept Math, Burnaby, BC V5A 1S6, Canada

[2] Univ Giessen, Inst Informat, Giessen, Germany

来源：

MATHEMATICS OF COMPUTATION | 2005年 / 74卷 / 251期

关键词：

D O I：

10.1090/S0025-5718-05-01723-0

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

A prime p satisfying the congruence 2(p-1) = 1 (mod p(2)) is called a Wieferich prime. Although the number of Wieferich primes is believed to be infinite, the only ones that have been discovered so far are 1093 and 3511. This paper describes a search for further solutions. The search was conducted via a large scale Internet based computation. The result that there are no new Wieferich primes less than 1.25.10(15) is reported.

引用

页码：1559 / 1563

页数：5

共 27 条

[1]

ABEL NH, 1828, J REINE ANGEWANDTE M, V3, P212

[2]

BEEGER N, 1940, NIEUW ARCH WISK, P51

[3]

Beeger N., 1922, MESSENGER MATH, V51, P149

[4]

BEEGER NGW, 1914, MESSENGER MATH, V43, P72

[5]

BRILLHART J, 1971, COMPUTERS NUMBER THE, P213

[6] A search for Wieferich and Wilson primes [J].

Crandall, R ;

Dilcher, K ;

Pomerance, C .

MATHEMATICS OF COMPUTATION, 1997, 66 (217) :433-449

[7]

CRANDALL R, 2001, PRIME NUMBERS COMPUA

[8]

CUNNINGHAM A, 1910, P LOND MATH SOC, V2, pR13

[9]

FROBERG CE, 1958, MATH TABLES OTHER AI, P281

[10]

GRANLUND T, 2000, GNU MP GNU MULTIPLE

← 1 2 3 →