Tribonacci modulo $2^t$ and ${11}^t$

Klaška, Jiří. "Tribonacci modulo $2^t$ and $11^t$." Mathematica Bohemica 133.4 (2008): 377-387. <http://eudml.org/doc/250539>.

@article{Klaška2008,
abstract = {Our previous research was devoted to the problem of determining the primitive periods of the sequences $(G_n~\@mod \;p^t)_\{n=1\}^\{\infty \}$ where $(G_n)_\{n=1\}^\{\infty \}$ is a Tribonacci sequence defined by an arbitrary triple of integers. The solution to this problem was found for the case of powers of an arbitrary prime $p\ne 2,11$. In this paper, which could be seen as a completion of our preceding investigation, we find solution for the case of singular primes $p=2,11$.},
author = {Klaška, Jiří},
journal = {Mathematica Bohemica},
keywords = {Tribonacci; modular periodicity; periodic sequence; Tribonacci; modular periodicity; periodic sequence},
language = {eng},
number = {4},
pages = {377-387},
publisher = {Institute of Mathematics, Academy of Sciences of the Czech Republic},
title = {Tribonacci modulo $2^t$ and $11^t$},
url = {http://eudml.org/doc/250539},
volume = {133},
year = {2008},
}

TY - JOUR
AU - Klaška, Jiří
TI - Tribonacci modulo $2^t$ and $11^t$
JO - Mathematica Bohemica
PY - 2008
PB - Institute of Mathematics, Academy of Sciences of the Czech Republic
VL - 133
IS - 4
SP - 377
EP - 387
AB - Our previous research was devoted to the problem of determining the primitive periods of the sequences $(G_n~\@mod \;p^t)_{n=1}^{\infty }$ where $(G_n)_{n=1}^{\infty }$ is a Tribonacci sequence defined by an arbitrary triple of integers. The solution to this problem was found for the case of powers of an arbitrary prime $p\ne 2,11$. In this paper, which could be seen as a completion of our preceding investigation, we find solution for the case of singular primes $p=2,11$.
LA - eng
KW - Tribonacci; modular periodicity; periodic sequence; Tribonacci; modular periodicity; periodic sequence
UR - http://eudml.org/doc/250539
ER -