Dissertation
Recurrence Representations
Doctor of Philosophy (PhD), Washington State University
01/2012
Handle:
https://hdl.handle.net/2376/4099
Abstract
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.
Metrics
8 File views/ downloads
19 Record Views
Details
- Title
- Recurrence Representations
- Creators
- Nathan Gregory Hamlin
- Contributors
- William A Webb (Advisor)Judith J McDonald (Committee Member)Matthew Hudelson (Committee Member)
- Awarding Institution
- Washington State University
- Academic Unit
- Mathematics and Statistics, Department of
- Theses and Dissertations
- Doctor of Philosophy (PhD), Washington State University
- Number of pages
- 81
- Identifiers
- 99900581856501842
- Language
- English
- Resource Type
- Dissertation