Generation of nonrecursive 𝑛-bit pseudorandom numbers based on 𝛽-transformation on [1, 2) (𝑛 = 64, 128, 192, …, 8192)

Yaguchi Hirotake ()
Additional contact information
Yaguchi Hirotake: Ajina 4-32-7, Hatsukaichi City, Hiroshima Prefecture, 738-0054, Japan

Monte Carlo Methods and Applications, 2025, vol. 31, issue 3, 257-263

Abstract: We show that we can generate nonrecursive 𝑛-bit pseudorandom numbers using a simple algorithm whose essential computation is five times repetition of (𝑛-bit) × \times (𝑛-bit) multiplication and taking out an 𝑛-bit integer from the result of multiplication. The algorithm can be described by 𝛽-transformation T β ⁢ ( X ) = β ⁢ X − ⌊ β ⁢ X ⌋ + 1 , X ∈ [ 1 , 2 ) , β > 1 . T_{\beta}(X)=\beta X-\lfloor\beta X\rfloor+1,\quad X\in[1,2),\,\beta>1. We consider the condition that repetition of 𝛽-transformation generates random numbers, and see why our simple algorithm works well for various values of 𝑛

Keywords: Random number; pseudorandom number generation; nonrecursive; 𝛽-transformation (search for similar items in EconPapers)
Date: 2025
References: Add references at CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1515/mcma-2025-2015 (text/html)
For access to full text, subscription to the journal or payment for the individual article is required.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:bpj:mcmeap:v:31:y:2025:i:3:p:257-263:n:1006

Ordering information: This journal article can be ordered from
https://www.degruyte ... ournal/key/mcma/html

DOI: 10.1515/mcma-2025-2015

Access Statistics for this article

Monte Carlo Methods and Applications is currently edited by Karl K. Sabelfeld

More articles in Monte Carlo Methods and Applications from De Gruyter
Bibliographic data for series maintained by Peter Golla ().