Results 1 to 10 of about 132 (123)
BiEntropy, TriEntropy and Primality [PDF]
Entropy, 2020 The order and disorder of binary representations of the natural numbers < 28 is measured using the BiEntropy function. Significant differences are detected between the primes and the non-primes.
Grenville J. Croll
doaj +2 more sources
Arab Journal of Basic and Applied Sciences, 2023 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
exaly +3 more sources
The 24th mersenne prime. [PDF]
Proc Natl Acad Sci U S A, 1971 The 24th Mersenne prime M p = 2 p - 1, and currently the largest known prime, is 2 19937 - 1. Primality was shown by the Lucas-Lehmer test on an IBM 360/91 computer.
Tuckerman B.
europepmc +4 more sources
Minimality Conditions Equivalent to the Finitude of Fermat and Mersenne Primes
Axioms, 2023 The question is still open as to whether there exist infinitely many Fermat primes or infinitely many composite Fermat numbers. The same question concerning Mersenne numbers is also unanswered.
Menachem Shlossberg
exaly +3 more sources
Characterizations of Mersenne and 2-rooted primes
Finite Fields and Their Applications, 2015 We give several characterizations of Mersenne primes (Theorem 1.1) and of primes for which 2 is a primitive root (Theorem 1.2). These characterizations involve group algebras, circulant matrices, binomial coefficients, and bipartite graphs.
Sunil K Chebolu +2 more
exaly +4 more sources
On the Sum of Reciprocals of Mersenne Primes
American Journal of Computational Mathematics, 2017 The sum of reciprocals of Mersenne primes converges to 0.51645417894078856533···, which is an example of a probably infinite subset of primes whose sum of reciprocals is finite and can be computed accurately. This value is larger than , where is the set of perfect powers of prime numbers.
exaly +3 more sources
Cryptographically Strong Elliptic Curves of Prime Order [PDF]
International Journal of Electronics and Telecommunications, 2021 The purpose of this paper is to generate cryptographically strong elliptic curves over prime fields Fp, where p is a Mersenne prime, one of the special primes or a random prime. We search for elliptic curves which orders are also prime numbers.
Marcin Barański +2 more
doaj +1 more source
مجلة بغداد للعلوم, 2023 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
Gaussian Mersenne and Eisenstein Mersenne primes [PDF]
Mathematics of Computation, 2010 The Biquadratic Reciprocity Law is used to produce a deterministic primality test for Gaussian Mersenne norms which is analogous to the Lucas–Lehmer test for Mersenne numbers. It is shown that the proposed test could not have been obtained from the Quadratic Reciprocity Law and Proth’s Theorem.
Pedro Berrizbeitia, Boris Iskra
openaire +2 more sources
A study on the number of edges of some families of graphs and generalized Mersenne numbers
Ratio Mathematica, 2022 The relationship between the Nandu sequence of the SM family of graphs and the Generalized Mersenne numbers is demonstrated in this study. Nandu sequences are related to the two families of SM sum graphs and SM Balancing graphs.
K.G. Sreekumar +3 more
doaj +1 more source