Subsequences and divisibility by powers of the Fibonacci numbers

Abstract: Let

F_{n}

be the

n

th Fibonacci number. Let

m, n

be positive integers. Define a sequence

(G (k, n, m))_{k g e q 1}

by

G (1, n, m) = F_{n}^{m}

, and

G (k + 1, n, m) = F_{n G (k, n, m)}

for all

k g e q 1

. We show that

F_{n}^{k + m - 1} m i d G (k, n, m)

for all

k, m, n i n m a t h b b N

. Then we calculate

f r a c G (k, n, m) F_{n}^{k + m - 1} p m o d F_{n}

.

Recommendations

Cited in

(10)

This page was built for publication: Subsequences and divisibility by powers of the Fibonacci numbers