# Non repeating random number generation with x(i+1) = x(i) + increment mod m

I have to generate millions of non-repeating random numbers and came across this equation: $x_{i+1} = x_i+c \space(mod \ m)$, where c and m are relative primes and $m \geq total\ to\ be\ generated$.

This works ok since I don't need good random numbers and don't have to memorize them. My question is, what is the demonstration and name of this method? I will have to write about it, but can't find any information not knowing how to formulate my question.

-
this is a number generator but not a random number generator – miracle173 Jun 14 '11 at 11:50

4
– Jyrki Lahtonen Jun 14 '11 at 12:01
I added the random tag. Just in case. – Jyrki Lahtonen Jun 14 '11 at 12:24

## 2 Answers

Your method is called a "linear congruential generator".

Please have also a look at this question:

how to generate real random numbers

The linear congruential generators are commonly considered to be a bad choice, with much better algorithms available, but it will depend on your application which generator turns out to be good or bad.

-
-
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 2, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "github"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "english_confidence": 0.9052982926368713, "perplexity_flag": "middle"}