DOAJ Open Access 2006

On the non-randomness of modular arithmetic progressions: a solution to a problem by V. I. Arnold

Eda Cesaratto Alain Plagne Brigitte Vallée

Lihat Sumber DOI

Abstrak

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. In conclusion, this study shows that modular arithmetic progressions are far from behaving like purely random sequences, according to Arnold's definition.

Topik & Kata Kunci

Mathematics

Penulis (3)

Eda Cesaratto

Alain Plagne

Brigitte Vallée

Format Sitasi

APA MLA BibTeX

Cesaratto, E., Plagne, A., Vallée, B. (2006). On the non-randomness of modular arithmetic progressions: a solution to a problem by V. I. Arnold. https://doi.org/10.46298/dmtcs.3510

Akses Cepat

Lihat di Sumber doi.org/10.46298/dmtcs.3510

Informasi Jurnal

Tahun Terbit: 2006
Sumber Database: DOAJ
DOI: 10.46298/dmtcs.3510
Akses: Open Access ✓