Question

27.2 Generate 15 numbers using a seed of x0 = 1 in the following generator: xn...

27.2 Generate 15 numbers using a seed of x0 = 1 in the following generator: xn = (5xn-1+ 1) mod16

Science   Advanced-Physics   
0 0
Add a commentTranscribed image text
Next >

Homework Answers

Answer #1

I HOPE ITS HELP FUL TO YOU IF YOU HAVE ANY DOBUTS PLS COMMENTS BELOW..I WILL BE THERE TO HELP YOU...ALL THE BEST..

AS FOR GIVEN DATA...

Generate 15 numbers using a seed of x0 = 1 in the following generator: xn = (5xn-1+ 1) mod16

EXPLANATION ::-

Rcode:

> options(scipen = 999)
> x<-vector()
> x[1]=1;
> for(i in 2:15){
+ x[i]=((5*x[i-1])+1)
+ x[i]=x[i]%%16
+ }
> ks.test(x,"pnorm")

   One-sample Kolmogorov-Smirnov test

data: x
D = 0.91058, p-value = 0.0000000000000006661
alternative hypothesis: two-sided

a)

1 6 15 12 13 2 11 8 9 14 7 4 5 10 3

I HOPE YOU UNDERSTAND...PLS RATE THUMBS UP..ITS HELPS ME ALOT

THANK YOU....!!

0 0
Know the answer?
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Log In

Sign Up

Not the answer you're looking for?
Ask your own homework help question
Similar Questions
27.2 Generate 15 numbers using a seed of x0 = 1 in the following generator: xn...
27.2 Generate 15 numbers using a seed of x0 = 1 in the following generator: xn = (5xn-1 + 1) mod16. Perform a K-S test and check whether the sequence passes the test at a 95% confidence level.
Consider the above quadratic residue generator xn+1 = xn2 mod m with m = 4783 ×...
Consider the above quadratic residue generator xn+1 = xn2 mod m with m = 4783 × 4027. Write a program to generate pseudo-random numbers from this generator. Use this to determine the period of the generator starting with seed x0 = 196, and with seed x0 = 400?
Let the LFSR be xn+5 = xn + xn+3, where the initial values are x0=0, x1=1,...
Let the LFSR be xn+5 = xn + xn+3, where the initial values are x0=0, x1=1, x2=0, x3=0, x4=0 (a) Compute first 24 bits of the following LFSR. (b) What is the period?
Consider a sequence defined recursively as X0= 1,X1= 3, and Xn=Xn-1+ 3Xn-2 for n ≥ 2....
Consider a sequence defined recursively as X0= 1,X1= 3, and Xn=Xn-1+ 3Xn-2 for n ≥ 2. Prove that Xn=O(2.4^n) and Xn = Ω(2.3^n). Hint:First, prove by induction that 1/2*(2.3^n) ≤ Xn ≤ 2.8^n for all n ≥ 0 Find claim, base case and inductive step. Please show step and explain all work and details
1) Consider a linear congruential random number generator with parameters a = 35, c = 20...
1) Consider a linear congruential random number generator with parameters a = 35, c = 20 and m = 100. a- Generate 5 random numbers by using this method. Use 84. b- By using inverse transform method, generate 2 random variate for an exponential distribution with parameter λ = 0.5. Use the first two random numbers you generated in part a.
Generate 1000 random numbers between 0 and 1*Create a frequency table with the following Generate 1000...
Generate 1000 random numbers between 0 and 1*Create a frequency table with the following Generate 1000 random numbers between 0 and 1*Create a frequency table with the following bins 0, 0,1, 0.2, ..., 0.8, 0.9 , 1Find the expected value bins 0, 0,1, 0.2, ..., 0.8, 0.9 , 1Find the expected value
Generate at least 20 random numbers within the range of 1 to 900 using linear congruent...
Generate at least 20 random numbers within the range of 1 to 900 using linear congruent method. Xi = (aXo + C) mod m using a = 87, c = 29 and Xo = 19
Prove the following clearly, neatly and step-by-step: Let X1=1. Define Xn+1 = sqrt(3+Xn). Show that (Xn)...
Prove the following clearly, neatly and step-by-step: Let X1=1. Define Xn+1 = sqrt(3+Xn). Show that (Xn) is convergent (by using delta/epsilon proof) and then find its limit.
Please prove the following (using epsilon/delta proofs) formally and clearly: For Xn given by the following,...
Please prove the following (using epsilon/delta proofs) formally and clearly: For Xn given by the following, prove the convergence or divergence of the sequence (Xn): a) Xn = n2/(2n2+1) b) Xn = (-1)n/(n+1) c) Xn = sin(n)/(n2+1)
Random number generator 1: Search for algorithms generating pseudo-random numbers. Select one of them for generating...
Random number generator 1: Search for algorithms generating pseudo-random numbers. Select one of them for generating a pseudo-random sequence. Original sample can be generated in any form: binary, decimal, etc. But submitted sample must be in the form of uniform random numbers on [0,1][0,1]. The sample should not be generated by any function, like runif(), sample(), etc. Instead it must be some algorithm that you code yourselves. For example, mid-square algorithm, Fibonacci-based algorithm, etc. Random number generator 2: Find some...
ADVERTISEMENT
Need Online Homework Help?

Get Answers For Free
Most questions answered within 1 hours.

Ask a Question
ADVERTISEMENT