     :::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::
     ::             The  OVERLAPPING SUMS test                        ::
     :: Integers are floated to get a sequence U(1),U(2),... of       ::
     :: uniform (-.5,.5) variables.  Then overlapping sums,           ::
     ::   S(1)=U(1)+...+U(100), S2=U(2)+...+U(101),... are formed.    ::
     :: The S's are virtually normal with a certain covariance mat-   ::
     :: rix.  A linear transformation of the S's converts them to a   ::
     :: sequence of independent standard normals, which are converted ::
     :: to uniform variables for a KSTEST. The  p-values from ten     ::
     :: KSTESTs are given still another KSTEST.                       ::
     :::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::
                Test no.  1      p-value 0.952997
                Test no.  2      p-value 0.060855
                Test no.  3      p-value 0.700449
                Test no.  4      p-value 0.428861
                Test no.  5      p-value 0.849184
                Test no.  6      p-value 0.915614
                Test no.  7      p-value 0.783936
                Test no.  8      p-value 0.525417
                Test no.  9      p-value 0.652362
                Test no. 10      p-value 0.612462
   Results of the OSUM test for myfile.rnd
        KSTEST on the above 10 p-values: 0.826668

============================================================

     :::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::
     ::     This is the RUNS test.  It counts runs up, and runs down, ::
     :: in a sequence of uniform [0,1) variables, obtained by float-  ::
     :: ing the 32-bit integers in the specified file. This example   ::
     :: shows how runs are counted:  .123,.357,.789,.425,.224,.416,.95::
     :: contains an up-run of length 3, a down-run of length 2 and an ::
     :: up-run of (at least) 2, depending on the next values.  The    ::
     :: covariance matrices for the runs-up and runs-down are well    ::
     :: known, leading to chisquare tests for quadratic forms in the  ::
     :: weak inverses of the covariance matrices.  Runs are counted   ::
     :: for sequences of length 10,000.  This is done ten times. Then ::
     :: repeated.                                                     ::
     :::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::
           The RUNS test for file myfile.rnd
     Up and down runs in a sample of 10000
_________________________________________________
                 Run test for myfile.rnd:
       runs up; ks test for 10 p's:0.580421
     runs down; ks test for 10 p's:0.666931
                 Run test for myfile.rnd:
       runs up; ks test for 10 p's:0.404106
     runs down; ks test for 10 p's:0.581731

============================================================

     :::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::
     ::              THE 3D SPHERES TEST                              ::
     :: Choose  4000 random points in a cube of edge 1000.  At each   ::
     :: point, center a sphere large enough to reach the next closest ::
     :: point. Then the volume of the smallest such sphere is (very   ::
     :: close to) exponentially distributed with mean 120pi/3.  Thus  ::
     :: the radius cubed is exponential with mean 30. (The mean is    ::
     :: obtained by extensive simulation).  The 3DSPHERES test gener- ::
     :: ates 4000 such spheres 20 times.  Each min radius cubed leads ::
     :: to a uniform variable by means of 1-exp(-r^3/30.), then a     ::
     ::  KSTEST is done on the 20 p-values.                           ::
     :::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::
               The 3DSPHERES test for file myfile.rnd
 sample no:  1     r^3=   3.278     p-value=0.10351
 sample no:  2     r^3= 122.419     p-value=0.98310
 sample no:  3     r^3=   2.167     p-value=0.06968
 sample no:  4     r^3=  44.852     p-value=0.77576
 sample no:  5     r^3=  17.706     p-value=0.44577
 sample no:  6     r^3= 159.427     p-value=0.99508
 sample no:  7     r^3=   4.231     p-value=0.13153
 sample no:  8     r^3=   8.411     p-value=0.24449
 sample no:  9     r^3=   9.927     p-value=0.28172
 sample no: 10     r^3=   2.130     p-value=0.06854
 sample no: 11     r^3=   1.487     p-value=0.04835
 sample no: 12     r^3=  57.097     p-value=0.85091
 sample no: 13     r^3=  30.242     p-value=0.63508
 sample no: 14     r^3=  37.667     p-value=0.71508
 sample no: 15     r^3=   7.612     p-value=0.22410
 sample no: 16     r^3=   4.168     p-value=0.12973
 sample no: 17     r^3=  61.129     p-value=0.86967
 sample no: 18     r^3=  21.529     p-value=0.51209
 sample no: 19     r^3=  30.139     p-value=0.63382
 sample no: 20     r^3=  21.707     p-value=0.51499
  A KS test is applied to those 20 p-values.
---------------------------------------------------------
       3DSPHERES test for file myfile.rnd           p-value=0.497975

============================================================

     :::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::
     ::               THIS IS A PARKING LOT TEST                      ::
     :: In a square of side 100, randomly "park" a car---a circle of  ::
     :: radius 1.   Then try to park a 2nd, a 3rd, and so on, each    ::
     :: time parking "by ear".  That is, if an attempt to park a car  ::
     :: causes a crash with one already parked, try again at a new    ::
     :: random location. (To avoid path problems, consider parking    ::
     :: helicopters rather than cars.)   Each attempt leads to either ::
     :: a crash or a success, the latter followed by an increment to  ::
     :: the list of cars already parked. If we plot n:  the number of ::
     :: attempts, versus k::  the number successfully parked, we get a::
     :: curve that should be similar to those provided by a perfect   ::
     :: random number generator.  Theory for the behavior of such a   ::
     :: random curve seems beyond reach, and as graphics displays are ::
     :: not available for this battery of tests, a simple characteriz ::
     :: ation of the random experiment is used: k, the number of cars ::
     :: successfully parked after n=12,000 attempts. Simulation shows ::
     :: that k should average 3523 with sigma 21.9 and is very close  ::
     :: to normally distributed.  Thus (k-3523)/21.9 should be a st-  ::
     :: andard normal variable, which, converted to a uniform varia-  ::
     :: ble, provides input to a KSTEST based on a sample of 10.      ::
     :::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::
           CDPARK: result of ten tests on file myfile.rnd
            Of 12,000 tries, the average no. of successes
                 should be 3523 with sigma=21.9
            Successes: 3485    z-score: -1.735 p-value:0.041356
            Successes: 3530    z-score:  0.320 p-value:0.625377
            Successes: 3507    z-score: -0.731 p-value:0.232514
            Successes: 3545    z-score:  1.005 p-value:0.842447
            Successes: 3516    z-score: -0.320 p-value:0.374623
            Successes: 3514    z-score: -0.411 p-value:0.340551
            Successes: 3522    z-score: -0.046 p-value:0.481790
            Successes: 3518    z-score: -0.228 p-value:0.409702
            Successes: 3508    z-score: -0.685 p-value:0.246694
            Successes: 3541    z-score:  0.822 p-value:0.794438

           square size   avg. no.  parked   sample sigma
              100            3518.600       16.566
            KSTEST for the above 10: p= 0.296800

