Open Access. Powered by Scholars. Published by Universities.®
- Institution
Articles 1 - 3 of 3
Full-Text Articles in Entire DC Network
Classification Of Torsion Subgroups For Mordell Curves, Zachary Porat
Classification Of Torsion Subgroups For Mordell Curves, Zachary Porat
Honors Theses
Elliptic curves are an interesting area of study in mathematics, laying at the intersection of algebra, geometry, and number theory. They are a powerful tool, having applications in everything from Andrew Wiles’ proof of Fermat’s Last Theorem to cybersecurity. In this paper, we first provide an introduction to elliptic curves by discussing their geometry and associated group structure. We then narrow our focus, further investigating the torsion subgroups of elliptic curves. In particular, we will examine two methods used to classify these subgroups. We finish by employing these methods to categorize the torsion subgroups for a specific family of elliptic …
An Algebraic Approach To Number Theory Using Unique Factorization, Mark Sullivan
An Algebraic Approach To Number Theory Using Unique Factorization, Mark Sullivan
Honors Theses
Though it may seem non-intuitive, abstract algebra is often useful in the study of number theory. In this thesis, we explore some uses of abstract algebra to prove number theoretic statements. We begin by examining the structure of unique factorization domains in general. Then we introduce number fields and their rings of algebraic integers, whose structures have characteristics that are analogous to some of those of the rational numbers and the rational integers. Next we discuss quadratic fields, a special case of number fields that have important applications to number theoretic problems. We will use the structures that we introduce …
On Conway's Generalization Of The 3x + 1 Problem, Robin M. Givens
On Conway's Generalization Of The 3x + 1 Problem, Robin M. Givens
Honors Theses
This thesis considers a variation of the 3x+1, or Collatz, Problem involving a function we call the Conway function. The Conway function is defined by letting C3(n)=2k for n=3k and C3(n)=4k±1 for n=3k±1, where n is an integer. The iterates of this function generate a few 'short' cycles, but the s' tructural dynamics are otherwise unknown. We investigate properties of the Conway function and other related functions. We also discuss the possibility of using the Conway function to generate keys for cryptographic use based on a fast, efficient binary implemenation of the function. Questions related to the conjectured tree-like structure …