Thursday

April 24, 2014

April 24, 2014

Posted by **John Berkhamp** on Monday, July 22, 2013 at 2:09am.

Xn+1=(aXn+c) mod m

X1 is the first pseudo-random number generated, X2 is the second, and so on. Let R be the 2000th pseudo-random number generated by the linear congruential generator when X0=42, a=25, c=31, and m=2^20. What are the last three digits of R?

- Data Structures and Algorithms -
**Aryaman**, Monday, July 22, 2013 at 8:50am938

- Data Structures and Algorithms -
**MathMate**, Monday, July 22, 2013 at 9:11amIf the question asks for the last digits, you could code and evaluate the recursive formula to get the results.

If you would like a check, you are welcome. The sum of the 3 last digits is 20.

**Related Questions**

IT210 - Identify at least two data structures that are used to organize a ...

PROBABILITIES - Factories A and B produce computers. Factory A produces 3 times ...

Probability - Factories A and B produce computers. Factory A produces 2 times as...

computers - can the linear nested IF/ENDIF structures can contain other decision...

alegbra - Which of the following are examples of inferential statistics? Check ...

IT - identify at least two data structures that are used to organize a typical ...

IT - identify at least two data structures that are used to organize a typical ...

computers - Housing is a problem in Nigeria, write an algorithms to solve these ...

statistics - samples of size n=900 are randomly selected from the population of ...

Data Structures and Algorithms - Given integers R,M with M≠0, let S(R,M) ...