A cellular automaton on a torus.

Cobeli, C.I.; Crâşmaru, M.; Zaharescu, A.

Displaying similar documents to “A cellular automaton on a torus.”

An iteration problem involving the divisor function

Claudia Spiro (1986)

Acta Arithmetica

Similarity:

The $3 x + 1$ problem as a string rewriting system.

Sinyor, Joseph (2010)

International Journal of Mathematics and Mathematical Sciences

Similarity:

Cycles of monomial and perturbated monomial $p$ -adic dynamical systems

Marcus Nilsson (2000)

Annales mathématiques Blaise Pascal

Similarity:

The set of rational cycles for the 3x+1 problem

Jeffrey Lagarias (1990)

Acta Arithmetica

Similarity:

Sophie Germain little suns

Michal Křížek, Lawrence Somer (2004)

Mathematica Slovaca

Similarity:

Verifying two conjectures on generalized elite primes.

Li, Xiaoqin (2009)

Journal of Integer Sequences [electronic only]

Similarity:

Midy's theorem for periodic decimals.

Lewittes, Joseph (2007)

Integers

Similarity:

Skolem-type difference sets for cycle systems.

Bryant, Darryn, Gavlas, Heather, Ling, Alan C.H. (2003)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

On a connection of number theory with graph theory

Lawrence Somer, Michal Křížek (2004)

Czechoslovak Mathematical Journal

Similarity:

We assign to each positive integer $n$ a digraph whose set of vertices is $H = {0, 1, \dots, n - 1}$ and for which there is a directed edge from $a \in H$ to $b \in H$ if $a^{2} \equiv b (m o d n)$ . We establish necessary and sufficient conditions for the existence of isolated fixed points. We also examine when the digraph is semiregular. Moreover, we present simple conditions for the number of components and length of cycles. Two new necessary and sufficient conditions for the compositeness of Fermat numbers are also introduced.