Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
If i have a set of randomly generated numbers (integers), how do I find
a relationship between them so as to express them as a finite sequence and develop an
algorithm that can generate any nth term of the sequence given some seed data.
Is there any existing algorithm or framework or library that does such and if there isnt,
any suggestions on how to proceed.
Thanks.
It depends on the algorithm used to generate the (pseudo-random) numbers. If you want to predict future terms, you need some number of past terms and the algorithm used. If the algorithm is cryptographically secure, then you are out of luck. If it isn’t, then you have a good chance of working out future terms.
I asked this question regarding linear congruence generators (commonly used for simple applications) a while ago. It gives a pretty good discussion of how to predict terms for that class of generator.