============================================================

     :::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::
     ::            This is the BIRTHDAY SPACINGS TEST                 ::
     :: Choose m birthdays in a year of n days.  List the spacings    ::
     :: between the birthdays.  If j is the number of values that     ::
     :: occur more than once in that list, then j is asymptotically   ::
     :: Poisson distributed with mean m^3/(4n).  Experience shows n   ::
     :: must be quite large, say n>=2^18, for comparing the results   ::
     :: to the Poisson distribution with that mean.  This test uses   ::
     :: n=2^24 and m=2^9,  so that the underlying distribution for j  ::
     :: is taken to be Poisson with lambda=2^27/(2^26)=2.  A sample   ::
     :: of 500 j's is taken, and a chi-square goodness of fit test    ::
     :: provides a p value.  The first test uses bits 1-24 (counting  ::
     :: from the left) from integers in the specified file.           ::
     ::   Then the file is closed and reopened. Next, bits 2-25 are   ::
     :: used to provide birthdays, then 3-26 and so on to bits 9-32.  ::
     :: Each set of bits provides a p-value, and the nine p-values    ::
     :: provide a sample for a KSTEST.                                ::
     :::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::
 BIRTHDAY SPACINGS TEST, M= 512 N=2**24 LAMBDA=  2.0000
           Results for myfile.rnd
                   For a sample of size 500:     mean
          myfile.rnd       using bits  1 to 24   1.878
  duplicate       number       number
  spacings       observed     expected
        0          85        67.668
        1         139       135.335
        2         122       135.335
        3          83        90.224
        4          53        45.112
        5          13        18.045
  6 to INF          5         8.282
 Chisquare with  6 d.o.f. =    10.52 p-value= 0.895650
  :::::::::::::::::::::::::::::::::::::::::
                   For a sample of size 500:     mean
          myfile.rnd       using bits  2 to 25   2.044
  duplicate       number       number
  spacings       observed     expected
        0          66        67.668
        1         132       135.335
        2         131       135.335
        3          94        90.224
        4          53        45.112
        5          15        18.045
  6 to INF          9         8.282
 Chisquare with  6 d.o.f. =     2.38 p-value= 0.117878
  :::::::::::::::::::::::::::::::::::::::::
                   For a sample of size 500:     mean
          myfile.rnd       using bits  3 to 26   1.940
  duplicate       number       number
  spacings       observed     expected
        0          63        67.668
        1         158       135.335
        2         137       135.335
        3          74        90.224
        4          39        45.112
        5          17        18.045
  6 to INF         12         8.282
 Chisquare with  6 d.o.f. =     9.61 p-value= 0.858084
  :::::::::::::::::::::::::::::::::::::::::
                   For a sample of size 500:     mean
          myfile.rnd       using bits  4 to 27   1.988
  duplicate       number       number
  spacings       observed     expected
        0          67        67.668
        1         146       135.335
        2         125       135.335
        3          87        90.224
        4          46        45.112
        5          23        18.045
  6 to INF          6         8.282
 Chisquare with  6 d.o.f. =     3.76 p-value= 0.290668
  :::::::::::::::::::::::::::::::::::::::::
                   For a sample of size 500:     mean
          myfile.rnd       using bits  5 to 28   1.898
  duplicate       number       number
  spacings       observed     expected
        0          71        67.668
        1         148       135.335
        2         131       135.335
        3          84        90.224
        4          48        45.112
        5          13        18.045
  6 to INF          5         8.282
 Chisquare with  6 d.o.f. =     4.81 p-value= 0.432009
  :::::::::::::::::::::::::::::::::::::::::
                   For a sample of size 500:     mean
          myfile.rnd       using bits  6 to 29   1.960
  duplicate       number       number
  spacings       observed     expected
        0          69        67.668
        1         125       135.335
        2         148       135.335
        3          93        90.224
        4          48        45.112
        5          14        18.045
  6 to INF          3         8.282
 Chisquare with  6 d.o.f. =     6.55 p-value= 0.635141
  :::::::::::::::::::::::::::::::::::::::::
                   For a sample of size 500:     mean
          myfile.rnd       using bits  7 to 30   1.930
  duplicate       number       number
  spacings       observed     expected
        0          68        67.668
        1         146       135.335
        2         137       135.335
        3          85        90.224
        4          38        45.112
        5          20        18.045
  6 to INF          6         8.282
 Chisquare with  6 d.o.f. =     3.13 p-value= 0.207207
  :::::::::::::::::::::::::::::::::::::::::
                   For a sample of size 500:     mean
          myfile.rnd       using bits  8 to 31   1.988
  duplicate       number       number
  spacings       observed     expected
        0          67        67.668
        1         143       135.335
        2         127       135.335
        3          91        90.224
        4          46        45.112
        5          19        18.045
  6 to INF          7         8.282
 Chisquare with  6 d.o.f. =     1.23 p-value= 0.024479
  :::::::::::::::::::::::::::::::::::::::::
                   For a sample of size 500:     mean
          myfile.rnd       using bits  9 to 32   2.018
  duplicate       number       number
  spacings       observed     expected
        0          76        67.668
        1         116       135.335
        2         141       135.335
        3          89        90.224
        4          57        45.112
        5          14        18.045
  6 to INF          7         8.282
 Chisquare with  6 d.o.f. =     8.28 p-value= 0.781703
  :::::::::::::::::::::::::::::::::::::::::
   The 9 p-values were
      0.895650   0.117878   0.858084   0.290668   0.432009 
      0.635141   0.207207   0.024479   0.781703 
  A KSTEST for the 9 p-values yields 0.048803

