dc.contributor.author | Al-Shaghay, Abdullah | |
dc.date.accessioned | 2014-03-31T14:39:36Z | |
dc.date.available | 2014-03-31T14:39:36Z | |
dc.date.issued | 2014-03-31 | |
dc.identifier.uri | http://hdl.handle.net/10222/47610 | |
dc.description.abstract | Two of the more well known congruences for binomial coefficients modulo p, due to Gauss and Jacobi, are related to the representation of an odd prime (or an integer multiple of the odd prime) p as a sum of two squares (or an integer linear combination of two squares). These two congruences, along with many others, have been extended to analogues modulo p^2 and are well documented. More recently, J. Cosgrave and K. Dilcher have extended the congruences of Gauss and Jacobi to analogues modulo p^3. In this thesis we discuss their methods as well as the potential of applying them to similar congruences found in the literature. | en_US |
dc.language.iso | en | en_US |
dc.subject | Number Theory | en_US |
dc.subject | Binomial Coefficient | en_US |
dc.title | Analogues of the Binomial Coefficient Theorems of Gauss and Jacobi | en_US |
dc.type | Thesis | en_US |
dc.date.defence | 2014-03-20 | |
dc.contributor.department | Department of Mathematics & Statistics - Math Division | en_US |
dc.contributor.degree | Master of Science | en_US |
dc.contributor.external-examiner | n/a | en_US |
dc.contributor.graduate-coordinator | Dr. Sara Faridi | en_US |
dc.contributor.thesis-reader | Dr. Keith Johnson | en_US |
dc.contributor.thesis-reader | Dr. Rob Noble | en_US |
dc.contributor.thesis-reader | Dr. Sara Faridi | en_US |
dc.contributor.thesis-supervisor | Dr. Karl Dilcher | en_US |
dc.contributor.ethics-approval | Not Applicable | en_US |
dc.contributor.manuscripts | Not Applicable | en_US |
dc.contributor.copyright-release | Not Applicable | en_US |