Return to search

Combinatorial Proofs of Congruences

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.

Identiferoai:union.ndltd.org:CLAREMONT/oai:scholarship.claremont.edu:hmc_theses-1157
Date01 May 2003
CreatorsRouse, Jeremy
PublisherScholarship @ Claremont
Source SetsClaremont Colleges
Detected LanguageEnglish
Typetext
Formatapplication/pdf
SourceHMC Senior Theses

Page generated in 0.0016 seconds