首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Deterministic primality test for numbers of the form odd
Authors:Pedro Berrizbeitia  Boris Iskra
Institution:Departamento de Matemáticas Puras y Aplicadas, Universidad Simón Bolívar, Caracas, Venezuela ; Departamento de Matemáticas Puras y Aplicadas, Universidad Simón Bolívar, Caracas, Venezuela
Abstract:We use a result of E. Lehmer in cubic residuacity to find an algorithm to determine primality of numbers of the form $A^23^n+1$, $n$ odd, $A^2<4(3^n+1)$. The algorithm represents an improvement over the more general algorithm that determines primality of numbers of the form $A.3^n \pm 1$, $A/2<4.3^n-1$, presented by Berrizbeitia and Berry (1999).

Keywords:
点击此处可从《Proceedings of the American Mathematical Society》浏览原始摘要信息
点击此处可从《Proceedings of the American Mathematical Society》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号