RUS  ENG
Full version
JOURNALS // Vestnik Tomskogo Gosudarstvennogo Universiteta. Matematika i Mekhanika // Archive

Vestn. Tomsk. Gos. Univ. Mat. Mekh., 2013 Number 4(24), Pages 15–23 (Mi vtgu329)

MATHEMATICS

$\mathrm{Fibonacci}(n)$ modulo $n$ sequence

V. M. Zyuz'kov

Tomsk State University

Abstract: We study the behavior of the $\mathrm{Fibonacci}(n)\mod n$ sequence and pay attention to some subsequences: $n$ runs through the set of prime numbers and the cases with $n = qp$, where $p$ runs through the set of prime numbers and $q$ is a fixed natural number. The behavior of the sequence is investigated using the Mathematica system. Some hypotheses are formulated and proved.

Keywords: Fibonacci sequence, remainders, congruence relation, Mathematica.

UDC: 511.17

Received: 11.03.2013



© Steklov Math. Inst. of RAS, 2026