A note on primality tests for \(N=h\cdot 2^ n-1\)
type: Item
instance of: scholarly article
title: A note on primality tests for \(N=h\cdot 2^ n-1\)
zbMATH Open document ID: 0814.11007
DOI: 10.1007/BF01935653
published in: BIT
publication date: 1995-01-04T00:00:00Z
review text: Using only the most simple properties of the finite field \(\mathbb{F}_{p^ 2}\) the author gives a short proof of a primality test of integers of the form \(N = h 2^ n - 1\). One should add to the list of references the very readable note of \textit{W. Borho} [Mitt. Math. Ges. Hamb. 11, 232-256 (1983; Zbl 0551.10008)].
reviewed by: Helmut Müller
Mathematics Subject Classification ID: 11A51
Mathematics Subject Classification ID: 11Y11
zbMATH DE Number: 698683
zbMATH Keywords: primality test
Wikidata QID: Q60174332
author: Øystein J. Rødseth
MaRDI profile type: Publication
cites work: Tests for primality
cites work: A Really Trivial Proof of the Lucas-Lehmer Test
cites work: On Lucas's Test for the Primality of Mersenne's Numbers
cites work: Lucasian Criteria for the Primality of  = h ⋅2 n - 1
cites work: A Proof of the Lucas-Lehmer Test
cites work: On Lucas's and Pepin's Tests for the Primeness of Mersenne's Numbers
full work available at URL: https://doi.org/10.1007/bf01935653
OpenAlex ID: W1970256974
description: scientific article; zbMATH DE number 698683