============================================================

     :::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::
     ::     This is the COUNT-THE-1's TEST for specific bytes.        ::
     :: Consider the file under test as a stream of 32-bit integers.  ::
     :: From each integer, a specific byte is chosen , say the left-  ::
     :: most::  bits 1 to 8. Each byte can contain from 0 to 8 1's,   ::
     :: with probabilitie 1,8,28,56,70,56,28,8,1 over 256.  Now let   ::
     :: the specified bytes from successive integers provide a string ::
     :: of (overlapping) 5-letter words, each "letter" taking values  ::
     :: A,B,C,D,E. The letters are determined  by the number of 1's,  ::
     :: in that byte::  0,1,or 2 ---> A, 3 ---> B, 4 ---> C, 5 ---> D,::
     :: and  6,7 or 8 ---> E.  Thus we have a monkey at a typewriter  ::
     :: hitting five keys with with various probabilities::  37,56,70,::
     :: 56,37 over 256. There are 5^5 possible 5-letter words, and    ::
     :: from a string of 256,000 (overlapping) 5-letter words, counts ::
     :: are made on the frequencies for each word. The quadratic form ::
     :: in the weak inverse of the covariance matrix of the cell      ::
     :: counts provides a chisquare test::  Q5-Q4, the difference of  ::
     :: the naive Pearson  sums of (OBS-EXP)^2/EXP on counts for 5-   ::
     :: and 4-letter cell counts.                                     ::
     :::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::
   Test results for myfile.rnd
  Results for COUNT-THE-1's in specified bytes:
 Chi-square with 5^5-5^4=2500 d.of f. for sample size: 256000
                        chisquare  equiv normal  p value
           bits  1 to  8  2494.01     -0.085     0.466238
           bits  2 to  9  2676.48      2.496     0.993717
           bits  3 to 10  2480.69     -0.273     0.392409
           bits  4 to 11  2652.13      2.151     0.984278
           bits  5 to 12  2481.75     -0.258     0.398186
           bits  6 to 13  2588.41      1.250     0.894401
           bits  7 to 14  2432.10     -0.960     0.168468
           bits  8 to 15  2575.64      1.070     0.857634
           bits  9 to 16  2440.54     -0.841     0.200198
           bits 10 to 17  2522.84      0.323     0.626663
           bits 11 to 18  2641.19      1.997     0.977069
           bits 12 to 19  2453.43     -0.659     0.255098
           bits 13 to 20  2441.25     -0.831     0.203045
           bits 14 to 21  2609.78      1.552     0.939726
           bits 15 to 22  2465.21     -0.492     0.311378
           bits 16 to 23  2712.89      3.011     0.998697
           bits 17 to 24  2537.39      0.529     0.701521
           bits 18 to 25  2538.03      0.538     0.704647
           bits 19 to 26  2495.48     -0.064     0.474522
           bits 20 to 27  2618.18      1.671     0.952671
           bits 21 to 28  2561.84      0.875     0.809078
           bits 22 to 29  2660.48      2.270     0.988382
           bits 23 to 30  2554.49      0.771     0.779520
           bits 24 to 31  2533.75      0.477     0.683417
           bits 25 to 32  2379.51     -1.704     0.044189

