English

Additive Diophantine Equations involving S-Units, Factorials and Ternary Recurrences with repeated root

Number Theory 2026-05-28 v1

Abstract

Let Cn=n2n+1C_n=n2^n+1 denote the nnth Cullen number. There has been recent interest in finding all Cullen numbers having a given Diophantine property. We prove that, for a fixed integer kk and bounded integers a1,,aka_1,\ldots,a_k, the greatest prime divisor of Cna1m1!akmk!C_n-a_1m_1!-\cdots-a_km_k! tends to infinity, in an effective way. We prove this for some more general families of ternary recurrence sequences as well. We also solve the Diophantine equation Cn=m1!+m2!+s,C_n = m_1! + m_2! + s, where ss is a positive integer composed of primes 2,3,5,72,3,5,7.

Keywords

Cite

@article{arxiv.2605.28449,
  title  = {Additive Diophantine Equations involving S-Units, Factorials and Ternary Recurrences with repeated root},
  author = {Vikas Godara and Divyum Sharma},
  journal= {arXiv preprint arXiv:2605.28449},
  year   = {2026}
}