Scribd Logo
Upload

Welcome to Scribd!

  • Mid Square Method

    Uploaded by

    Juan Ramon Garcia
    88 views8 pages
    This document describes a process called MOD-SQUARE for generating random numbers. It starts with an n-digit seed number that is squared, and the middle n digits are used as the next number. This number is then squared and the process repeats, generating a sequence of random numbers. The document shows that the original MID-SQUARE method converges on a constant, but the modified MOD-SQUARE adds neighboring digits to the middle digits at each step, preventing convergence and producing a more random sequence of numbers. Statistical tests are used to analyze the randomness of sequences generated by both methods.

    Original Description:

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document describes a process called MOD-SQUARE for generating random numbers. It starts with an n-digit seed number that is squared, and the middle n digits are used as the next number. This number is then squared and the process repeats, generating a sequence of random numbers. The document shows that the original MID-SQUARE method converges on a constant, but the modified MOD-SQUARE adds neighboring digits to the middle digits at each step, preventing convergence and producing a more random sequence of numbers. Statistical tests are used to analyze the randomness of sequences generated by both methods.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    88 views8 pages

    Mid Square Method

    Uploaded by

    Juan Ramon Garcia
    This document describes a process called MOD-SQUARE for generating random numbers. It starts with an n-digit seed number that is squared, and the middle n digits are used as the next number. This number is then squared and the process repeats, generating a sequence of random numbers. The document shows that the original MID-SQUARE method converges on a constant, but the modified MOD-SQUARE adds neighboring digits to the middle digits at each step, preventing convergence and producing a more random sequence of numbers. Statistical tests are used to analyze the randomness of sequences generated by both methods.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 8

    Starting with an n digit number, squaring it and taking the n digit in the middle as the next number, which

    is then squared to obtain the next number.


    E.g.: Seed= 5673, Square= 32182929. 1829 = 3345241

    Converge on a constant.
    Seed= 2500, Square= 6250000, 2500, 2500 Seed= 2504, Square= 6270016, 2700= 7290000, 2900= 8410000

    Starting with an n digit number, squaring it and taking the n digit in the middle as the random number.

    For the next seed, add the removing higher order and lower order digits to the middle n digit number (random number), which is then squared to obtain the next number.

    Seed, X0= 5673. 5673= 32182929. X1= 1829+3+2+2+9= 1845. 1845= 3404025. X2= 4040+3+2+5= 4050. 4050= 16402500. X3= 4025+ 1+6= 4032. Random Numbers= 1829, 4040, 4025, 2570

    Seed, X0= 5673 MID-SQUARE KS Test, D= 0.2536 Chi-Square, X0= 5.29 Runs Up & Down, Z= 0.366 Runs above & Below mean, Z=0.844
    Modified MOD-SQUARE
    KS Test, D= 0.3282 Chi-Square, X0= 5.31 Runs Up & Down, Z=

    0.188 Runs above & Below mean, Z= -0.161

    You might also like