In this thesis we are investigating identities regarding Fibonacci sequences. In particular we are examiningthe so called Pisano period, which is the period for the Fibonacci sequence considered modulo n to repeatitself. The theory shows that it suces to compute Pisano periods for primes. We are also looking atthe same problems for the generalized Pisano period, which can be described as the Pisano period forthe generalized Fibonacci sequence.

No description available.

A lot has been said about the Fibonacci Convolution Triangle, but not much has been said about the Tribonacci Convolution Triangle. There are a few ways to generate the Fibonacci Convolution Triangle. Proven through generating functions, Koshy has discovered the Fibonacci Convolution Triangle in Pascal's Triangle, Pell numbers, and even Tribonacci numbers. The goal of this project is to find inspiration in the Fibonacci Convolution Triangle to prove patterns that we observe in the Tribonacci Convolution Triangle. We start this by bringing in all the information that will be useful in constructing and solving these convolution triangles and find a way to prove them in an easy way.

In recent years, combinatorial properties of finite and infinite words have become increasingly important in fields of physics, biology, mathematics, and computer science. In particular, the fascinating family of Sturmian words has become an extremely active subject of research. These infinite binary sequences have numerous applications in various fields of mathematics, such as symbolic dynamics, the study of continued fraction expansion, and also in some domains of physics ( quasicrystal modelling ) and computer science ( pattern recognition, digital straightness ). There has also been a recent surge of interest in a natural generalization of Sturmian words to more than two letters - the so - called episturmian words, which include the well - known Arnoux - Rauzy sequences. This thesis represents a significant contribution to the study of Sturmian and episturmian words, and related objects such as generalized Thue - Morse words and substitutions on a finite alphabet. Specifically, we prove some new properties of certain palindromic factors of the infinite Fibonacci word; establish generalized ' singular ' decompositions of suffixes of certain morphic Sturmian words; completely describe where palindromes occur in characteristic Sturmian words; explicitly determine all integer powers occurring in a certain class of k-strict episturmian words ( including the k-bonacci word ) ; and prove that certain episturmian and generalized Thue - Morse continued fractions are transcendental. Lastly, we begin working towards a proof of a characterization of invertible substitutions on a finite alphabet, which generalizes the fact that invertible substitutions on two letters are exactly the Sturmian morphisms. / Thesis (Ph.D.)--School of Mathematical Sciences, 2006.

Submitted by Maria Suzana Diniz (msuzanad@hotmail.com) on 2015-11-30T12:34:27Z No. of bitstreams: 1 arquivototal.pdf: 766531 bytes, checksum: ad20186d0268a15265279ab809f9fd2f (MD5) / Approved for entry into archive by Maria Suzana Diniz (msuzanad@hotmail.com) on 2015-11-30T12:38:24Z (GMT) No. of bitstreams: 1 arquivototal.pdf: 766531 bytes, checksum: ad20186d0268a15265279ab809f9fd2f (MD5) / Made available in DSpace on 2015-11-30T12:38:24Z (GMT). No. of bitstreams: 1 arquivototal.pdf: 766531 bytes, checksum: ad20186d0268a15265279ab809f9fd2f (MD5) Previous issue date: 2014-08-29 / Coordenação de Aperfeiçoamento de Pessoal de Nível Superior - CAPES / This work is about research done Fibonacci's Numbers. Initially it presents a brief account of the history of Leonardo Fibonacci, from his most famous work,The Liber Abaci, to the relationship with other elds of Mathematics. Then we will introduce some properties of Fibonacci's Numbers, Binet's Form, Lucas' Numbers and the relationship with Fibonacci's Sequence and an important property observed by Fermat. Within relationships with other areas of Mathematics, we show the relationship Matrices, Trigonometry and Geometry. Also presents the Golden Ellipse and the Golden Hyperbola. We conclude with Tribonacci's Numbers and some properties that govern these numbers. Made some generalizations about Matrices and Polynomials Tribonacci. / Este trabalho tem como objetivo o estudo dos Números de Fibonacci. Apresenta-se inicialmente um breve relato sobre a história de Leonardo Fibonacci, desde sua obra mais famosa, O Liber Abaci, até a relação com outros campos da Matemática. Em seguida, apresenta-se algumas propriedades dos Números de Fibonacci, a Fórmula de Binet, os Números de Lucas e a relação com a Sequência de Fibonacci e uma importante propriedade observada por Fermat. Dentro das relações com outras áreas da Matemática, destacamos a relação com as Matrizes, com a Trigonometria, com a Geometria. Apresenta-se também a Elipse e a Hipérbole de Ouro. Concluímos com os Números Tribonacci e algumas propriedades que regem esses números. Realizamos algumas generalizações sobre Matrizes e Polinômios Tribonacci.

Based on the generating matrix to the Tribonacci sequence, the Tribonacci cat map is a discrete chaotic dynamical system, similar to Arnold's discrete cat map, but on three dimensional space. In this thesis, this new mapping is introduced and the properties of its matrix are presented. The main results of the investigation prove how the size of the domain of the map affects its period and explore the orbit lengths of non-trivial points. Different upper bounds to the map are studied and proved, and a conjecture based on numerical calculations is proposed. The Tribonacci cat map is used for applications such as 3D image encryption and colour encryption. In the latter case, the results provided by the mapping are compared to those from a generalised form of the map.