2000 character limit reached
Linear Combinations of Factorial and $S$-unit in a Ternary recurrence sequence with a double root
Published 20 Apr 2025 in math.NT | (2504.14513v1)
Abstract: Here, we show that if $u_n=n2n\pm 1$, then the largest prime factor of $u_n\pm m!$ for $n\ge 0,~m\ge 2$ tends to infinity with $\max{m,n}$. In particular, the largest $n$ participating in the equation $u_n\pm m!=2a3b5c7d$ with $n\ge 1,~m\ge 2$ is $n=8$ for which $(8\cdot 28+1)-4!=34\cdot 52$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.