Hostname: page-component-7b7567c8c-8tzhz Total loading time: 0 Render date: 2026-11-19T12:20:33.955Z Has data issue: false hasContentIssue false

The Primality of N=2A3n-1

Published online by Cambridge University Press:  20 November 2018

H. C. Williams*
Affiliation:
University of Manitoba, Winnipeg, Manitoba
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

Lehmer [3] and Reisel [7] have devised tests for determining the primality of integers of the form A2n—1. Tables of primes of these forms may be found in [7] and Williams and Zarnke [10]. Little work, however, seems to have been done on integers of the form N=2A3n—1. Lucas [6] gave conditions that were only sufficient for the primality of N. Recently Lehmer [4] has given a method for determining the primality of an integer N if the factorization of N+1 is known.

Information

Type
Research Article
Copyright
Copyright © Canadian Mathematical Society 1972