Abstract
AbstractThere are many results in the literature concerning linear combinations of factorials among terms of linear recurrence sequences. Recently, Grossman and Luca provided effective bounds for such terms of binary recurrence sequences. In this paper we show that under certain conditions, even the greatest prime divisor of $$u_n-a_1m_1!-\dots -a_km_k!$$
u
n
-
a
1
m
1
!
-
⋯
-
a
k
m
k
!
tends to infinity, in an effective way. We give some applications of this result, as well.
Funder
Eötvös Loránd Tudományegyetem
European Social Fund
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Mathematics (miscellaneous)
Reference10 articles.
1. Bollman, M., Hernández, S.H., Luca, F.: Fibonacci numbers which are sums of three factorials. Publ. Math. Debrecen 77, 211–224 (2010)
2. Grossman, G., Luca, F.: Sums of factorials in binary recurrence sequences. J. Number Theory 93, 87–107 (2002)
3. Gúzman Sanchez, S., Luca, F.: Linear combinations of factorials and $$S$$-units in a binary recurrence sequence. Ann. Math. Qué. 38, 169–188 (2014)
4. Lengyel, T.: The order of the Fibonacci and Lucas numbers. Fibonacci Quart. 33, 234–239 (1995)
5. Lenstra, A.K., Lenstra, H.W., Jr., Lovász, L.: Factoring polynomials with rational coefficients. Math. Ann. 261(4), 515–534 (1982)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献