English

Only finitely many $s$-Cullen numbers are repunits for a fixed $s\ge 2$

Number Theory 2021-12-22 v2

Abstract

We show that for any integer s2s \geq 2, there are only finitely many ss-Cullen numbers that are repunits. More precisely, for fixed s2s \ge 2, there are only finitely many integers nn, bb, and qq with n2n \geq 2, b2b \geq 2 and q3q \geq 3 such that Cn,s=nsn+1=bq1b1.C_{n,s} = ns^n + 1 = \frac{b^q -1}{b-1}. The proof is elementary and effective, and it is used to show that there are no ss-Cullen repunits, other than explicitly known ones, for all s[2,8896]s \in [2,8896].

Keywords

Cite

@article{arxiv.2112.04935,
  title  = {Only finitely many $s$-Cullen numbers are repunits for a fixed $s\ge 2$},
  author = {Michael Filaseta and Jon Grantham and Hester Graves},
  journal= {arXiv preprint arXiv:2112.04935},
  year   = {2021}
}

Comments

v2. Corrections and clarifications in computation section