login
Pseudo-random numbers: Davenport's generator for 32-bit integers.
3

%I #8 Nov 15 2019 21:29:56

%S 10904,21520,20895,25213,7963,32668,25961,6826,13530,17404,5948,5449,

%T 8262,14606,10788,30720,31758,4871,32173,13874,11466,27821,31595,8091,

%U 15213,16731,31046,17581,21096,21170,7302,19629,18847,30239,2465,6541

%N Pseudo-random numbers: Davenport's generator for 32-bit integers.

%C Davenport recommends b(n) as generator, a(n) uses bits 16..30 of b(n).

%D H. Davenport, The Higher Arithmetic, 7th ed. 1999, Cambridge University Press, ch. 8.3.

%H <a href="/index/Ps#PRN">Index entries for sequences related to pseudo-random numbers.</a>

%F b(n) = b(n-1) * 2147001325 +715136305, b(0) = 1, a(n) = (( b(n)/(2^16) ) mod (2^15)).

%o (C) unsigned next= 1; int i= 0; while (i++ < 36) next = next * 2147001325 +715136305, printf( "%d ", (next/65536) % 32768 );

%Y See A084276, A084277, A061364 for other versions.

%K nonn,easy

%O 0,1

%A _Frank Ellermann_, May 25 2003