Hamlin, Nathan Gregory
MetadataShow full item record
A new method of representing positive integers using recurrence sequences, related to tiling a 1 x n board, is developed for recurrences with positive coefficients. This is then extended to many sequences that have negative coefficients. The densities of individual digits in such representations are then calculated in terms of the dominant root. Finally, we discuss an application of these sequences and representations to cryptography.