Results 81 to 90 of about 986 (177)
Batched ranged random integer generation
Software: Practice and Experience, Volume 55, Issue 1, Page 155-169, January 2025.Summary Pseudorandom values are often generated as 64‐bit binary words. These random words need to be converted into ranged values without statistical bias. We present an efficient algorithm to generate multiple independent uniformly‐random bounded integers from a single uniformly‐random binary word, without any bias.
Nevin Brackett‐Rozinsky, Daniel Lemire
wiley +1 more source
Bioscience Journal, 2017 The economic viability of feedlot zebu bulls, slaughtered at 450 kg after 90 days of feeding with diets consisting of different proportions of concentrate in dry matter (40, 60 or 80%), was estimated using Monte Carlo simulations, with or without the ...
Rodrigo Medeiros da Silva +6 more
doaj +3 more sources
, 1987 These notes have been issued on a small scale in 1983 and 1987 and on request at other times. This issue follows two items of news. First, WaIter Colquitt and Luther Welsh found the 'missed' Mersenne prime M110503 and advanced the frontier of complete Mp-testing to 139,267. In so doing, they terminated Slowinski's significant string of four consecutive
openaire
On the number of divisors of Mersenne numbers
13 pages, 5 figures, 2 tables; v4: incorporated editorial ...
Kovač, Vjekoslav, Luca, Florian
openaire +2 more sources
On the emergence of the Quanta Prime sequence
Arab Journal of Basic and Applied SciencesThis paper presents the Quanta Prime Sequence (QPS) and its foundational theorem, showcasing a unique class of polynomials with substantial implications.
Moustafa Ibrahim
doaj +1 more source
On Mersenne’s number 𝑀₁₉₉ and Lucas’s sequences [PDF]
Bulletin of the American Mathematical Society, 1947 On July 27, 1946 the writer finished calculating the 198th remainder of the Lucasian sequence 3, 7, 47, • • • as applied to the 60-digit Mersenne number 2 1 9 9 -1=80346 90221 29495 13777 09810 46170 ...
openaire +3 more sources
Electronic Fourier–Galois Spectrum Analyzer for the Field GF(31)
Applied SciencesA scheme for the Fourier–Galois spectrum analyzer for the field GF(31) is proposed. It is shown that this analyzer allows for solving a wide enough range of problems related to image processing, in particular those arising in the course of experimental ...
Kaisarali Kadyrzhan +5 more
doaj +1 more source
, 2022 Motivated by recently developed interest to the distribution of $q$-arydigits of Mersenne numbers $M_p = 2^p-1$, where $p$ is prime, we estimaterational exponential sums with $M_p$, $p \leq X$, modulo a large power of afixed odd prime $q$. In turn this immediately implies the normality of stringsof $q$-ary digits amongst about $(\log X)^{3/2+o(1 ...
Kerr, B. ; https://orcid.org/0000-0002-8829-372X +2 more
openaire +1 more source
On Mersenne’s number 𝑀₂₂₇ and cognate data [PDF]
Bulletin of the American Mathematical Society, 1948 condition XX-i /^^O. But ^2—^1 shows that this condition is not sufficient. Polya remarked that if (25) has infinitely many solutions we can not have a i^O, #1+02 se 0, • • • , # i+#2+ • • • +an^0t The characterization of the forms which satisfy (26) seems a difficult problem. Finally we mention two more questions: (1) Cantheinequal i t ies^ n +i-^n pk-
openaire +3 more sources
Prospects for the Use of Quasi-Mersen Numbers in the Design of Parallel-Serial Processors
Applied SciencesIt is shown that a serial-parallel processor, comparable in bit capacity to a 16-bit binary processor, can be implemented based on an algorithm built on the residue number system, a distinctive feature of which is the use of the first four quasi-Mersenne
Aruzhan Kadyrzhan +3 more
doaj +1 more source