Joshua Lowrance

collaborators

3 papers

math.NT2026

Covering systems where the prime divisors of all moduli are only $2$ , $3$ , or $5$

Joshua Harrington, Jonah Klein, Joshua Lowrance +1

We try to find all quadruples of positive integers $(m, a, b, c)$ with $a \geq b \geq c$ such that there exists a distinct covering system with minimum modulus $m$ and least common mu…

math.NT2025

A further investigation on covering systems with odd moduli

Chris Bispels, Matthew Cohen, Joshua Harrington +4

Erdős first introduced the idea of covering systems in 1950. Since then, much of the work in this area has concentrated on identifying covering systems that meet specific condition…

math.NT2025

On Sierpiński and Riesel Repdigits and Repintegers

Chris Bispels, Matthew Cohen, Joshua Harrington +4

For positive integers $b \geq 2$ , $k < b$ , and $t$ , we say that an integer $k_{b}^{(t)}$ is a $b$ -repdigit if $k_{b}^{(t)}$ can be expressed as the digit $k$ repeated $t$ times in base-$b…

Covering systems where the prime divisors of all moduli are only 2, 3, or 5

A further investigation on covering systems with odd moduli

On Sierpiński and Riesel Repdigits and Repintegers

Covering systems where the prime divisors of all moduli are only $2$ , $3$ , or $5$