Results 91 to 100 of about 524 (199)
Learned pseudo-random number generator: WGAN-GP for generating statistically robust random numbers. [PDF]
PLoS One, 2023 Okada K +3 more
europepmc +1 more source
Improving the efficiency of using multivalued logic tools: application of algebraic rings. [PDF]
Sci Rep, 2023 Suleimenov IE +3 more
europepmc +1 more source
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.
openaire +2 more sources
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
, 2023 In this paper three prime numbers are presented as high potentials to be Mersenne numbers and their application in computational primality testing is suggested.
Loaiza-Ossa, Gabriel Ignacio +1 more
core
Global Generalized Mersenne Numbers: Definition, Decomposition, and Generalized Theorems
A new generalized definition of Mersenne numbers is proposed of the form an−a−1n, called global generalized Mersenne numbers and noted GMa,n with base a and exponent n positive integers. The properties are investigated for prime n and several theorems on
Vladimir Pletser
core +1 more source
A quantum-inspired probabilistic prime factorization based on virtually connected Boltzmann machine and probabilistic annealing. [PDF]
Sci Rep, 2023 Jung H +6 more
europepmc +1 more source
This paper tackles a longstanding problem in number theory: the existence of odd perfect numbers. A perfect number is defined as a positive integer whose sum of all its proper divisors (excluding itself) is equal to twice the number itself. While Euclid demonstrated a method to construct even perfect numbers using Mersenne primes (primes of the form $2^
openaire +1 more source
Fast Constant-Time Modular Inversion over Fp Resistant to Simple Power Analysis Attacks for IoT Applications. [PDF]
Sensors (Basel), 2022 Sghaier A +5 more
europepmc +1 more source
Divisibility by 3 of even multiperfect numbers of abundancy 3 and 4
, 2010 We say a number is flat if it can be written as a non-trivial power of 2 times an odd squarefree number. The power is the “exponent” and the number of odd primes the “length”. Let N be flat and 4-perfect with exponent a and length m.
Broughan, Kevin A., Zhou, Qizhi
core