PreprintarXiv licencearXiv
On the generalized Sierpiński and Riesel numbers
Abstract
In this paper, we prove that for any fixed base b ≥ 2, there exists an infinite arithmetic progression of positive integers k that are simultaneously generalized Sierpiński and generalized Riesel numbers in base b. More precisely, we construct such an arithmetic progression so that both k· bn + 1 and k· bn − 1 have at least two distinct prime factors for every positive integer n. Our approach uses covering systems, following the ideas of Erdős and later constructions of Harrington. The argument is then completed using Zsigmondy's theorem on primitive divisors together with properties of multiplicative orders.
Related
- On the Divisibility Relation σ(n)|σ(n+h) and a Generalized Erdős--Sierpiński Conjecture
- An Integral Representation of the Generalized Fibonacci Numbers
- On concatenations of two k-generalized Pell numbers
- Strong law of large numbers for generalized operator means II
- Multiplicative independence in the sequence of k-generalized Pell numbers
BibTeX
@misc{virbalas2026generalized,
title = {{On the generalized Sierpiński and Riesel numbers}},
author = {Paulius Virbalas},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.05149},
eprint = {2610.05149},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.05149},
}
RIS
TY - UNPB
TI - On the generalized Sierpiński and Riesel numbers
AU - Paulius Virbalas
PY - 2026
DA - 2026/10/04
PB - arXiv
DO - 10.48550/arxiv.2610.05149
UR - https://arxiv.org/abs/2610.05149
AB - In this paper, we prove that for any fixed base b ≥ 2, there exists an infinite arithmetic progression of positive integers k that are simultaneously generalized Sierpiński and generalized Riesel numbers in base b. More precisely, we construct such an arithmetic progression so that both k· b^n + 1 and k· b^n − 1 have at least two distinct prime factors for every positive integer n. Our approach uses covering systems, following the ideas of Erdős and later constructions of Harrington. The argument is then completed using Zsigmondy's theorem on primitive divisors together with properties of multiplicative orders.
ER -