1986
DOI: 10.1090/s0025-5718-1986-0856714-3
|View full text |Cite
|
Sign up to set email alerts
|

The primality of 𝑅1031

Abstract: Abstract. A description is given of a technique for proving Ä1031 (= (101031 -l)/9) a prime.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
4
0

Year Published

1988
1988
2015
2015

Publication Types

Select...
3
2

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(4 citation statements)
references
References 19 publications
0
4
0
Order By: Relevance
“…On the other hand, testing an arbitrary number for primality depended on integer factorization. For this era, see [18,92,95]. The reader interested in large or curious primes is referred to [80] as well as [68].…”
Section: Introductionmentioning
confidence: 99%
“…On the other hand, testing an arbitrary number for primality depended on integer factorization. For this era, see [18,92,95]. The reader interested in large or curious primes is referred to [80] as well as [68].…”
Section: Introductionmentioning
confidence: 99%
“…For example, R 4 = 1111. Currently, the largest known prime repunit is R 1031 which was shown to be prime by Hugh Williams and Harvey Dubner in 1986 [10]. The repunits R 49081 , R 86453 , R 109297 , and R 270343 are all probable primes, but have not been proven prime [1].…”
Section: Notation and Basic Factsmentioning
confidence: 99%
“…The only known prime repunits are R2, R19, R23 and, in the age of computers, R317 (discovered by and R1031 (discovered by Williams & Dubner in 1986).…”
Section: Recordmentioning
confidence: 99%