Computer Science and Engineering, Department of
Computer Science, Computer Engineering, and Bioinformatics: Dissertations, Theses, and Student Research
First Advisor
Vinodchandran Variyam
Committee Members
Jitender Deogun, Lisong Xu
Date of this Version
4-2025
Document Type
Thesis
Citation
A thesis presented to the faculty of the Graduate College at the University of Nebraska in partial fulfillment of requirements for the degree of Master of Science
Major: Computer Science
Under the supervision of Professor Vinodchandran Variyam
Lincoln, Nebraska, April 2025
Abstract
Farey sequences are the sets of irreducible fractions in increasing order with denominator less or equal to some integer n. They are a well-known concept in number theory problems and are related to many other concepts in number theory including integer factoring, Fibonacci sequences, and Riemann’s Zeta function. In this paper, we investigate some known algorithms to solve certain problems in Farey sequences from a computational perspective. In particular, we implement established algorithms that have not been previously implemented with the goal of creating a package that can be used more broadly. We also develop a new algorithm for rational search which generalizes known algorithms for the problem.
Advisor: Vinodchandran Variyam
Comments
Copyright 2025, Connor Weyers. Used by permission