You are here

Pseudorandom Number Generators in a Four-Bit Computer System

Determining the number of theoretic conditions that will guarantee that a linear congruence is a suitable pseudo-random number generator modulo 16.
Old Node ID: 
1319
MSC Codes: 
Author(s): 
James C. Reber (Indiana University of Pennsylvania)
Publication Date: 
Wednesday, November 15, 2006
Original Publication Source: 
College Mathematics Journal
Original Publication Date: 
January, 1989
Subject(s): 
Mathematics for Computer Science
Applied Mathematics
Modular Arithmetic
Number Theory
Algebra and Number Theory
Topic(s): 
Number Sequences
Congruences
Flag for Digital Object Identifier: 
Publish Page: 
Furnished by JSTOR: 
Rating Count: 
20.00
Rating Sum: 
63.00
Rating Average: 
3.15
Author (old format): 
James C. Reber
Applicable Course(s): 
4.3 Number Theory
4.1 Introduction to Proofs
3.7 Discrete Math
2.7 Finite Math
Modify Date: 
Thursday, August 23, 2012
Average: 3.2 (20 votes)

Dummy View - NOT TO BE DELETED