Results 11 to 20 of about 263 (225)
Lucas-Lehmer test is the current standard algorithm used for testing the primality of Mersenne numbers, but it may have limitations in terms of its efficiency and accuracy.
Moustafa Ibrahim
doaj +1 more source
In this article, a new deterministic primality test for Mersenne primes is presented. It also includes a comparative study between well-known primality tests in order to identify the best test.
Yahia Awad, Ramiz Hindi, Haissam Chehade
doaj +1 more source
New properties of divisors of natural number [PDF]
The divisors of a natural number are very important for several areas of mathematics, representing a promising field in number theory. This work sought to analyze new relations involving the divisors of natural numbers, extending them to prime numbers ...
Hamilton Brito da Silva
doaj +1 more source
On the calculation of integer sequences, associated with twin primes
The twin primes conjecture states that there are infinitely many twin primes. While studying this hypothesis, many important results were obtained, but the problem remains unsolved.
Igoris Belovas +2 more
doaj +3 more sources
Asymptotic ω-Primality of Finitely Generated Cancelative Commutative Monoids
The computation of ω-primality has been object of study, mainly, for numerical semigroups due to its multiple applications to the Factorization Theory. However, its asymptotic version is less well known.
Juan Ignacio García-García +2 more
doaj +1 more source
The structure of groups with cyclic commutator subgroups indecomposable to a subdirect product of groups [PDF]
The article studies finite groups indecomposable to subdirect product of groups (subdirectly irreducible groups), commutator subgroups of which are cyclic subgroups.
Kozlov, Vladimir Anatolievich +1 more
doaj +1 more source
Optimized AKS Primality Testing: A Fluctuation Theory Perspective
The AKS algorithm is an important breakthrough in showing that primality testing of an integer can be done in polynomial time. In this paper, we study the optimization of its runtime. Namely, given a finite cardinality set of alphabets of a deterministic
Bhupendra Nath Tiwari +3 more
doaj +1 more source
A note on the primality of sums [PDF]
It is shown that when adding a large number to a set of much smaller numbers, the number of primes or twin ranks (see text) in the resulted sumset can be substantially larger than the theoretical values given by the Prime Number Theorem or Hardy ...
Antonie Dinculescu
doaj
Primes and Their Connection to Certain Polyhedral Number Sequences
A collection of results is given regarding whether a prime can be the sum or difference of two polyhedral numbers, as well as some primality restrictions on several sequences.
Benjamin Lee Warren
doaj +1 more source
Recent Breakthrough in Primality Testing
This paper briefly surveys the history of primality tests. The recently discovered deterministic polynomial time primality test due to Agrawal, Kayal and Saxena is presented and some improvements are shortly discussed.
R. Šleževičienė +2 more
doaj +1 more source

