Explicit primality criteria for \(h \cdot 2^n \pm 1\)

DOI10.5802/JTNB.928zbMath1364.11014arXiv1306.4456OpenAlexW2963828264MaRDI QIDQ284473

Yingpu Deng, Dandan Huang

Publication date: 18 May 2016

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

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

zbMATH Keywords

seedscomputational complexityprimality testsreciprocity lawsgeneralized Lucasian sequence

Mathematics Subject Classification ID

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

Related Items (3)

Unnamed Item ⋮ A primality test for \(4Kp^n-1\) numbers ⋮ Primality testing for numbers of the form \(h\cdot 2^n\pm 1\)

Cites Work

• Fast multiplication of large numbers
• Explicit Primality Criteria for h ⋅2 k ± 1
• Biquadratic reciprocity and a Lucasian primality test
• Unnamed Item
• Unnamed Item
• Unnamed Item

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