Solve a linear congruential algorithm problem

I need this question to be solved

If we take the linear congruential algorithm with an additive component of 0, namely:

Xn+1 = (aXn) mod m

Then it can be shown that if m is prime, and if a given value of a produces the maximum period of m-1, then a^k will also produce the maximum period, provided that k is less than m and that k and m-1 are relatively prime. Demonstrate this by using X0 = 1 and m = 31 and producing the sequences for a^k = 3 and 32, respectively.

Skills: Algorithm, Computer Security, Cryptography, Internet Security, Web Security

See more: zero forcing algorithm adaptive linear equalizer, travelling salesman problem algorithm, pallet loading problem algorithm, solving puzzle problem algorithm java, program wumpus world problem algorithm, stock cutting problem algorithm, queens problem algorithm, life death problem algorithm, water jug problem algorithm, cutting problem algorithm, cutting stock problem algorithm, longest common subsequence problem algorithm

About the Employer:
( 19 reviews ) windsor, Canada

Project ID: #12194475

Awarded to:

$25 CAD in 2 days
(0 Reviews)

2 freelancers are bidding on average $24 for this job

$23 CAD in 6 days
(0 Reviews)