# Solve a linear congruential algorithm problem

This project was awarded to **DungDVu** for **$25 CAD**.

###### Project Budget

$10 - $30 CAD###### Total Bids

2###### Project Description

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.

###### Awarded to:

###### Skills Required

## Browse Related Skills

## Related Projects

## Other things people do on Freelancer

## Related Articles

## Latest Articles

### Looking to make some money?

- Set your budget and the timeframe
- Outline your proposal
- Get paid for your work

## Hire Freelancers who also bid on this project

## Looking for work?

### Work on projects like this and make money from home!

Sign Up Now- Forbes
- The New York Times
- Time
- Wall Street Journal
- Times Online