On the non-randomness of modular arthmetic progressions : a solution to a problem by V.I. Arnold
Résumé
We solve a problem by V. I. Arnold dealing with “how random” modular arithmetic progressions can be. After making precise how Arnold proposes to measure the randomness of a modular sequence, we show that this measure of randomness takes a simplified form in the case of arithmetic progressions. This simplified expression is then estimated using the methodology of dynamical analysis, which operates with tools coming from dynamical systems theory.
Origine | Fichiers éditeurs autorisés sur une archive ouverte |
---|
Loading...