Joshua Harrington

collaborators

3 papers

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…

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 conditio…

math.CO2024

Paired $(n - 1)$ -to- $(n - 1)$ disjoint path covers in bipartite transposition-like graphs

Anna Coleman, Gabrielle Fischberg, Charles Gong +2

A paired $k$ -to- $k$ disjoint path cover of a graph $G$ is a collection of pairwise disjoint path subgraphs $P_{1}, P_{2}, \dots, P_{k}$ such that each $P_{i}$ has prescribed vertices $s_{i}$ a…

On SierpiÅski and Riesel Repdigits and Repintegers

A further investigation on covering systems with odd moduli

Paired (n−1)-to-(n−1) disjoint path covers in bipartite transposition-like graphs

On SierpiÅski and Riesel Repdigits and Repintegers

Paired $(n - 1)$ -to- $(n - 1)$ disjoint path covers in bipartite transposition-like graphs