Statistical properties of an iterated arithmetic mapping (Q1906368)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 843783
Language Label Description Also known as
default for all languages
No label defined
    English
    Statistical properties of an iterated arithmetic mapping
    scientific article; zbMATH DE number 843783

      Statements

      Statistical properties of an iterated arithmetic mapping (English)
      0 references
      0 references
      1994
      0 references
      The ``Collatz''-problem (or ``\(3x+ 1\)''- or ``Hasse''- or ``Syracuse''- or ``Kakutani''-problem) is to prove that for every \(n\in \mathbb{N}\) there exists a \(k\) with \(T^{(k)}(n)= 1\), where the function \(T(n)\) takes odd numbers \(n\) to \((3n+ 1)/2\) and even numbers \(n\) to \(n/2\). This problem (and a similar trifurcation process) is studied from a probabilistic viewpoint, while the authors do not present any real new theoretical material. Through computer experiments it is shown that the occurring parities exhibit all properties of random sequences. It is a remarkable fact that even statistical physicists are interested in this elementary number theoretical problem.
      0 references
      Collatz problem
      0 references
      trifurcation process
      0 references
      random sequences
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references