2. Select the statements that are true.

A. The number 8 by itself could be random.

B. The randomness of a number depends on the sequence it belongs to.

C. The following sequence is random:

1,2,3,4,5,6,7,8,9,...etc.

D. There are mathematical algorithms that generate True random sequences of

numbers

E. Mathematical Algorithms will always generate pseudorandom numbers.

F. Cryptographically Secure Pseudorandom Number Generators are the same as

Pseudorandom Number Generators, the only difference is that we use them in

Cryptography.

G. Cryptographically Secure Pseudorandom Number Generators are

Pseudorandom Number Generators for which the sequence is unpredictable.

3. Generate a sequence of 5 pseudorandom numbers using the Middle-Square

algorithm with seed=1421. Your answer should start with the seed, and the

next four numbers should be separated by "comas", leave a single space

after every "coma"

4. Question 4 options:

Generate a sequence of 5 pseudorandom numbers using the Middle-Square

algorithm with seed=3413. Your answer should start with the seed, and the

next four numbers should be separated by "comas", leave a single space

after every "coma"

5. Find the 2,000th number in the pseudorandom sequence generated by

Middle-Square algorithm with seed=1001.

6. Compute the 10,000th element of the pseudorandom sequence generated by

the Middle-Square algorithm with seed=1003