Mathematica 9 is now available

Wolfram Library Archive


All Collections Articles Books Conference Proceedings
Courseware Demos MathSource Technical Notes
Title Downloads

Curious properties of an iterative process under various moduli
Authors

Ryohei Miyadera
Organization: Kwansei Gakuin High School
Department: Mathematics Department
Satoshi Hashiba
Revision date

2005-09-23
Description

Let K be an arbitrary positive number. We define a function

f(n) = Mod[(n1)^(n1) + (n2)^(n2) + ..., (nk)^(nk),K],

where { n1,n2, ..., nk } is the list of the digits of a natural number n. If we repeatedly apply the function f, then we can generate a sequence {n, f(n), f(f(n)), f(f(f(n))), .....}.

If we choose a proper number K, then for any natural number n the sequence {n, f(n), f(f(n)), f(f(f(n))), ...} eventually converges to 1.

This curious fact is thoroughly explored in Mathematica.
Subject

*Mathematics > Number Theory
Keywords

iterative process
Related items

*Curious Properties of an Iterative Process   [in MathSource: Packages and Programs]
Downloads Download Wolfram CDF Player

Download
IterativeProcess.nb (2.9 MB) - Mathematica Notebook