Access to this thesis is limited to Boise State University students and employees or persons using Boise State University facilities.
Off-campus Boise State University users: To download Boise State University access-only theses/dissertations, please select the "Off-Campus Download" button and enter your Boise State username and password when prompted.
Publication Date
12-2015
Date of Final Oral Examination (Defense)
12-16-2015
Type of Culminating Activity
Thesis - Boise State University Access Only
Degree Title
Master of Science in Mathematics
Department
Mathematics
Supervisory Committee Chair
Zachariah Teitler, Ph.D.
Supervisory Committee Member
Samuel Coskey, Ph.D.
Supervisory Committee Member
Uwe Kaiser, Ph.D.
Abstract
We introduce and review the Frobenius Problem, determining the greatest integer not expressible as a combination of given integers. We show a relationship between the Frobenius problem and quadratic residues modulo a power of a prime, generalizing a result of Spivey. We also present Rodseth's Algorithm, a Characteristic Theorem, and an upper bound for the Frobenius Number. Additional topics include: Sylvester's Theorem and a solution to a William Lowell Putnam Exam question regarding an application about tilings of rectangles.
Recommended Citation
Megale, Anna Marie, "The Frobenius Problem" (2015). Boise State University Theses and Dissertations. 1048.
https://scholarworks.boisestate.edu/td/1048