Results 121 to 130 of about 384 (160)

Algorithm-assisted discovery of an intrinsic order among mathematical constants. [PDF]

Proc Natl Acad Sci U S A
Elimelech R, David O, De la Cruz Mengual C, Kalisch R, Berndt W, Shalyt M, Silberstein M, Hadad Y, Kaminer I.   +8 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

On some geometry of Mersenne primes

Periodica Mathematica Hungarica, 1994
A possible connection between Mersenne primes and certain geometrical structures is implied. Here the authors consider the structures \((\mathbb{Z}_ q,{\mathcal B}_ p^ \#, \in)\) resulting from a planar nearring \((\mathbb{Z}_ q, +, *)\), where \(q= M_ p\) is a Mersenne prime, \(\mathbb{Z}_ q\) denotes the integers modulo \(q\), \(*\) is a ...
Clay, J. R., Yeh, Y.-N.
exaly   +2 more sources

The other side of Mersenne Primes [PDF]

Mersenne numbers, (2^n)-1, with natural number n, are like pay dirt, containing dirt and apparent gold. They entice us to ask: which of these numbers are prime, which are not, and if not, why not - especially the shiny ones? We address the "why not?" of that question here, exploring the nature of all Mersenne composites, the other side of Mersenne ...
Klintberg, Amy
openaire   +3 more sources

On generalized Mersenne prime

SeMA Journal, 2014
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hoque, Azizul, Saikia, Helen K.
openaire   +1 more source

Testing Mersenne Primes with Elliptic Curves

2006
The current primality test in use for Mersenne primes continues to be the Lucas-Lehmer test, invented by Lucas in 1876 and proved by Lehmer in 1935. In this paper, a practical approach to an elliptic curve test of Gross for Mersenne primes, is discussed and analyzed.
Song Y. Yan, Glyn James
openaire   +1 more source

A Technique for Image Encryption Using the Modular Multiplicative Inverse Property of Mersenne Primes [PDF]

Symmetry
Mersenne prime numbers, expressed in the form (2n − 1), have long captivated researchers due to their unique properties. The presented work aims to develop a symmetric cryptographic algorithm using a novel technique based on the logical properties ...
Shanooja M. A., Anil Kumar M. N.
exaly   +2 more sources

Where is the next mersenne prime hiding?

The Mathematical Intelligencer, 1983
Almost identical to the paragraph 3.5 of the author's book reviewed above.
openaire   +2 more sources

Mersenne Primes, Irrationality and Counting Subgroups

Bulletin of the London Mathematical Society, 1997
The author continues his studies on counting congruence subgroups in arithmetic subgroups [see ibid. 26, 255-262 (1994; Zbl 0849.11066)]. In this paper he considers the question of counting subgroups of \(p\)-power index in a group \(G_I\) which is the product of alternating groups \(A_{p^a}\) for \(a\in I\), where \(I\) is some subset of \(\mathbb{N}\)
openaire   +1 more source

Fast Mersenne prime testing on the GPU

Proceedings of the Fourth Workshop on General Purpose Processing on Graphics Processing Units, 2011
The Lucas-Lehmer test for Mersenne primality can be efficiently parallelized for GPU-based computation. The gpuLucas project implements an irrational-base discrete weighted transform approach (IBDWT) using balanced-integers, non-power-of-two transforms, and carry-save radix representations.
openaire   +1 more source

Mersenne composites and cyclotomic primes

The Mathematical Gazette, 2003
One of the long-standing problems of number theory, appealing to professional and recreational mathematicians alike, is the existence of Mersenne primes. These puzzling primes, for example 7, 31, 127 and 8191, are of the form 2 P - 1, where p is itself a prime.
openaire   +1 more source