Open Access. Powered by Scholars. Published by Universities.®
- Discipline
Articles 1 - 3 of 3
Full-Text Articles in Number Theory
Proving Dirichlet's Theorem On Arithmetic Progressions, Owen T. Abma
Proving Dirichlet's Theorem On Arithmetic Progressions, Owen T. Abma
Undergraduate Student Research Internships Conference
First proved by German mathematician Dirichlet in 1837, this important theorem states that for coprime integers a, m, there are an infinite number of primes p such that p = a (mod m). This is one of many extensions of Euclid’s theorem that there are infinitely many prime numbers. In this paper, we will formulate a rather elegant proof of Dirichlet’s theorem using ideas from complex analysis and group theory.
Unomaha Problem Of The Week (2021-2022 Edition), Brad Horner, Jordan M. Sahs
Unomaha Problem Of The Week (2021-2022 Edition), Brad Horner, Jordan M. Sahs
UNO Student Research and Creative Activity Fair
The University of Omaha math department's Problem of the Week was taken over in Fall 2019 from faculty by the authors. The structure: each semester (Fall and Spring), three problems are given per week for twelve weeks, with each problem worth ten points - mimicking the structure of arguably the most well-regarded university math competition around, the Putnam Competition, with prizes awarded to top-scorers at semester's end. The weekly competition was halted midway through Spring 2020 due to COVID-19, but relaunched again in Fall 2021, with massive changes.
Now there are three difficulty tiers to POW problems, roughly corresponding to …
A Strange Attractor Of Primes, Alexander Hare
A Strange Attractor Of Primes, Alexander Hare
ONU Student Research Colloquium
The greatest prime factor sequences (GPF sequences), born at ONU in 2005, are integer sequences satisfying recursions in which every term is the greatest prime factor of a linear combination with positive integer coefficients of the preceding k terms (where k is the order of the sequence), possibly including a positive constant. The very first GPF sequence that was introduced satisfies the recursion x(n+1)=GPF(2*x(n)+1). In 2005 it was conjectured that no matter the seed, this particular GPF sequence enters the limit cycle (attractor) 3-7-5-11-23-47-19-13. In our current work, of a computational nature, we introduce the functions “depth” – where depth(n) …