Results 61 to 70 of about 39,822 (114)
Tower Mersenne Primes Are Infinitely Many
Against to Mersenne prime using Proposition transformation method, based on Euler’s function and n order remainder theorem,the au?thors have proved that the necessary and sufficient condition for that module M has primitive root is that x in the equation
唐子周
core +1 more source
Features of digital signal processing algorithms using Galois fields GF(2n+1). [PDF]
PLoS One, 2023 Suleimenov IE +2 more
europepmc +1 more source
On (unitary) perfect polynomials over F2 with only Mersenne primes as odd divisors
The only (unitary) perfect polynomials over F2 with only Mersenne primes as odd divisors that are products of $x$, $x+1$ and Mersenne primes are precisely the nine (resp. nine "classes") known ones.
Gallardo, Luis, Rahavandrainy, Olivier
core +1 more source
BINARY BBP-FORMULAE FOR LOGARITHMS AND GENERALIZED GAUSSIAN-MERSENNE PRIMES
, 2008 ... k=0 p(k) q(k)b k where p and q are integer polynomials, deg p < deg q, and p(k)/q(k) is non-singular for non-negative k and b ≥ 2, have special properties.
Marc Chamberland
core
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
Klintberg, Amy
core +1 more source
Mersenne Primes and the Quest to Find Them
The purpose of this thesis is to explore Mersenne primes. Mersenne primes are prime numbers of the form 2ⁿ − 1 where itself is prime. We delve into some properties of Mersenne primes and discuss conjectures about their distribution.
Levenius, Leo G.
core +2 more sources
General Solution of the Diophantine equation involving Mersenne Prime [PDF]
, 2023 In this article, I study and solve the exponential Diophantine equation $M_p^{x} + (M_q + 1)^{y}= (lz)^2$ where $M_p$ and $M_q$ are Mersenne primes, $l$ is a prime number, and $x,y$, and $z$ are non-negative integers.
Ghosh, Arkabrata
core
Strongly Base-Two Groups. [PDF]
Vietnam J Math, 2023 Burness TC, Guralnick RM.
europepmc +1 more source
Tesla-Kaoru Conjecture: A New and Fast Method to Find Mersenne Primes
This project introduces the Tesla-Kaoru Conjecture, a novel and efficient digital root-based filter for identifying candidate exponents of Mersenne primes.
Kaoru Aguilera Katayama
core +1 more source
Covert Channel Communication as an Emerging Security Threat in 2.5D/3D Integrated Systems. [PDF]
Sensors (Basel), 2023 Miketic I, Dhananjay K, Salman E.
europepmc +1 more source