Displaying similar documents to “Note on the number of solutions of the congruence f ( x 1 , x 2 , ⋯ , x n ) ≡ 0 ( mod p ) ”

Tribonacci modulo p t

Jiří Klaška (2008)

Mathematica Bohemica

Similarity:

Our research was inspired by the relations between the primitive periods of sequences obtained by reducing Tribonacci sequence by a given prime modulus p and by its powers p t , which were deduced by M. E. Waddill. In this paper we derive similar results for the case of a Tribonacci sequence that starts with an arbitrary triple of integers.

Tribonacci modulo 2 t and 11 t

Jiří Klaška (2008)

Mathematica Bohemica

Similarity:

Our previous research was devoted to the problem of determining the primitive periods of the sequences ( G n mod p t ) n = 1 ∞ where ( G n ) n = 1 ∞ 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 ≠ 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 .