============================================================

     :::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::
     :: This is the BINARY RANK TEST for 6x8 matrices.  From each of  ::
     :: six random 32-bit integers from the generator under test, a   ::
     :: specified byte is chosen, and the resulting six bytes form a  ::
     :: 6x8 binary matrix whose rank is determined.  That rank can be ::
     :: from 0 to 6, but ranks 0,1,2,3 are rare; their counts are     ::
     :: pooled with those for rank 4. Ranks are found for 100,000     ::
     :: random matrices, and a chi-square test is performed on        ::
     :: counts for ranks 6,5 and <=4.                                 ::
     :::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::
         Binary Rank Test for myfile.rnd
        Rank of a 6x8 binary matrix,
     rows formed from eight bits of the RNG myfile.rnd
     b-rank test for bits  1 to  8
                     OBSERVED   EXPECTED     (O-E)^2/E      SUM
          r<=4          911       944.3       1.174       1.174
          r =5        21705     21743.9       0.070       1.244
          r =6        77384     77311.8       0.067       1.311
                        p=1-exp(-SUM/2)=0.48092
        Rank of a 6x8 binary matrix,
     rows formed from eight bits of the RNG myfile.rnd
     b-rank test for bits  2 to  9
                     OBSERVED   EXPECTED     (O-E)^2/E      SUM
          r<=4          957       944.3       0.171       0.171
          r =5        21697     21743.9       0.101       0.272
          r =6        77346     77311.8       0.015       0.287
                        p=1-exp(-SUM/2)=0.13370
        Rank of a 6x8 binary matrix,
     rows formed from eight bits of the RNG myfile.rnd
     b-rank test for bits  3 to 10
                     OBSERVED   EXPECTED     (O-E)^2/E      SUM
          r<=4          947       944.3       0.008       0.008
          r =5        21730     21743.9       0.009       0.017
          r =6        77323     77311.8       0.002       0.018
                        p=1-exp(-SUM/2)=0.00907
        Rank of a 6x8 binary matrix,
     rows formed from eight bits of the RNG myfile.rnd
     b-rank test for bits  4 to 11
                     OBSERVED   EXPECTED     (O-E)^2/E      SUM
          r<=4          970       944.3       0.699       0.699
          r =5        21562     21743.9       1.522       2.221
          r =6        77468     77311.8       0.316       2.537
                        p=1-exp(-SUM/2)=0.71870
        Rank of a 6x8 binary matrix,
     rows formed from eight bits of the RNG myfile.rnd
     b-rank test for bits  5 to 12
                     OBSERVED   EXPECTED     (O-E)^2/E      SUM
          r<=4          907       944.3       1.473       1.473
          r =5        21947     21743.9       1.897       3.371
          r =6        77146     77311.8       0.356       3.726
                        p=1-exp(-SUM/2)=0.84480
        Rank of a 6x8 binary matrix,
     rows formed from eight bits of the RNG myfile.rnd
     b-rank test for bits  6 to 13
                     OBSERVED   EXPECTED     (O-E)^2/E      SUM
          r<=4          916       944.3       0.848       0.848
          r =5        21732     21743.9       0.007       0.855
          r =6        77352     77311.8       0.021       0.876
                        p=1-exp(-SUM/2)=0.35455
        Rank of a 6x8 binary matrix,
     rows formed from eight bits of the RNG myfile.rnd
     b-rank test for bits  7 to 14
                     OBSERVED   EXPECTED     (O-E)^2/E      SUM
          r<=4          940       944.3       0.020       0.020
          r =5        21470     21743.9       3.450       3.470
          r =6        77590     77311.8       1.001       4.471
                        p=1-exp(-SUM/2)=0.89306
        Rank of a 6x8 binary matrix,
     rows formed from eight bits of the RNG myfile.rnd
     b-rank test for bits  8 to 15
                     OBSERVED   EXPECTED     (O-E)^2/E      SUM
          r<=4          971       944.3       0.755       0.755
          r =5        21796     21743.9       0.125       0.880
          r =6        77233     77311.8       0.080       0.960
                        p=1-exp(-SUM/2)=0.38122
        Rank of a 6x8 binary matrix,
     rows formed from eight bits of the RNG myfile.rnd
     b-rank test for bits  9 to 16
                     OBSERVED   EXPECTED     (O-E)^2/E      SUM
          r<=4          946       944.3       0.003       0.003
          r =5        21627     21743.9       0.628       0.632
          r =6        77427     77311.8       0.172       0.803
                        p=1-exp(-SUM/2)=0.33075
        Rank of a 6x8 binary matrix,
     rows formed from eight bits of the RNG myfile.rnd
     b-rank test for bits 10 to 17
                     OBSERVED   EXPECTED     (O-E)^2/E      SUM
          r<=4          964       944.3       0.411       0.411
          r =5        21794     21743.9       0.115       0.526
          r =6        77242     77311.8       0.063       0.589
                        p=1-exp(-SUM/2)=0.25524
        Rank of a 6x8 binary matrix,
     rows formed from eight bits of the RNG myfile.rnd
     b-rank test for bits 11 to 18
                     OBSERVED   EXPECTED     (O-E)^2/E      SUM
          r<=4          991       944.3       2.309       2.309
          r =5        21785     21743.9       0.078       2.387
          r =6        77224     77311.8       0.100       2.487
                        p=1-exp(-SUM/2)=0.71160
        Rank of a 6x8 binary matrix,
     rows formed from eight bits of the RNG myfile.rnd
     b-rank test for bits 12 to 19
                     OBSERVED   EXPECTED     (O-E)^2/E      SUM
          r<=4         1007       944.3       4.163       4.163
          r =5        21756     21743.9       0.007       4.170
          r =6        77237     77311.8       0.072       4.242
                        p=1-exp(-SUM/2)=0.88010
        Rank of a 6x8 binary matrix,
     rows formed from eight bits of the RNG myfile.rnd
     b-rank test for bits 13 to 20
                     OBSERVED   EXPECTED     (O-E)^2/E      SUM
          r<=4          935       944.3       0.092       0.092
          r =5        21784     21743.9       0.074       0.166
          r =6        77281     77311.8       0.012       0.178
                        p=1-exp(-SUM/2)=0.08508
        Rank of a 6x8 binary matrix,
     rows formed from eight bits of the RNG myfile.rnd
     b-rank test for bits 14 to 21
                     OBSERVED   EXPECTED     (O-E)^2/E      SUM
          r<=4          923       944.3       0.481       0.481
          r =5        22011     21743.9       3.281       3.762
          r =6        77066     77311.8       0.781       4.543
                        p=1-exp(-SUM/2)=0.89684
        Rank of a 6x8 binary matrix,
     rows formed from eight bits of the RNG myfile.rnd
     b-rank test for bits 15 to 22
                     OBSERVED   EXPECTED     (O-E)^2/E      SUM
          r<=4          934       944.3       0.112       0.112
          r =5        21634     21743.9       0.555       0.668
          r =6        77432     77311.8       0.187       0.855
                        p=1-exp(-SUM/2)=0.34777
        Rank of a 6x8 binary matrix,
     rows formed from eight bits of the RNG myfile.rnd
     b-rank test for bits 16 to 23
                     OBSERVED   EXPECTED     (O-E)^2/E      SUM
          r<=4          937       944.3       0.056       0.056
          r =5        21624     21743.9       0.661       0.718
          r =6        77439     77311.8       0.209       0.927
                        p=1-exp(-SUM/2)=0.37089
        Rank of a 6x8 binary matrix,
     rows formed from eight bits of the RNG myfile.rnd
     b-rank test for bits 17 to 24
                     OBSERVED   EXPECTED     (O-E)^2/E      SUM
          r<=4          951       944.3       0.048       0.048
          r =5        21642     21743.9       0.478       0.525
          r =6        77407     77311.8       0.117       0.642
                        p=1-exp(-SUM/2)=0.27468
        Rank of a 6x8 binary matrix,
     rows formed from eight bits of the RNG myfile.rnd
     b-rank test for bits 18 to 25
                     OBSERVED   EXPECTED     (O-E)^2/E      SUM
          r<=4          938       944.3       0.042       0.042
          r =5        21715     21743.9       0.038       0.080
          r =6        77347     77311.8       0.016       0.096
                        p=1-exp(-SUM/2)=0.04710
        Rank of a 6x8 binary matrix,
     rows formed from eight bits of the RNG myfile.rnd
     b-rank test for bits 19 to 26
                     OBSERVED   EXPECTED     (O-E)^2/E      SUM
          r<=4          913       944.3       1.038       1.038
          r =5        21692     21743.9       0.124       1.161
          r =6        77395     77311.8       0.090       1.251
                        p=1-exp(-SUM/2)=0.46500
        Rank of a 6x8 binary matrix,
     rows formed from eight bits of the RNG myfile.rnd
     b-rank test for bits 20 to 27
                     OBSERVED   EXPECTED     (O-E)^2/E      SUM
          r<=4          907       944.3       1.473       1.473
          r =5        21619     21743.9       0.717       2.191
          r =6        77474     77311.8       0.340       2.531
                        p=1-exp(-SUM/2)=0.71793
        Rank of a 6x8 binary matrix,
     rows formed from eight bits of the RNG myfile.rnd
     b-rank test for bits 21 to 28
                     OBSERVED   EXPECTED     (O-E)^2/E      SUM
          r<=4          940       944.3       0.020       0.020
          r =5        21713     21743.9       0.044       0.064
          r =6        77347     77311.8       0.016       0.080
                        p=1-exp(-SUM/2)=0.03898
        Rank of a 6x8 binary matrix,
     rows formed from eight bits of the RNG myfile.rnd
     b-rank test for bits 22 to 29
                     OBSERVED   EXPECTED     (O-E)^2/E      SUM
          r<=4          955       944.3       0.121       0.121
          r =5        21535     21743.9       2.007       2.128
          r =6        77510     77311.8       0.508       2.636
                        p=1-exp(-SUM/2)=0.73237
        Rank of a 6x8 binary matrix,
     rows formed from eight bits of the RNG myfile.rnd
     b-rank test for bits 23 to 30
                     OBSERVED   EXPECTED     (O-E)^2/E      SUM
          r<=4          952       944.3       0.063       0.063
          r =5        21826     21743.9       0.310       0.373
          r =6        77222     77311.8       0.104       0.477
                        p=1-exp(-SUM/2)=0.21222
        Rank of a 6x8 binary matrix,
     rows formed from eight bits of the RNG myfile.rnd
     b-rank test for bits 24 to 31
                     OBSERVED   EXPECTED     (O-E)^2/E      SUM
          r<=4          911       944.3       1.174       1.174
          r =5        21942     21743.9       1.805       2.979
          r =6        77147     77311.8       0.351       3.330
                        p=1-exp(-SUM/2)=0.81086
        Rank of a 6x8 binary matrix,
     rows formed from eight bits of the RNG myfile.rnd
     b-rank test for bits 25 to 32
                     OBSERVED   EXPECTED     (O-E)^2/E      SUM
          r<=4          966       944.3       0.499       0.499
          r =5        21814     21743.9       0.226       0.725
          r =6        77220     77311.8       0.109       0.834
                        p=1-exp(-SUM/2)=0.34085
   TEST SUMMARY, 25 tests on 100,000 random 6x8 matrices
 These should be 25 uniform [0,1] random variables:
    0.480922    0.133705    0.009069    0.718699    0.844800
    0.354552    0.893055    0.381223    0.330749    0.255238
    0.711598    0.880095    0.085081    0.896844    0.347772
    0.370886    0.274681    0.047098    0.464999    0.717929
    0.038985    0.732369    0.212216    0.810855    0.340849
   brank test summary for myfile.rnd
       The KS test for those 25 supposed UNI's yields
                    KS p-value=0.447643
