| http://dbpedia.org/ontology/abstract
|
An approach to nonlinear congruential meth … An approach to nonlinear congruential methods of generating uniform pseudorandom numbers in the interval [0,1) is the Inversive congruential generator with prime modulus. A generalization for arbitrary composite moduli with arbitrary distinct primes will be present here. Let . For integers with gcd (a,m) = 1 a generalized inversive congruential sequence of elements of is defined by where denotes the number of positive integers less than m which are relatively prime to m.ss than m which are relatively prime to m.
|
| http://dbpedia.org/ontology/wikiPageID
|
30578555
|
| http://dbpedia.org/ontology/wikiPageLength
|
7183
|
| http://dbpedia.org/ontology/wikiPageRevisionID
|
982984432
|
| http://dbpedia.org/ontology/wikiPageWikiLink
|
http://dbpedia.org/resource/Inversive_congruential_generator +
, http://dbpedia.org/resource/Naor-Reingold_Pseudorandom_Function +
, http://dbpedia.org/resource/List_of_random_number_generators +
, http://dbpedia.org/resource/Integer +
, http://dbpedia.org/resource/Fermat%27s_little_theorem +
, http://dbpedia.org/resource/Category:Pseudorandom_number_generators +
, http://dbpedia.org/resource/Linear_congruential_generator +
, http://dbpedia.org/resource/Coprime +
, http://dbpedia.org/resource/Pseudorandom_number_generator +
|
| http://dbpedia.org/property/wikiPageUsesTemplate
|
http://dbpedia.org/resource/Template:Math +
, http://dbpedia.org/resource/Template:Citation +
, http://dbpedia.org/resource/Template:Reflist +
|
| http://purl.org/dc/terms/subject
|
http://dbpedia.org/resource/Category:Pseudorandom_number_generators +
|
| http://www.w3.org/ns/prov#wasDerivedFrom
|
http://en.wikipedia.org/wiki/Generalized_inversive_congruential_pseudorandom_numbers?oldid=982984432&ns=0 +
|
| http://xmlns.com/foaf/0.1/isPrimaryTopicOf
|
http://en.wikipedia.org/wiki/Generalized_inversive_congruential_pseudorandom_numbers +
|
| owl:sameAs |
http://dbpedia.org/resource/Generalized_inversive_congruential_pseudorandom_numbers +
, http://yago-knowledge.org/resource/Generalized_inversive_congruential_pseudorandom_numbers +
, http://www.wikidata.org/entity/Q5532485 +
, https://global.dbpedia.org/id/4kK4o +
, http://rdf.freebase.com/ns/m.0g9vzv8 +
|
| rdf:type |
http://dbpedia.org/class/yago/Object100002684 +
, http://dbpedia.org/class/yago/Apparatus102727825 +
, http://dbpedia.org/class/yago/Artifact100021939 +
, http://dbpedia.org/class/yago/WikicatPseudorandomNumberGenerators +
, http://dbpedia.org/class/yago/PhysicalEntity100001930 +
, http://dbpedia.org/class/yago/Whole100003553 +
, http://dbpedia.org/class/yago/Generator103434188 +
, http://dbpedia.org/class/yago/Instrumentality103575240 +
, http://dbpedia.org/class/yago/Equipment103294048 +
|
| rdfs:comment |
An approach to nonlinear congruential meth … An approach to nonlinear congruential methods of generating uniform pseudorandom numbers in the interval [0,1) is the Inversive congruential generator with prime modulus. A generalization for arbitrary composite moduli with arbitrary distinct primes will be present here. Let . For integers with gcd (a,m) = 1 a generalized inversive congruential sequence of elements of is defined by where denotes the number of positive integers less than m which are relatively prime to m.ss than m which are relatively prime to m.
|
| rdfs:label |
Generalized inversive congruential pseudorandom numbers
|
