English

Explicit primality criteria for $h\cdot2^n\pm1$

Number Theory 2013-12-03 v2

Abstract

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

Cite

@article{arxiv.1306.4456,
  title  = {Explicit primality criteria for $h\cdot2^n\pm1$},
  author = {Yingpu Deng and Dandan Huang},
  journal= {arXiv preprint arXiv:1306.4456},
  year   = {2013}
}

Comments

12 pages

R2 v1 2026-06-22T00:36:37.298Z