Open Access. Powered by Scholars. Published by Universities.®
- Keyword
- Publication Type
Articles 1 - 2 of 2
Full-Text Articles in Number Theory
Pascal's Triangle Modulo N And Its Applications To Efficient Computation Of Binomial Coefficients, Zachary Warneke
Pascal's Triangle Modulo N And Its Applications To Efficient Computation Of Binomial Coefficients, Zachary Warneke
Honors Theses
In this thesis, Pascal's Triangle modulo n will be explored for n prime and n a prime power. Using the results from the case when n is prime, a novel proof of Lucas' Theorem is given. Additionally, using both the results from the exploration of Pascal's Triangle here, as well as previous results, an efficient algorithm for computation of binomial coefficients modulo n (a choose b mod n) is described, and its time complexity is analyzed and compared to naive methods. In particular, the efficient algorithm runs in O(n log(a)) time (as opposed to …
Primes In Arithmetical Progression, Edward C. Wessel
Primes In Arithmetical Progression, Edward C. Wessel
Honors Theses
This thesis will tackle Dirichlet’s Theorem on Primes in Arithmetical Progressions. The majority of information that follows below will stem from Tom M. Apostol’s Introduction to Analytical Number Theory. This is the main source of all definitions, theorems, and method. However, I would like to assure the reader that prior knowledge of neither the text nor analytical number theory in general is needed to understand the result. A rough background in Abstract Algebra and a moderate grasp on Complex and Real Analysis are more than sufficient. In fact, my project’s intent is to introduce Dirichlet’s ideas to the mathematics student …