On members of Lucas sequences which are products of factorials
Abstract
Here, we show that if \Un\n 0 is a Lucas sequence, then the largest n such that |Un|=m1!m2!·s mk! with 1<m1 m2 ·s mk satisfies n<3× 105. We also give better bounds in case the roots of the Lucas sequence are real.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.