X-Git-Url: https://bilbo.iut-bm.univ-fcomte.fr/and/gitweb/prng_gpu.git/blobdiff_plain/807fde0ea31c414c79ee3922e51251371e227185..cae68b58b70de455ef66b7312c8625f25e83a37f:/prng_gpu.tex

diff --git a/prng_gpu.tex b/prng_gpu.tex
index db219a1..8d4f21b 100644
--- a/prng_gpu.tex
+++ b/prng_gpu.tex
@@ -724,6 +724,11 @@ the list of cells to update in the state $x^n$ of the system (represented
 as an integer having $\mathsf{N}$ bits too). More precisely, the $k-$th 
 component of this state (a binary digit) changes if and only if the $k-$th 
 digit in the binary decomposition of $S^n$ is 1.
+\begin{color}{red} 
+Obviously, when $S$ is periodic of period $p$, then $x$ is periodic too of
+period either $p$ or $2p$, depending of the fact that, after $p$ iterations,
+the state of the system may or not be the same than before these iterations.
+\end{color}
 
 The single basic component presented in Eq.~\ref{equation Oplus} is of 
 ordinary use as a good elementary brick in various PRNGs. It corresponds