IDEAS home Printed from https://ideas.repec.org/a/bpj/mcmeap/v31y2025i3p257-263n1006.html
   My bibliography  Save this article

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

Author

Listed:
  • Yaguchi Hirotake

    (Ajina 4-32-7, Hatsukaichi City, Hiroshima Prefecture, 738-0054, Japan)

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 𝑛

Suggested Citation

  • Yaguchi Hirotake, 2025. "Generation of nonrecursive 𝑛-bit pseudorandom numbers based on 𝛽-transformation on [1, 2) (𝑛 = 64, 128, 192, …, 8192)," Monte Carlo Methods and Applications, De Gruyter, vol. 31(3), pages 257-263.
  • Handle: RePEc:bpj:mcmeap:v:31:y:2025:i:3:p:257-263:n:1006
    DOI: 10.1515/mcma-2025-2015
    as

    Download full text from publisher

    File URL: https://doi.org/10.1515/mcma-2025-2015
    Download Restriction: For access to full text, subscription to the journal or payment for the individual article is required.

    File URL: https://libkey.io/10.1515/mcma-2025-2015?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to

    for a different version of it.

    More about this item

    Keywords

    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:bpj:mcmeap:v:31:y:2025:i:3:p:257-263:n:1006. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Peter Golla (email available below). General contact details of provider: https://www.degruyterbrill.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.