Bispels, ChrisCohen, MatthewHarrington, JoshuaPontes, KaelynSchaumann, LeifWong, Tony W. H.2025-06-172025-06-172025-05-01https://doi.org/10.48550/arXiv.2505.00778http://hdl.handle.net/11603/39094For positive integers b≥2 , k<b, and t we say that an integer k₆⁽ᵗ⁾ is a b-repdigit if k₆⁽ᵗ⁾ can be expressed as the digit k repeated t times in base-b representation, i.e., k₆⁽ᵗ⁾ =k(bᵗ-1)/(b-1). In the case of k=1, we say that 1₆⁽ᵗ⁾ 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⋅2ⁿ+1 is composite for all positive integers $n$ and Riesel numbers are similarly defined for the expression k⋅2ⁿ-1.12 pagesen-USAttribution 4.0 Internationalhttps://creativecommons.org/licenses/by/4.0/Mathematics - Number TheoryText