Combinatorial techniques can frequently provide satisfying “explanations” of various mathematical phenomena. In this thesis, we seek to explain a number of well known number theoretic congruences using combinatorial methods. Many of the results we prove involve the Fibonacci sequence and its generalizations.
| Identifer | oai:union.ndltd.org:CLAREMONT/oai:scholarship.claremont.edu:hmc_theses-1157 |
| Date | 01 May 2003 |
| Creators | Rouse, Jeremy |
| Publisher | Scholarship @ Claremont |
| Source Sets | Claremont Colleges |
| Detected Language | English |
| Type | text |
| Format | application/pdf |
| Source | HMC Senior Theses |
Page generated in 0.0017 seconds