RNG seed/pattern finder

People say random number generators can become truly random by specific hidden seeds, making the following algorithms impossible to decipher.? I want to see if someone can make a program that, by taking RNG integer outputs (1-100 range) it can find the seed integer.?

After finding the seed, i want it to be able to predict outputs of said rng to prove if true randomness is possible for the remaining integers following the? integers given to decipher the seed.? ?

## Deliverables

I need a program that can decipher RNG's by given integer outputs.? ? To keep it simple for testing and proving purposes, the max? range only needs to be 1-100 with no repeats as integers are used.? (i.e 7 cannot happen twice in a given "session")?

Also I need the program to work (i.e find the seed and/or find the next outputs) within the first 5 integer outputs.? Meaning if the first 5 are "2, 46, 3, 4, 99",? it will be able to find the rest from there.?

The theory is that the 100 integers scrambled (by a rng) and after the scramble, they're? given in the order they were scrambled (not scrambled inbetween outputs), and I want to see if it's possible to eliminate randomness.? I do not need a RNG, just the program that finds the? seeds and deciphers the following? based on integer values.? ?

Also, I'd like options to select the maximum number of integers (rather than 1-100, set it to anywhere from 1-5 upward to 1-100) if possible via an input section.? The program should be able to reset after each trial, and able to start anew with the range selected.

Project ID: #3499529

About the project