Results 21 to 30 of about 1,195,018 (195)
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
On the Split Mersenne and Mersenne-Lucas Hybrid Quaternions
مجلة بغداد للعلوم, 2023 In this communication, introduce the split Mersenne and Mersenne-Lucas hybrid quaternions, also obtaining generating functions and Binet formulas for these hybrid quaternions and investigating some properties among them.
B. Malini Devi, S. Devibala
doaj +1 more source
Nature, 1911 I DESIRE to announce the discovery which I have made that (2181 —;1) is divisible by 43441. This leaves only 16 of the numbers (2q — 1) originally reported composite by Mersenne, still unverified. I have submitted my determination to Lt.—Col. Allan Cunningham, R.E., who has kindly verified it.
openaire +1 more source
Perfect and Mersenne Numbers [PDF]
, 2019 U ovom radu proučavamo Mersenneove i savršene brojeve. Kažemo da je prirodan broj N savršen ako je σ(N) = 2N, gdje je σ(N) suma pravih djelitelja broja N.
Patković, Kristina
core +2 more sources
Quantitative Microbial Risk Assessment of Human H5N1 Infection From Consumption of Fluid Cow's Milk. [PDF]
Risk AnalABSTRACT The spillover of H5N1 clade 2.3.4.4b into dairy cattle has raised concerns over the safety of fluid milk. While no foodborne infection has been reported in humans, this strain has infected at least 70 people, and milk from infected cows is known to be infected by ingestion of multiple other species.
Koebel KJ +7 more
europepmc +2 more sources
Fermat numbers and Mersenne numbers [PDF]
Mathematics of Computation, 1964 This paper gives details of the computations made on an IBM 7090 computer to show that the Fermat number \(F_m = 2^{2^m} +1\) is composite for \(m=14\), and that all the Mersenne numbers \(M_p=2^p-1\) \((5000 < p < 6000)\) are composite. The method used to show that the Fermat number is composite was to compute \(3^{2^n}\) modulo \(F_m\).
Selfridge, J. L., Hurwitz, Alexander
openaire +2 more sources
Nature, 1895 IN 1644 the mathematician Mersenne asserted that out of the 56 primes not < 257, there were only 12 primes, viz.:—
openaire +2 more sources
On the Lichtenberg hybrid quaternions [PDF]
Mathematica MoravicaIn this study, we define Lichtenberg hybrid quaternions. We give the Binet's formula, the generating functions, exponential generating functions and sum formulas of these quaternions. We find some relations between Jacobsthal hybrid quaternions, Mersenne
Morales Gamaliel
doaj +1 more source
Nature, 1912 AT various times NATURE has inserted notices of the successive discoveries in relation to Mersenne's Numbers. In the issue of August 12, 1909, Colonel Cunningham's discovery that 228479 was a factor of 2P−1 when p = 71 was announced: the other factor was 10334355636337793, but whether this was a prime or not was left undetermined.
openaire +2 more sources
Boolean Hypercubes, Mersenne Numbers, and the Collatz Conjecture
Journal of Mathematical Sciences and Modelling, 2020 This study is based on the trivial transcription of the vertices of a Boolean \textit{N}-Dimensional Hypercube $\textbf{H}_{N} $ into a subset $\mathbb{S}_{N}$ of the decimal natural numbers $\mathbb{N}.$ Such straightforward mathematical manipulation ...
Ramon Carbó Dorca
doaj +1 more source