Results 11 to 20 of about 377,673 (186)
Acerca de algunos exponentes de Mersenne (About some Mersenne exponents) [PDF]
Revista Digital Matemática, Educación e InternetLos números primos de Mersenne crecen de manera vertiginosa y se vuelven intratables con las herramientas de cómputo actuales. En este trabajo se repasan brevemente las cadenas de Mersenne para mostrar cómo ese crecimiento exponencial impone un límite en
Gerardo Miramontes de León
doaj +2 more sources
Computer Experiments with Mersenne Primes [PDF]
Computational Methods in Science and Technology, 2013 We have calculated on the computer the sum $\bar{\BB}_M$ of reciprocals of all 47 known Mersenne primes with the accuracy of over 12000000 decimal digits. Next we developed $\bar{\BB}_M$ into the continued fraction and calculated geometrical means of the partial denominators of the continued fraction expansion of $\bar{\BB}_M$. We get values converging
Wolf Marek
openaire +3 more sources
Performances and Fatigue Responses to Weighted Vest Training in Parkour Novices. [PDF]
Eur J Sport SciABSTRACT Weighted vest training has demonstrated benefits for muscle strength, which is critical for parkour performance. However, the acute effects of external loading in this discipline remain poorly understood. This study investigated the impact of weighted vest use during parkour sessions on lower‐limb performance, perceived exertion, and muscle ...
Grosprêtre S +5 more
europepmc +2 more sources
Mersenne Numbers: consolidated results [PDF]
, 1986 This document provides and comments on the results of the Lucas-Lehmer testing and/or partial factorisation of all Mersenne Numbers Mp = 2^p-1 where p is prime and less than 100,000. Previous computations have either been confirmed or corrected.
Hunt, David +4 more
core +7 more sources
Random number generators with period divisible by a Mersenne prime
, 2003 Colloque avec actes et comité de lecture. internationale.International audiencePseudo-random numbers with long periods and good statistical properties are often required for applications in computational finance.
Brent, Richard, P., Zimmermann, Paul
core +4 more sources
Walailak Journal of Science and Technology, 2021 In this paper, we explain all non-negative integer solutions for the nonlinear Diophantine equation of type 8x + py = z2 when p is an arbitrary odd prime number and incongruent with 1 modulo 8.
Boorapa SINGHA
doaj +3 more sources
The Power of Hashing with Mersenne Primes
CoRR, 2020 The classic way of computing a $k$-universal hash function is to use a random degree-$(k-1)$ polynomial over a prime field $\mathbb Z_p$. For a fast computation of the polynomial, the prime $p$ is often chosen as a Mersenne prime $p=2^b-1$. In this paper, we show that there are other nice advantages to using Mersenne primes.
Thomas Dybdahl Ahle +2 more
openaire +3 more sources
Prime-Field Masking in Hardware and its Soundness against Low-Noise SCA Attacks
Transactions on Cryptographic Hardware and Embedded Systems, 2023 A recent study suggests that arithmetic masking in prime fields leads to stronger security guarantees against passive physical adversaries than Boolean masking.
Gaëtan Cassiers +4 more
doaj +1 more source
Mathematics of Computation, 1958 Am 8. September 1957 ergab die schwedische Elektronenrechenmaschine BESK (siehe auch nachstehendes Referat Zbl 0082.25602) nach einer Laufzeit von 5h 30m die Zahl \(2^{3217}-1\) als Primzahl. (Nachgeprüft am 12. September.) Sie ist, mit ihren 969 Stellen vollständig mitgeteilt, nunmehr die größe bekannte Primzahl.
openaire +2 more sources
High performance FPGA implementation of the mersenne twister [PDF]
, 2008 Efficient generation of random and pseudorandom sequences is of great importance to a number of applications [4]. In this paper, an efficient implementation of the Mersenne Twister is presented. The proposed architecture has the smallest footprint of all
Shrutisagar Chandrasekaran +3 more
core +1 more source