On Sierpiński and Riesel Repdigits and Repintegers

For positive integers $b\ge 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$ representation, i.e., $k_b^{(t)}=k(b^t-1)\mathrm{/}(b-1)$. In the case of $k=1$, we say that $1_b^{(t)}$ is a $b$-repunit. In this article, we investigate the existsence of $b$-repdigits and $b$-repunits among the sets of Sierpiński numbers and Riesel numbers. A Sierpiński number is defined as an odd integer $k$ for which $k\cdot 2^n+1$ is composite for all positive integers $n$ and Riesel numbers are similarly defined for the expression $k\cdot 2^n-1$.