#1
|
||||
|
linear congruential generators & you
the standard gcc library definition for rand() is a simple linear congruential generator
Code:
static unsigned long int next = 1; int rand(void) // RAND_MAX assumed to be 32767 { next = next * 1103515245 + 12345; return (unsigned int)(next/65536) % 32768; } void srand(unsigned int seed) { next = seed; } Quote:
these are your x.509 certificates we're talking about here people | |||
|
#2
|
|||
|
Shut up
| ||
|
#3
|
|||
|
wat about ayn though
| ||
|
#4
|
|||
|
im going back to school for computer science, maybe ill understand wtf this is all about soon.
maybe not.
__________________
Current Games:
Naw | ||
|
#6
|
|||
|
Let me see if I can put this in a way ya'll can understand. Studying the ramifications of this mathematical function is justification for ninalooting if you lose a /random
| ||
|
#7
|
|||
|
Ninalooting you say.
| ||
|
#8
|
|||
|
__________________
Bush <Toxic>
Jeremy <TMO> - Patron Saint of Blue | ||
|
#9
|
|||
|
I implemented mersenne twister in pure C
PHP Code:
PHP Code:
PHP Code:
| ||
|
#10
|
|||
|
?
| ||
|
|
|