$h\cdot2^n\pm1$的显式素性准则
Explicit primality criteria for $h\cdot2^n\pm1$
摘要：
我们描述了一个显式的广义Lucasian测试，以确定素数的数字$h\cdot2^n\pm1$时，$h\nequiv0\pmod{17}$。该试验通过仅依赖于$h$的固定种子进行。特别是当$h=16^m-1$的$m$为奇数时，本文给出了一个只依赖于$h$的固定种子的素性检验.与W. Bosma（1993）和P. Berriquitia和T. G. Berry（2004），我们的结果沿着这条线添加了新的$h$值。利用光的互反性和双光的互反性推导了我们的结果。
英文摘要：
We describe an explicit generalized Lucasian test to determine the primality of numbers $h\cdot2^n\pm1$ when $h\nequiv0\pmod{17}$. 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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