============================================================

     :::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::
     :: This is the BINARY RANK TEST for 31x31 matrices. The leftmost ::
     :: 31 bits of 31 random integers from the test sequence are used ::
     :: to form a 31x31 binary matrix over the field {0,1}. The rank  ::
     :: is determined. That rank can be from 0 to 31, but ranks< 28   ::
     :: are rare, and their counts are pooled with those for rank 28. ::
     :: Ranks are found for 40,000 such random matrices and a chisqua-::
     :: re test is performed on counts for ranks 31,30,29 and <=28.   ::
     :::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::
  Binary rank test for myfile.rnd
  Rank test for 31x31 binary matrices:
  rows from leftmost 31 bits of each 32-bit integer
      rank   observed  expected (o-e)^2/e  sum
        28       199     211.4  0.729394    0.729
        29      5194    5134.0  0.700959    1.430
        30     23077   23103.0  0.029367    1.460
        31     11530   11551.5  0.040105    1.500
  chisquare= 1.500 for 3 d. of f.; p-value=0.428039
--------------------------------------------------------------
     :::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::
     :: This is the BINARY RANK TEST for 32x32 matrices. A random 32x ::
     :: 32 binary matrix is formed, each row a 32-bit random integer. ::
     :: The rank is determined. That rank can be from 0 to 32, ranks  ::
     :: less than 29 are rare, and their counts are pooled with those ::
     :: for rank 29.  Ranks are found for 40,000 such random matrices ::
     :: and a chisquare test is performed on counts for ranks  32,31, ::
     :: 30 and <=29.                                                  ::
     :::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::
  Binary rank test for myfile.rnd
  Rank test for 32x32 binary matrices:
  rows from leftmost 32 bits of each 32-bit integer
      rank   observed  expected (o-e)^2/e  sum
        29       227     211.4  1.148429    1.148
        30      5121    5134.0  0.032971    1.181
        31     23047   23103.0  0.135971    1.317
        32     11605   11551.5  0.247561    1.565
  chisquare= 1.565 for 3 d. of f.; p-value=0.438105

============================================================

     :::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::
     ::     This is the COUNT-THE-1's TEST on a stream of bytes.      ::
     :: Consider the file under test as a stream of bytes (four per   ::
     :: 32 bit integer).  Each byte can contain from 0 to 8 1's,      ::
     :: with probabilities 1,8,28,56,70,56,28,8,1 over 256.  Now let  ::
     :: the stream of bytes provide a string of overlapping  5-letter ::
     :: words, each "letter" taking values A,B,C,D,E. The letters are ::
     :: determined by the number of 1's in a byte::  0,1,or 2 yield A,::
     :: 3 yields B, 4 yields C, 5 yields D and 6,7 or 8 yield E. Thus ::
     :: we have a monkey at a typewriter hitting five keys with vari- ::
     :: ous probabilities (37,56,70,56,37 over 256).  There are 5^5   ::
     :: possible 5-letter words, and from a string of 256,000 (over-  ::
     :: lapping) 5-letter words, counts are made on the frequencies   ::
     :: for each word.   The quadratic form in the weak inverse of    ::
     :: the covariance matrix of the cell counts provides a chisquare ::
     :: test::  Q5-Q4, the difference of the naive Pearson sums of    ::
     :: (OBS-EXP)^2/EXP on counts for 5- and 4-letter cell counts.    ::
     :::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::
   Test results for myfile.rnd
 Chi-square with 5^5-5^4=2500 d.of f. for sample size:2560000
  Results for COUNT-THE-1's in successive bytes:
                               chisquare  equiv normal  p-value
 byte stream for myfile.rnd       2517.62      0.249     0.598409
 byte stream for myfile.rnd       2535.33      0.500     0.691352

============================================================

     :::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::
     ::                   THE BITSTREAM TEST                          ::
     :: The file under test is viewed as a stream of bits. Call them  ::
     :: b1,b2,... .  Consider an alphabet with two "letters", 0 and 1 ::
     :: and think of the stream of bits as a succession of 20-letter  ::
     :: "words", overlapping.  Thus the first word is b1b2...b20, the ::
     :: second is b2b3...b21, and so on.  The bitstream test counts   ::
     :: the number of missing 20-letter (20-bit) words in a string of ::
     :: 2^21 overlapping 20-letter words.  There are 2^20 possible 20 ::
     :: letter words.  For a truly random string of 2^21+19 bits, the ::
     :: number of missing words j should be (very close to) normally  ::
     :: distributed with mean 141,909 and sigma 428.  Thus            ::
     ::  (j-141909)/428 should be a standard normal variate (z score) ::
     :: that leads to a uniform [0,1) p value.  The test is repeated  ::
     :: twenty times.                                                 ::
     :::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::
       THE OVERLAPPING 20-tuples BITSTREAM TEST,
            20 BITS PER WORD, 2^21 words.
    This test samples the bitstream 20 times.
 BITSTREAM test results for myfile.rnd
  No. missing words should average    141909 with sigma=428
-----------------------------------        ---------------
 tst no  1:  141521 missing words,   -0.91 sigmas from mean, p-value=0.18212
 tst no  2:  142452 missing words,    1.27 sigmas from mean, p-value=0.89759
 tst no  3:  142146 missing words,    0.55 sigmas from mean, p-value=0.70986
 tst no  4:  141672 missing words,   -0.55 sigmas from mean, p-value=0.28962
 tst no  5:  142425 missing words,    1.20 sigmas from mean, p-value=0.88587
 tst no  6:  141497 missing words,   -0.96 sigmas from mean, p-value=0.16768
 tst no  7:  142641 missing words,    1.71 sigmas from mean, p-value=0.95632
 tst no  8:  141984 missing words,    0.17 sigmas from mean, p-value=0.56925
 tst no  9:  142200 missing words,    0.68 sigmas from mean, p-value=0.75147
 tst no 10:  141119 missing words,   -1.85 sigmas from mean, p-value=0.03241
 tst no 11:  141862 missing words,   -0.11 sigmas from mean, p-value=0.45597
 tst no 12:  141773 missing words,   -0.32 sigmas from mean, p-value=0.37504
 tst no 13:  141590 missing words,   -0.75 sigmas from mean, p-value=0.22780
 tst no 14:  142160 missing words,    0.59 sigmas from mean, p-value=0.72095
 tst no 15:  141707 missing words,   -0.47 sigmas from mean, p-value=0.31820
 tst no 16:  141766 missing words,   -0.33 sigmas from mean, p-value=0.36886
 tst no 17:  143178 missing words,    2.96 sigmas from mean, p-value=0.99848
 tst no 18:  142395 missing words,    1.13 sigmas from mean, p-value=0.87176
 tst no 19:  141850 missing words,   -0.14 sigmas from mean, p-value=0.44487
 tst no 20:  140937 missing words,   -2.27 sigmas from mean, p-value=0.01155

