Explicit primality criteria for h 2ⁿ 1

DOI10.5802/JTNB.928zbMATH Open1364.11014arXiv1306.4456OpenAlexW2963828264MaRDI QIDQ284473FDOQ284473

Authors: Yingpu Deng, Dandan Huang 

Publication date: 18 May 2016

Published in: Journal de Théorie des Nombres de Bordeaux (Search for Journal in Brave)

Abstract: We describe an explicit generalized Lucasian test to determine the primality of numbers $hcdot{2}^{n}pm1$ when $hequiv0pmod17$. This test is by means of fixed seeds which depend only on $h$. In particular when $h=16^m-1$ with $m$ odd, our paper gives a primality test with some fixed seeds depending only on $h$. Comparing the results of W. Bosma(1993) and P. Berrizbeitia and T. G. Berry(2004), our result adds new values of $h$ along with this line. Octic and bioctic reciprocity are used to deduce our result.

Full work available at URL: https://arxiv.org/abs/1306.4456

Recommendations

• A generalised Lucasian primality test
• A Lucas-Lehmer primality test for the numbers \(n=Ap_ 1^ {s_ 1}p_ 2^ {s_ 2}\cdots p_ t^ {s_ t}+\omega\)
• Primality testing for numbers of the form \(h\cdot 2^n\pm 1\)
• Effective Primality Tests for Some Integers of the Forms A5 n - 1 and A7 n - 1
• Some primality conditions for \(N=2p^n -1\)
• Testing numbers of the form N = 2kpm − 1 for primality
• scientific article; zbMATH DE number 7199615
• Some primality tests that eluded Lucas
• Explicit primality criteria for $(p-1)p^n-1$
• Primality testing and prime constellations

zbMATH Keywords

computational complexityseedsreciprocity lawsgeneralized Lucasian sequenceprimality tests

Mathematics Subject Classification ID

Power residues, reciprocity (11A15) Factorization; primality (11A51) Primality (11Y11)

Cites Work

• Title not available (Why is that?)
• Fast multiplication of large numbers
• Title not available (Why is that?)
• Title not available (Why is that?)
• Explicit Primality Criteria for h ⋅2 k ± 1
• Biquadratic reciprocity and a Lucasian primality test

Cited In (12)

• Title not available (Why is that?)
• Biquadratic reciprocity and a Lucasian primality test
• Title not available (Why is that?)
• Probable prime tests for generalized Mersenne numbers
• Some primality tests that eluded Lucas
• A Lucas-Lehmer primality test for the numbers \(n=Ap_ 1^ {s_ 1}p_ 2^ {s_ 2}\cdots p_ t^ {s_ t}+\omega\)
• Title not available (Why is that?)
• Primality testing for numbers of the form \(h\cdot 2^n\pm 1\)
• A primality test for \(4Kp^n-1\) numbers
• Title not available (Why is that?)
• Explicit Primality Criteria for h ⋅2 k ± 1
• A generalised Lucasian primality test

This page was built for publication: Explicit primality criteria for \(h \cdot 2^n \pm 1\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q284473)