Author:
Faye Bernadette,Luca Florian,Ziegler Volker
Abstract
AbstractLet S be a finite, fixed set of primes. In this paper, we show that the set of integers c which have at least two representations as a difference between a factorial and an S-unit is finite and effectively computable. In particular, we find all integers that can be written in at least two ways as a difference of a factorial and an S-unit associated with the set of primes $$\{2,3,5,7\}$$
{
2
,
3
,
5
,
7
}
.
Funder
Paris Lodron University of Salzburg
Publisher
Springer Science and Business Media LLC
Subject
Algebra and Number Theory
Reference23 articles.
1. Baker, A., Wüstholz, G.: Logarithmic forms and group varieties. J. Reine Angew. Math. 442, 19–62 (1993)
2. Bravo, J.J., Luca, F., Yazán, K.: On Pillai’s problem with Tribonacci numbers and powers of 2. Bull. Korean Math. Soc. 54(3), 1069–1080 (2017)
3. Chim, K.C., Pink, I., Ziegler, V.: On a variant of Pillai’s problem. Int. J. Number Theory 13(7), 1711–1727 (2017)
4. Chim, K.C., Pink, I., Ziegler, V.: On a variant of Pillai’s problem II. J. Number Theory 183, 269–290 (2018)
5. Ddamulira, M.: On the problem of Pillai with tribonacci numbers and powers of 3. J. Integer Seq. 22(5), Art. 19.5.6, 14 (2019)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献