============================================================

     :::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::
     :: This is the CRAPS TEST. It plays 200,000 games of craps, finds::
     :: the number of wins and the number of throws necessary to end  ::
     :: each game.  The number of wins should be (very close to) a    ::
     :: normal with mean 200000p and variance 200000p(1-p), with      ::
     :: p=244/495.  Throws necessary to complete the game can vary    ::
     :: from 1 to infinity, but counts for all>21 are lumped with 21. ::
     :: A chi-square test is made on the no.-of-throws cell counts.   ::
     :: Each 32-bit integer from the test file provides the value for ::
     :: the throw of a die, by floating to [0,1), multiplying by 6    ::
     :: and taking 1 plus the integer part of the result.             ::
     :::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::
                Results of craps test for myfile.rnd
  No. of wins:  Observed Expected
                                98253    98585.86
                  98253= No. of wins, z-score=-1.489 pvalue=0.06828
   Analysis of Throws-per-Game:
 Chisq=  22.83 for 20 degrees of freedom, p= 0.70282
               Throws Observed Expected  Chisq     Sum
                  1    66590    66666.7   0.088    0.088
                  2    37715    37654.3   0.098    0.186
                  3    26813    26954.7   0.745    0.931
                  4    19503    19313.5   1.860    2.791
                  5    13905    13851.4   0.207    2.999
                  6     9967     9943.5   0.055    3.054
                  7     7107     7145.0   0.202    3.256
                  8     5158     5139.1   0.070    3.326
                  9     3641     3699.9   0.937    4.263
                 10     2659     2666.3   0.020    4.282
                 11     1904     1923.3   0.194    4.477
                 12     1373     1388.7   0.178    4.655
                 13     1015     1003.7   0.127    4.782
                 14      676      726.1   3.462    8.244
                 15      579      525.8   5.375   13.619
                 16      336      381.2   5.348   18.968
                 17      284      276.5   0.201   19.169
                 18      196      200.8   0.116   19.285
                 19      157      146.0   0.831   20.116
                 20      107      106.2   0.006   20.122
                 21      315      287.1   2.708   22.831
            SUMMARY  FOR myfile.rnd
                p-value for no. of wins:0.068278
                p-value for throws/game:0.702818

============================================================

     :::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::
     ::               THE MINIMUM DISTANCE TEST                       ::
     :: It does this 100 times::   choose n=8000 random points in a   ::
     :: square of side 10000.  Find d, the minimum distance between   ::
     :: the (n^2-n)/2 pairs of points.  If the points are truly inde- ::
     :: pendent uniform, then d^2, the square of the minimum distance ::
     :: should be (very close to) exponentially distributed with mean ::
     :: .995 .  Thus 1-exp(-d^2/.995) should be uniform on [0,1) and  ::
     :: a KSTEST on the resulting 100 values serves as a test of uni- ::
     :: formity for random points in the square. Test numbers=0 mod 5 ::
     :: are printed but the KSTEST is based on the full set of 100    ::
     :: random choices of 8000 points in the 10000x10000 square.      ::
     :::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::
               This is the MINIMUM DISTANCE test
              for random integers in the file myfile.rnd
     Sample no.    d^2     avg     equiv uni            
           5    0.4524   0.4522    0.365358
          10    0.0991   0.5736    0.094765
          15    0.5696   0.5793    0.435886
          20    0.3339   0.7227    0.285062
          25    0.5194   0.7371    0.406688
          30    1.2337   0.8440    0.710587
          35    1.5646   0.8311    0.792472
          40    0.6244   0.8338    0.466114
          45    0.4782   0.7910    0.381564
          50    1.2262   0.8604    0.708388
          55    0.2521   0.8623    0.223833
          60    0.5608   0.9329    0.430845
          65    0.0144   0.9041    0.014370
          70    1.9278   0.9097    0.855939
          75    1.4561   0.9186    0.768562
          80    1.1299   0.9226    0.678778
          85    0.9206   0.9496    0.603575
          90    1.1958   0.9313    0.699363
          95    1.7581   0.9313    0.829147
         100    0.4306   0.9207    0.351278
     MINIMUM DISTANCE TEST for myfile.rnd
          Result of KS test on 20 transformed mindist^2's:
                                  p-value=0.772951

============================================================

     :::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::
     ::            THE OVERLAPPING 5-PERMUTATION TEST                 ::
     :: This is the OPERM5 test.  It looks at a sequence of one mill- ::
     :: ion 32-bit random integers.  Each set of five consecutive     ::
     :: integers can be in one of 120 states, for the 5! possible or- ::
     :: derings of five numbers.  Thus the 5th, 6th, 7th,...numbers   ::
     :: each provide a state. As many thousands of state transitions  ::
     :: are observed,  cumulative counts are made of the number of    ::
     :: occurences of each state.  Then the quadratic form in the     ::
     :: weak inverse of the 120x120 covariance matrix yields a test   ::
     :: equivalent to the likelihood ratio test that the 120 cell     ::
     :: counts came from the specified (asymptotically) normal dis-   ::
     :: tribution with the specified 120x120 covariance matrix (with  ::
     :: rank 99).  This version uses 1,000,000 integers, twice.       ::
     :::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::
           OPERM5 test for file myfile.rnd
     For a sample of 1,000,000 consecutive 5-tuples,
 chisquare for 99 degrees of freedom=100.496; p-value=0.560856
           OPERM5 test for file myfile.rnd
     For a sample of 1,000,000 consecutive 5-tuples,
 chisquare for 99 degrees of freedom= 74.322; p-value=0.030297

