PHP实现线性同余法

<?php 
  function returnXianXinTongYu($count){
    $a = 9;
    $b = 7;
    $m = 1 << 31;
   
    $value = [];
    $value[0] =time();
    //$value[0] =100;


    for ($i = 1; $i < $count; $i++) {
        $value[$i] = (($a * $value[$i - 1] + $b) % $m);
    }
    
    foreach($value as $t=>$v){
        $value[$t] = sprintf('%.6f',$v / $m);
    }


    sort($value);
    return $value;
}

print_r(returnXianXinTongYu(10));

改造后（结合自己项目场景）：
<?php
function leyangjunReturnXianXinTongYu($count,$range=6){
    $a = 9;
    $b = 7;

    $m = 1 << 20;

    $value = [];
    //$value[0] =time();
    $value[0] =100;

    $result = [];
    for ($i = 1; $i <= $count; $i++) {
        $v = (($a * $value[$i - 1] + $b) % $m) ;
        $value[$i] = $v;
        $result[] = $v %$range + 1 ;
    }
    return $result;
}

print_r(leyangjunReturnXianXinTongYu(10));

随机返回：

Array
(
    [0] => 2
    [1] => 5
    [2] => 2
    [3] => 5
    [4] => 6
    [5] => 5
    [6] => 4
    [7] => 1
    [8] => 4
    [9] => 3
)