6 citations · 19 across the 19 of their papers we have counts for
21 papers
Generalized Wieferich primes and monogenic trinomials
Amy Falk, Joshua Harrington, Lenny Jones
Let be an integer and let be a prime. We say that is a {\em generalized Wieferich prime base }, or more succinctly, a {\em base- Wieferich prime,} if $b…
Covering systems where the prime divisors of all moduli are only , , or
Joshua Harrington, Jonah Klein, Joshua Lowrance +1
We try to find all quadruples of positive integers with such that there exists a distinct covering system with minimum modulus and least common mu…
On the monogenicity and Galois groups of
Joshua Harrington, Lenny Jones
Let , where is a prime and with . If is irreducible over , we say that is monogenic if $\{1,θ,θ^2…
Generalized Sierpiński and Riesel numbers of the form
Hailey Evans, Joshua Harrington, Kendall Heiney +1
Let be an integer. We call an integer a -Sierpiński number if and is composite for all positive integers . We similarly call $k…
Monogenic sextic trinomials and their Galois groups
Joshua Harrington, Lenny Jones
Let , with , and suppose that is irreducible over . We define to be {\em monogenic} if $\{1,θ,θ^2,θ^3,θ^4,θ^{5…
Monogenic Cyclic Polynomials in Recurrence Sequences
Joshua Harrington, Lenny Jones
Let be an th degree polynomial that is monic and irreducible over . We say that is {\em monogenic} if …
Monogenic trinomials of the form and their Galois groups
Joshua Harrington, Lenny Jones
Let , where . Let denote the cyclic group of order , the dihedral group of order 8, and the alternating group of or…
Monogenic Quartic Polynomials and Their Galois Groups
Joshua Harrington, Lenny Jones
A monic polynomial of degree is called monogenic if is irreducible over and is a basis for the ring…
Arithmetic progressions of integers that are relatively prime to their digital sums
Ryan Blau, Joshua Harrington, Sarah Lohrey +2
For an integer , we call a positive integer -anti-Niven if it is relatively prime to the sum of the digits in its base- representation. In this article, we investiga…
Every arithmetic progression contains infinitely many -Niven numbers
Joshua Harrington, Matthew Litman, Tony W. H. Wong
For an integer , a positive integer is called a -Niven number if it is a multiple of the sum of the digits in its base- representation. In this article, we show that…
The Irreducibility and Monogenicity of Power-Compositional Trinomials
Joshua Harrington, Lenny Jones
A polynomial of degree is called \emph{monogenic} if is irreducible over and is a basis for the ring…
Probabilistic chip-collecting games with modulo winning conditions
Joshua Harrington, Xuwen Hua, Xufei Liu +3
Let , , and be integers with . In a certain two-player probabilistic chip-collecting game, Alice tosses a coin to determine whether she collects chips or …
Covering systems with odd moduli
Joshua Harrington, Yewen Sun, Wing Hong Tony Wong
The concept of a covering system was first introduced by Erdős in 1950. Since their introduction, a lot of the research regarding covering systems has focused on the existence of c…
Residue sums of Dickson polynomials over finite fields
Thomas Brazelton, Joshua Harrington, Matthew Litman +1
Given a polynomial with integral coefficients, one can inquire about the possible residues it can take in its image modulo a prime . The sum over the distinct residues can somet…
On binomial coefficients associated with Sierpiński and Riesel numbers
Ashley Armbruster, Grace Barger, Sofya Bykova +5
In this paper, we investigate the existence of Sierpiński numbers and Riesel numbers as binomial coefficients. We show that for any odd positive integer , there exist infinitely…
On the properties of fibotomic polynomials
Cameron Byer, Tyler Dvorachek, Emily Eckard +3
Define the -th fibotomic polynomial to be the product of the monic irredicible factors of the -th Fibonacci polynomial which are not factors of any Fibonacci polynomial of sm…
Sum index and difference index of graphs
Joshua Harrington, Eugene Henninger-Voss, Kedjar Karhadkar +2
Let be a nonempty simple graph with a vertex set and an edge set . For every injective vertex labeling , there are two induced edge labelings,…
Monogenic cyclotomic compositions
Joshua Harrington, Lenny Jones
Let and be positive integers, and let be a prime. Let , where is the cyclotomic polynomial of index . In this article,…
An Investigation on Partitions with Equal Products
Byungchul Cha, Adam Claman, Joshua Harrington +6
An ordered triple is called admissible if there exist two different multisets and such that and share the sa…
On the Domination Number of Permutation Graphs and an Application to Strong Fixed Points
Theresa Baren, Michael Cory, Mia Friedberg +6
A permutation graph is a simple graph with vertices corresponding to the elements of and an edge between and when and are inverted in . A set of vertic…
Representing Integers as the Sum of Two Squares in the Ring
Joshua Harrington, Lenny Jones, Alicia Lamarche
A classical theorem in number theory due to Euler states that a positive integer can be written as the sum of two squares if and only if all prime factors of , with $q\e…