The number of distinct and repeated squares and cubes in the Fibonacci sequence

preprint2016arXivOpen access

Abstract

The Fibonacci sequence F\mathbb{F} is the fixed point beginning with aa of morphism σ(a,b)=(ab,a)σ(a,b)=(ab,a). In this paper, we get the explicit expressions of all squares and cubes, then we determine the number of distinct squares and cubes in F[1,n]\mathbb{F}[1,n] for all nn, where F[1,n]\mathbb{F}[1,n] is the prefix of F\mathbb{F} of length nn. By establishing and discussing the recursive structure of squares and cubes, we give algorithms for counting the number of repeated squares and cubes in F[1,n]\mathbb{F}[1,n] for all nn, and get explicit expressions for some special nn such as n=fmn=f_m (the Fibonacci number) etc., which including some known results such as in A.S.Fraenkel and J.Simpson, J.Shallit et al.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.