|
Search: id:A096560
|
|
|
| A096560 |
|
Consecutive internal states of the first of the two linear congruential random number generators whose combined output is used in function RANDOM_NUMBER in version 8 of the Intel FORTRAN Compiler for Linux, using its intrinsic initialization. |
|
+0
2
|
|
| 2147483562, 2147443549, 546363367, 801095798, 1707599834, 1415233705, 19915560, 184815967, 1440196129, 286492701, 451678520, 242633072, 2094038248, 332794338, 2034550132, 1534592081, 22528712, 1668269071, 1739534702
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
Comment from Raymond Wang (r.wang(AT)yahoo.com), Oct 03 2008: (65421664*40014) mod (2^31-85) = 2^31-86.
|
|
REFERENCES
|
P. L'Ecuyer, Efficient and portable combined random number generators, Communications of the ACM, v.31 n.6, p. 742-751 and 774, 1988
|
|
LINKS
|
P. L'Ecuyer, Random Number Generation, Chapter 4 of the Handbook on Simulation, Jerry Banks Ed., Wiley, 1998.
Intel FORTRAN Language Reference, Chapter 9, Intrinsic Procedure RANDOM_NUMBER
Index entries for sequences related to pseudo-random numbers.
|
|
FORMULA
|
a(1)=2^31-86, a(n)=40014*a(n-1) mod (2^31-85).
|
|
CROSSREFS
|
Cf. A096561.
Sequence in context: A017483 A017615 A096561 this_sequence A011581 A015383 A016872
Adjacent sequences: A096557 A096558 A096559 this_sequence A096561 A096562 A096563
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Hugo Pfoertner (hugo(AT)pfoertner.org), Aug 13 2004
|
|
|
Search completed in 0.002 seconds
|
