On members of Lucas sequences which are products of factorials
classification
🧮 math.NT
keywords
lucascdotssequencebetterboundscasefactorialsgive
read the original abstract
Here, we show that if $\{U_n\}_{n\ge 0}$ is a Lucas sequence, then the largest $n$ such that $|U_n|=m_1!m_2!\cdots m_k!$ with $1<m_1\le m_2\le \cdots\le m_k$ satisfies $n<3\times 10^5$. We also give better bounds in case the roots of the Lucas sequence are real.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.