(1)
Given,
Linear Congruential Generator Xn+1 = (2Xn + 5) mod 13 , sees X0 = 8
X0 = 8
X1 = (2X0 + 5) mod 13 = (2*8+ 5) mod 13= 21 mod 13 = 8.
X2 = (2X1 + 5) mod 13 = (2*8+ 5)mod 13= 21 mod 13 = 8.
X3 = (2X2 + 5) mod 13 = (2*8+ 5)mod 13= 21 mod 13 = 8
Therefore, Xn = {8, 8, 8,...}
Therefore, Sequence is (8) and Period length is 1.
(2)
Given,
Linear Congruential Generator Xn+1 = (2Xn + 5) mod 13 , sees X0 = 1
X0 = 1
X1 = (2X0 + 5) mod 13 = (2*1+ 5) mod 13= 7 mod 13 = 7.
X2 = (2X1 + 5) mod 13 = (2*7+ 5)mod 13= 19 mod 13 = 6.
X3 = (2X2 + 5) mod 13 = (2*6+ 5) mod 13= 17 mod 13 = 4.
X4 = (2X3 + 5)mod 13 = (2*4+ 5)mod 13 = 13 mod 13 = 0.
X5 = (2X4 + 5) mod 13 = (2*0+ 5)mod 13 = 5 mod 13 = 5.
X6 = (2X5 + 5)mod 13 = (2*5+ 5)mod 13 = 15 mod 13 = 2.
X7 = (2X6 + 5)mod 13 = (2*2+ 5)mod 13 = 9 mod 13 = 9.
X8 = (2X7 + 5)mod 13 = (2*9+ 5)mod 13 = 23 mod 13 = 10.
X9 = (2X8 + 5)mod 13 = (2*10+ 5)mod 13 = 25 mod 13 = 12.
X10 = (2X9 + 5)mod 13 = (2*12+ 5)mod 13 = 29 mod 13 = 3.
X11 = (2X10 + 5)mod 13 = (2*3+ 5)mod 13 = 11 mod 13 = 11.
X12 = (2X11 + 5)mod 13 = (2*11+ 5)mod 13 = 27 mod 13 = 1.
X13 = (2X12 + 5)mod 13 = (2*1+ 5)mod 13 = 7 mod 13 = 7.
X14= (2X13 + 5)mod 13 = (2*7+ 5)mod 13 = 19 mod 13 = 6.
X15 = (2X14 + 5)mod 13 = (2*6+ 5)mod 13 = 17 mod 13 = 4.
Therefore, Xn = {1, 7, 6, 4, 0, 5, 2, 9, 10, 12, 3, 11, 1, 7, 6, 4, ....}
Therefore, Sequence is (1-7-6-4-0-5-2-9-10-12-3-11) and Period length is 12.
(3)
Given,
Linear Congruential Generator Xn+1 = (1Xn + 5) mod 13 , sees X0 = 1
X0 = 1
X1 = (1X0 + 5) mod 13 = (1*1+ 5) mod 13= 6 mod 13 = 6.
X2 = (1X1 + 5) mod 13 = (1*6+ 5)mod 13= 11 mod 13 = 11.
X3 = (1X2 + 5) mod 13 = (1*11+ 5) mod 13= 16 mod 13 = 3.
X4 = (1X3 + 5)mod 13 = (1*3+ 5)mod 13 = 8 mod 13 = 8.
X5 = (1X4 + 5) mod 13 = (1*8+ 5)mod 13 = 13 mod 13 = 0.
X6 = (1X5 + 5)mod 13 = (1*0+ 5)mod 13 = 5 mod 13 = 5.
X7 = (1X6 + 5)mod 13 = (1*5+ 5)mod 13 = 10 mod 13 = 10.
X8 = (1X7 + 5)mod 13 = (1*10+ 5)mod 13 = 15 mod 13 = 2.
X9 = (1X8 + 5)mod 13 = (1*2+ 5)mod 13 = 7 mod 13 = 7.
X10 = (1X9 + 5)mod 13 = (1*7+ 5)mod 13 = 12 mod 13 = 12.
X11 = (1X10 + 5)mod 13 = (1*12+ 5)mod 13 = 17 mod 13 = 4.
X12 = (1X11 + 5)mod 13 = (1*4+ 5)mod 13 = 9 mod 13 = 9.
X13 = (1X12 + 5)mod 13 = (1*9+ 5)mod 13 = 14 mod 13 = 1.
X14= (1X13 + 5)mod 13 = (1*1+ 5)mod 13 = 6 mod 13 = 6.
X15 = (1X14 + 5)mod 13 = (1*6+ 5)mod 13 = 11 mod 13 = 11.
Therefore, Xn = {1, 6, 11, 3, 8, 0, 5, 10, 2, 7, 12, 4, 9, 1, 6, .....}
Therefore, Sequence is (1-6-11-3-8-0-5-10-2-7-12-4-9) and Period length is 13.
What is the period-length of the Linear Congruential Generator Xn+1 = (2Xn + 5)mod13 with seed...
Linear Congruential Generator: Example 2 Homework. Unanswered What is the period-length of the Linear Congruential Generator Xn+1 = (2xn + 5)mod13 with seed Xo = 12 - Numeric Answer: Cannot be empty Linear Congruential Generator: Example 1 Homework. Unanswered What is the period-length of the Linear Congruential Generator Xn+1 = (2x1 +5)mod13 with seed Xo = 8? Numeric Answer:
Linear Congruential Generator: Example 2 Homework. Unanswered What is the period-length of the Linear Congruential Generator Xa+1 = {2X. +5| mod13 with seed X = 12 Numeric Answer: Treap Concepts Homework. Unanswered Which of the following are true of the data structure Treap (randomized BST)? Multiple answers: Multiple answers are accepted for this question Select one or more answers and submit. For keyboard navigation... Show More a The word Treap is a hybrid of Tree and Heap Each node in...
Birthaay Paradox: Take 2 Homework. Unanswered At the end of June, a bunch of customers all having birthdays in July enter a bakery to order cakes for their July birthday celebrations. How many such customers must there be so that there is at least a 50% chance (>=.5 probability) that at least two of them were born on the same day in July (ignore the year). Assume that there are no other customers in the store and that there are...
A) What sequence (At least 8 sequences) of pseudorandom numbers is generated using the linear congruential generator xn+1 (3xn2) mod 13 with seed Xo- 1? B)Find the sequence of pseudorandom numbers generated by the power generator with p-7, d-3, and seed xo 2
11. What sequence of pseudorandom numbers is generated using the linear congruential generator xn +1 (4xn + 1) mod 7 with seed Xo-37 12. Encrypt the message STOP POLLUTION by translating the letters into numbers, applying the encryption function/ P)-(p + 4) mod 26, and then translating the numbers back into letters. 13. Decrypt this message encrypted using the shift cipher f (p) (p+ 10) mod 26 CEBBOXNOBXYG 14. Let P() be the statement that 12 +22 ++n2 -n-)(en+2) for...
Generate 10 random numbers using the following linear congruential generator with 7 as the seed: si+1 = (5 * si + 1) mod 20.
a) b) Consider the linear congruential generator Xi41 = (5X; 1)mod(8). Using Xo 0, calculate the 99th pseudo-random number Ug9 16807 X-1 mod(231 - 1). Using Consider our "desert island" PRN generator, X; Xo 12345678, calculate X99. Consider the linear congruential generator Xi41 = (5X; 1)mod(8). Using Xo 0, calculate the 99th pseudo-random number Ug9 16807 X-1 mod(231 - 1). Using Consider our "desert island" PRN generator, X; Xo 12345678, calculate X99.
Use linear congruential generator with seed value 31, a = 11, c = 17, m = 100 and inverse transform technique to generate: 10 continuous uniform random variates on interval [1; 10]; [5] 10 exponential random variates with parameter λ = 3. [2] It is suspected that the generated random numbers (Ri) are autocorrelated, since an observer notices that every 4th number starting (but not counting) from the 1st number (i.e. i = 1) is larger...
9. Use the construction in the proof of the Chinese remainder theorem to find a solution to the system of congruences X 1 mod 2 x 2 mod 3 x 3 mod 5 x 4 mod 11 10. Use Fermats little theorem to find 712 mod 13 11. What sequence of pseudorandom numbers is generated using the linear congruential generator Xn+1 (4xn + 1) mod 7 with seed xo 3? 9. Use the construction in the proof of the Chinese...
Problem 8 (Pseudorandom Numbers). Randomly chosen numbers are often needed for computer simulations of physical phenomena, and they are needed to generate random keys for cryptography. Different methods have been devised for generating numbers that have certain properties of randomly chosen numbers. Because numbers generated by systematic methods are not truly random, they are called pseudorandom numbers. There are fundamental properties we would like the pseudorandom sequence/pseudorandom number generator to possess for cryptographic purposes. 1. It is easy to compute...