Mathematics Senior Capstone Papers
Document Type
Article
Publication Date
Spring 2024
Abstract
In this project we will be delving into the combinatorics side of mathematics, with basic a graph theory idea such as set coloring. It will be a continuation of a question formed by the works of Bruce M. Landman, and Aaron Robertson, ”3-Accessibility of the Fibonacci Numbers.” They were able to prove the Fibonacci Numbers to be 2-Accessible, and while they did not supply the induction proof, we were able to construct and provide a proof. This project will use their lemmas and propositions to attempt to prove 2-Accessibility of the Lucas Numbers, Fibonacci-like sequences, and the Zeckendorf-Wythoff Array.
Recommended Citation
LeJeune, Cameron, "2-Accessibility of the Lucas Numbers/Fibonacci Like Sequences/Wythoff Array" (2024). Mathematics Senior Capstone Papers. 38.
https://digitalcommons.latech.edu/mathematics-senior-capstone-papers/38