You are here

Pseudorandom Number Generators in a Four-Bit Computer System

by James C. Reber (Indiana University of Pennsylvania)

This article originally appeared in:
College Mathematics Journal
January, 1989

Subject classification(s): Mathematics for Computer Science | Applied Mathematics | Modular Arithmetic | Number Theory | Algebra and Number Theory
Applicable Course(s): 4.3 Number Theory | 4.1 Introduction to Proofs | 3.7 Discrete Math | 2.7 Finite Math

Determining the number of theoretic conditions that will guarantee that a linear congruence is a suitable pseudo-random number generator modulo 16.

A pdf copy of the article can be viewed by clicking below. Since the copy is a faithful reproduction of the actual journal pages, the article may not begin at the top of the first page.

To open this file please click here.

These pdf files are furnished by JSTOR.

Classroom Capsules would not be possible without the contribution of JSTOR.

JSTOR provides online access to pdf copies of 512 journals, including all three print journals of the Mathematical Association of America: The American Mathematical Monthly, College Mathematics Journal, and Mathematics Magazine. We are grateful for JSTOR's cooperation in providing the pdf pages that we are using for Classroom Capsules.

Capsule Course Topic(s): Number Theory | Number SequencesNumber Theory | Congruences
3.15
Average: 3.2 (20 votes)

Dummy View - NOT TO BE DELETED