Article
Licensed
Unlicensed
Requires Authentication
Testing numbers of the form for primality
-
E. V. Sadovnik
Published/Copyright:
July 9, 2008
Abstract
We suggest an algorithm to test numbers of the form 
for primality, where 
, k is an odd positive integer, 
is a prime number, i = 1,…, n, and 
. The algorithm makes use of the Lucas functions. The algorithm suggested is of complexity Ô(log2N).
Received: 2006-06-06
Revised: 2007-01-30
Published Online: 2008-07-09
Published in Print: 2008-June
© de Gruyter 2008
You are currently not able to access this content.
You are currently not able to access this content.
Articles in the same Issue
- The relationship between the level of affinity and cryptographic parameters of Boolean functions
- Testing numbers of the form for primality
- On the complexity of construction of complete and complete bipartite graphs
- Minimality and deadlockness of multitape automata
- Limit distributions of the number of absent chains of identical outcomes
- Parallel embeddings of octahedral polyhedra
Articles in the same Issue
- The relationship between the level of affinity and cryptographic parameters of Boolean functions
- Testing numbers of the form for primality
- On the complexity of construction of complete and complete bipartite graphs
- Minimality and deadlockness of multitape automata
- Limit distributions of the number of absent chains of identical outcomes
- Parallel embeddings of octahedral polyhedra