============================================================

     :::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::
     ::             The tests OPSO, OQSO and DNA                      ::
     ::         OPSO means Overlapping-Pairs-Sparse-Occupancy         ::
     :: The OPSO test considers 2-letter words from an alphabet of    ::
     :: 1024 letters.  Each letter is determined by a specified ten   ::
     :: bits from a 32-bit integer in the sequence to be tested. OPSO ::
     :: generates  2^21 (overlapping) 2-letter words  (from 2^21+1    ::
     :: "keystrokes")  and counts the number of missing words---that  ::
     :: is 2-letter words which do not appear in the entire sequence. ::
     :: That count should be very close to normally distributed with  ::
     :: mean 141,909, sigma 290. Thus (missingwrds-141909)/290 should ::
     :: be a standard normal variable. The OPSO test takes 32 bits at ::
     :: a time from the test file and uses a designated set of ten    ::
     :: consecutive bits. It then restarts the file for the next de-  ::
     :: signated 10 bits, and so on.                                  ::
     ::                                                               ::
     ::     OQSO means Overlapping-Quadruples-Sparse-Occupancy        ::
     ::   The test OQSO is similar, except that it considers 4-letter ::
     :: words from an alphabet of 32 letters, each letter determined  ::
     :: by a designated string of 5 consecutive bits from the test    ::
     :: file, elements of which are assumed 32-bit random integers.   ::
     :: The mean number of missing words in a sequence of 2^21 four-  ::
     :: letter words,  (2^21+3 "keystrokes"), is again 141909, with   ::
     :: sigma = 295.  The mean is based on theory; sigma comes from   ::
     :: extensive simulation.                                         ::
     ::                                                               ::
     ::    The DNA test considers an alphabet of 4 letters::  C,G,A,T,::
     :: determined by two designated bits in the sequence of random   ::
     :: integers being tested.  It considers 10-letter words, so that ::
     :: as in OPSO and OQSO, there are 2^20 possible words, and the   ::
     :: mean number of missing words from a string of 2^21  (over-    ::
     :: lapping)  10-letter  words (2^21+9 "keystrokes") is 141909.   ::
     :: The standard deviation sigma=339 was determined as for OQSO   ::
     :: by simulation.  (Sigma for OPSO, 290, is the true value (to   ::
     :: three places), not determined by simulation.                  ::
     :::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::
 OPSO test for generator myfile.rnd
  Output: No. missing words (mw), equiv normal variate (z), p-value (p)
                                                       mw      z     p
    OPSO for myfile.rnd      using bits 23 to 32        142517    2.095 0.9819
    OPSO for myfile.rnd      using bits 22 to 31        141386   -1.805 0.0356
    OPSO for myfile.rnd      using bits 21 to 30        141623   -0.987 0.1617
    OPSO for myfile.rnd      using bits 20 to 29        142271    1.247 0.8938
    OPSO for myfile.rnd      using bits 19 to 28        141824   -0.294 0.3843
    OPSO for myfile.rnd      using bits 18 to 27        142536    2.161 0.9846
    OPSO for myfile.rnd      using bits 17 to 26        142322    1.423 0.9226
    OPSO for myfile.rnd      using bits 16 to 25        141879   -0.105 0.4584
    OPSO for myfile.rnd      using bits 15 to 24        143096    4.092 1.0000
    OPSO for myfile.rnd      using bits 14 to 23        142057    0.509 0.6947
    OPSO for myfile.rnd      using bits 13 to 22        141931    0.075 0.5298
    OPSO for myfile.rnd      using bits 12 to 21        142089    0.620 0.7322
    OPSO for myfile.rnd      using bits 11 to 20        142097    0.647 0.7412
    OPSO for myfile.rnd      using bits 10 to 19        142155    0.847 0.8015
    OPSO for myfile.rnd      using bits  9 to 18        142036    0.437 0.6689
    OPSO for myfile.rnd      using bits  8 to 17        142232    1.113 0.8671
    OPSO for myfile.rnd      using bits  7 to 16        141757   -0.525 0.2997
    OPSO for myfile.rnd      using bits  6 to 15        142289    1.309 0.9048
    OPSO for myfile.rnd      using bits  5 to 14        142413    1.737 0.9588
    OPSO for myfile.rnd      using bits  4 to 13        141663   -0.849 0.1978
    OPSO for myfile.rnd      using bits  3 to 12        142604    2.395 0.9917
    OPSO for myfile.rnd      using bits  2 to 11        142293    1.323 0.9071
    OPSO for myfile.rnd      using bits  1 to 10        141979    0.240 0.5949
 OQSO test for generator myfile.rnd
  Output: No. missing words (mw), equiv normal variate (z), p-value (p)
                                                       mw      z     p
    OQSO for myfile.rnd      using bits 28 to 32        141630   -0.947 0.1718
    OQSO for myfile.rnd      using bits 27 to 31        142366    1.548 0.9392
    OQSO for myfile.rnd      using bits 26 to 30        141971    0.209 0.5828
    OQSO for myfile.rnd      using bits 25 to 29        141979    0.236 0.5933
    OQSO for myfile.rnd      using bits 24 to 28        142003    0.318 0.6246
    OQSO for myfile.rnd      using bits 23 to 27        142226    1.073 0.8585
    OQSO for myfile.rnd      using bits 22 to 26        141888   -0.072 0.4712
    OQSO for myfile.rnd      using bits 21 to 25        142264    1.202 0.8854
    OQSO for myfile.rnd      using bits 20 to 24        142252    1.162 0.8773
    OQSO for myfile.rnd      using bits 19 to 23        141588   -1.089 0.1380
    OQSO for myfile.rnd      using bits 18 to 22        142596    2.328 0.9900
    OQSO for myfile.rnd      using bits 17 to 21        141677   -0.788 0.2155
    OQSO for myfile.rnd      using bits 16 to 20        141976    0.226 0.5894
    OQSO for myfile.rnd      using bits 15 to 19        141714   -0.662 0.2539
    OQSO for myfile.rnd      using bits 14 to 18        141694   -0.730 0.2327
    OQSO for myfile.rnd      using bits 13 to 17        141163   -2.530 0.0057
    OQSO for myfile.rnd      using bits 12 to 16        142572    2.246 0.9877
    OQSO for myfile.rnd      using bits 11 to 15        141732   -0.601 0.2739
    OQSO for myfile.rnd      using bits 10 to 14        141531   -1.282 0.0998
    OQSO for myfile.rnd      using bits  9 to 13        142034    0.423 0.6637
    OQSO for myfile.rnd      using bits  8 to 12        141812   -0.330 0.3707
    OQSO for myfile.rnd      using bits  7 to 11        141949    0.134 0.5535
    OQSO for myfile.rnd      using bits  6 to 10        141554   -1.205 0.1142
    OQSO for myfile.rnd      using bits  5 to  9        142342    1.467 0.9288
    OQSO for myfile.rnd      using bits  4 to  8        142013    0.351 0.6374
    OQSO for myfile.rnd      using bits  3 to  7        142049    0.473 0.6821
    OQSO for myfile.rnd      using bits  2 to  6        142225    1.070 0.8577
    OQSO for myfile.rnd      using bits  1 to  5        141612   -1.008 0.1568
  DNA test for generator myfile.rnd
  Output: No. missing words (mw), equiv normal variate (z), p-value (p)
                                                       mw      z     p
     DNA for myfile.rnd      using bits 31 to 32        141190   -2.122 0.0169
     DNA for myfile.rnd      using bits 30 to 31        142405    1.462 0.9282
     DNA for myfile.rnd      using bits 29 to 30        141614   -0.871 0.1918
     DNA for myfile.rnd      using bits 28 to 29        141799   -0.325 0.3724
     DNA for myfile.rnd      using bits 27 to 28        142659    2.211 0.9865
     DNA for myfile.rnd      using bits 26 to 27        141874   -0.104 0.4585
     DNA for myfile.rnd      using bits 25 to 26        142041    0.388 0.6511
     DNA for myfile.rnd      using bits 24 to 25        141560   -1.030 0.1514
     DNA for myfile.rnd      using bits 23 to 24        141610   -0.883 0.1886
     DNA for myfile.rnd      using bits 22 to 23        141569   -1.004 0.1577
     DNA for myfile.rnd      using bits 21 to 22        141362   -1.615 0.0532
     DNA for myfile.rnd      using bits 20 to 21        141519   -1.151 0.1248
     DNA for myfile.rnd      using bits 19 to 20        142065    0.459 0.6770
     DNA for myfile.rnd      using bits 18 to 19        141926    0.049 0.5196
     DNA for myfile.rnd      using bits 17 to 18        142045    0.400 0.6555
     DNA for myfile.rnd      using bits 16 to 17        141939    0.088 0.5349
     DNA for myfile.rnd      using bits 15 to 16        142220    0.916 0.8203
     DNA for myfile.rnd      using bits 14 to 15        142051    0.418 0.6620
     DNA for myfile.rnd      using bits 13 to 14        142152    0.716 0.7630
     DNA for myfile.rnd      using bits 12 to 13        141570   -1.001 0.1584
     DNA for myfile.rnd      using bits 11 to 12        142092    0.539 0.7050
     DNA for myfile.rnd      using bits 10 to 11        141378   -1.567 0.0585
     DNA for myfile.rnd      using bits  9 to 10        142118    0.616 0.7309
     DNA for myfile.rnd      using bits  8 to  9        141491   -1.234 0.1086
     DNA for myfile.rnd      using bits  7 to  8        141998    0.262 0.6032
     DNA for myfile.rnd      using bits  6 to  7        141620   -0.853 0.1967
     DNA for myfile.rnd      using bits  5 to  6        141902   -0.022 0.4914
     DNA for myfile.rnd      using bits  4 to  5        141428   -1.420 0.0778
     DNA for myfile.rnd      using bits  3 to  4        141982    0.214 0.5849
     DNA for myfile.rnd      using bits  2 to  3        141650   -0.765 0.2221
     DNA for myfile.rnd      using bits  1 to  2        142042    0.391 0.6522

============================================================

     :::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::
     ::     This is the SQUEEZE test                                  ::
     :: Random integers are floated to get uniforms on [0,1). Start-  ::
     :: ing with k=2^31-1=2147483647, the test finds j, the number of ::
     :: iterations necessary to reduce k to 1, using the reduction    ::
     :: k=ceiling(k*U), with U provided by floating integers from     ::
     :: the file being tested.  Such j's are found 90,000 times,      ::
     :: then counts for the number of times j was <=6,7,...,47,>=48   ::
     :: are used to provide a chi-square test for cell frequencies.   ::
     :::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::
            RESULTS OF SQUEEZE TEST FOR myfile.rnd
           90000 squeezes performed
         Table of standardized frequency counts
     ( (obs-exp)/sqrt(exp) )^2
        for j taking values <=6,7,8,...,47,>=48:
     0.8     0.4     0.3    -0.8     2.0    -0.2
    -1.1    -0.2     0.6     0.4    -0.4    -1.9
     1.1     0.0     0.2     1.0     0.7     0.5
     0.1    -1.1    -0.8    -0.7     0.2    -0.1
    -1.1     1.8     0.1    -0.7     1.3    -0.1
    -0.2    -0.2     0.7    -1.8    -0.8     0.6
     0.2     0.9     1.2    -1.1     0.3    -0.9
    -1.0
           Chi-square with 42 degrees of freedom: 33.400
              z-score= -0.938  p-value=0.174084

============================================================

------------------------------------------------------------
 Final summary.  234 p-values collected from various tests
 performed on the file myfile.rnd
 0.9530 0.0609 0.7004 0.4289 0.8492 0.9156 0.7839 0.5254 0.6524 0.6125
 0.5804 0.6669 0.4041 0.5817 0.1035 0.9831 0.0697 0.7758 0.4458 0.9951
 0.1315 0.2445 0.2817 0.0685 0.0484 0.8509 0.6351 0.7151 0.2241 0.1297
 0.8697 0.5121 0.6338 0.5150 0.0414 0.6254 0.2325 0.8424 0.3746 0.3406
 0.4818 0.4097 0.2467 0.7944 0.8956 0.1179 0.8581 0.2907 0.4320 0.6351
 0.2072 0.0245 0.7817 0.4662 0.9937 0.3924 0.9843 0.3982 0.8944 0.1685
 0.8576 0.2002 0.6267 0.9771 0.2551 0.2030 0.9397 0.3114 0.9987 0.7015
 0.7046 0.4745 0.9527 0.8091 0.9884 0.7795 0.6834 0.0442 0.4809 0.1337
 0.0091 0.7187 0.8448 0.3546 0.8931 0.3812 0.3307 0.2552 0.7116 0.8801
 0.0851 0.8968 0.3478 0.3709 0.2747 0.0471 0.4650 0.7179 0.0390 0.7324
 0.2122 0.8109 0.3408 0.4280 0.4381 0.5984 0.6914 0.1821 0.8976 0.7099
 0.2896 0.8859 0.1677 0.9563 0.5692 0.7515 0.0324 0.4560 0.3750 0.2278
 0.7210 0.3182 0.3689 0.9985 0.8718 0.4449 0.0115 0.0683 0.7028 0.3654
 0.0948 0.4359 0.2851 0.4067 0.7106 0.7925 0.4661 0.3816 0.7084 0.2238
 0.4308 0.0144 0.8559 0.7686 0.6788 0.6036 0.6994 0.8291 0.3513 0.5609
 0.0303 0.9819 0.0356 0.1617 0.8938 0.3843 0.9846 0.9226 0.4584 1.0000
 0.6947 0.5298 0.7322 0.7412 0.8015 0.6689 0.8671 0.2997 0.9048 0.9588
 0.1978 0.9917 0.9071 0.5949 0.1718 0.9392 0.5828 0.5933 0.6246 0.8585
 0.4712 0.8854 0.8773 0.1380 0.9900 0.2155 0.5894 0.2539 0.2327 0.0057
 0.9877 0.2739 0.0998 0.6637 0.3707 0.5535 0.1142 0.9288 0.6374 0.6821
 0.8577 0.1568 0.0169 0.9282 0.1918 0.3724 0.9865 0.4585 0.6511 0.1514
 0.1886 0.1577 0.0532 0.1248 0.6770 0.5196 0.6555 0.5349 0.8203 0.6620
 0.7630 0.1584 0.7050 0.0585 0.7309 0.1086 0.6032 0.1967 0.4914 0.0778
 0.5849 0.2221 0.6522 0.1741

A KSTEST of those values yields 0.799307


============================================================

